./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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/uthash-2.0.2/uthash_FNV_test6-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 e4ea247b245ebcaf5e735452e89c4110c7b9dc9b43836e98484a894783fc3462 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 11:50:50,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 11:50:50,885 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 11:50:50,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 11:50:50,889 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 11:50:50,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 11:50:50,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 11:50:50,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 11:50:50,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 11:50:50,916 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 11:50:50,916 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 11:50:50,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 11:50:50,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 11:50:50,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 11:50:50,918 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 11:50:50,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 11:50:50,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 11:50:50,919 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 11:50:50,920 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 11:50:50,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 11:50:50,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 11:50:50,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 11:50:50,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 11:50:50,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 11:50:50,926 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 11:50:50,927 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 11:50:50,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 11:50:50,927 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 11:50:50,928 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 11:50:50,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 11:50:50,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 11:50:50,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 11:50:50,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 11:50:50,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 11:50:50,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 11:50:50,929 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 11:50:50,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 11:50:50,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 11:50:50,931 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 11:50:50,931 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 11:50:50,931 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 11:50:50,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 11:50:50,933 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 -> e4ea247b245ebcaf5e735452e89c4110c7b9dc9b43836e98484a894783fc3462 [2024-11-12 11:50:51,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 11:50:51,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 11:50:51,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 11:50:51,226 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 11:50:51,227 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 11:50:51,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i [2024-11-12 11:50:52,726 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 11:50:53,036 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 11:50:53,037 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i [2024-11-12 11:50:53,059 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d4eeb367/842198988c474061b64c1b7ea9d5066f/FLAG68fcd485e [2024-11-12 11:50:53,073 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d4eeb367/842198988c474061b64c1b7ea9d5066f [2024-11-12 11:50:53,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 11:50:53,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 11:50:53,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 11:50:53,078 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 11:50:53,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 11:50:53,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 11:50:53" (1/1) ... [2024-11-12 11:50:53,083 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4883685a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:50:53, skipping insertion in model container [2024-11-12 11:50:53,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 11:50:53" (1/1) ... [2024-11-12 11:50:53,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 11:50:53,689 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/uthash-2.0.2/uthash_FNV_test6-2.i[44118,44131] [2024-11-12 11:50:53,706 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/uthash-2.0.2/uthash_FNV_test6-2.i[44660,44673] [2024-11-12 11:50:53,833 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/uthash-2.0.2/uthash_FNV_test6-2.i[56247,56260] [2024-11-12 11:50:53,834 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/uthash-2.0.2/uthash_FNV_test6-2.i[56368,56381] [2024-11-12 11:50:53,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 11:50:53,881 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 11:50:53,933 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/uthash-2.0.2/uthash_FNV_test6-2.i[44118,44131] [2024-11-12 11:50:53,936 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/uthash-2.0.2/uthash_FNV_test6-2.i[44660,44673] [2024-11-12 11:50:54,081 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/uthash-2.0.2/uthash_FNV_test6-2.i[56247,56260] [2024-11-12 11:50:54,086 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/uthash-2.0.2/uthash_FNV_test6-2.i[56368,56381] [2024-11-12 11:50:54,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 11:50:54,171 INFO L204 MainTranslator]: Completed translation [2024-11-12 11:50:54,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:50:54 WrapperNode [2024-11-12 11:50:54,172 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 11:50:54,173 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 11:50:54,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 11:50:54,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 11:50:54,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:50:54" (1/1) ... [2024-11-12 11:50:54,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:50:54" (1/1) ... [2024-11-12 11:50:54,323 INFO L138 Inliner]: procedures = 282, calls = 349, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1647 [2024-11-12 11:50:54,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 11:50:54,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 11:50:54,325 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 11:50:54,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 11:50:54,343 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:50:54" (1/1) ... [2024-11-12 11:50:54,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:50:54" (1/1) ... [2024-11-12 11:50:54,356 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:50:54" (1/1) ... [2024-11-12 11:50:54,472 INFO L175 MemorySlicer]: Split 318 memory accesses to 4 slices as follows [2, 12, 34, 270]. 85 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 62 writes are split as follows [0, 1, 4, 57]. [2024-11-12 11:50:54,476 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:50:54" (1/1) ... [2024-11-12 11:50:54,477 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:50:54" (1/1) ... [2024-11-12 11:50:54,530 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:50:54" (1/1) ... [2024-11-12 11:50:54,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:50:54" (1/1) ... [2024-11-12 11:50:54,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:50:54" (1/1) ... [2024-11-12 11:50:54,574 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:50:54" (1/1) ... [2024-11-12 11:50:54,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 11:50:54,589 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 11:50:54,589 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 11:50:54,589 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 11:50:54,590 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:50:54" (1/1) ... [2024-11-12 11:50:54,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 11:50:54,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 11:50:54,630 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-12 11:50:54,640 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-12 11:50:54,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 11:50:54,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 11:50:54,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 11:50:54,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 11:50:54,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-12 11:50:54,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 11:50:54,688 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-12 11:50:54,689 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-12 11:50:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 11:50:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 11:50:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 11:50:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-12 11:50:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 11:50:54,690 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 11:50:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 11:50:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 11:50:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 11:50:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-12 11:50:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 11:50:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 11:50:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-12 11:50:54,692 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-12 11:50:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 11:50:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 11:50:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 11:50:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-12 11:50:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-12 11:50:54,693 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-12 11:50:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 11:50:54,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 11:50:54,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 11:50:54,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-12 11:50:54,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 11:50:54,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 11:50:54,983 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 11:50:54,985 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 11:50:56,495 INFO L? ?]: Removed 364 outVars from TransFormulas that were not future-live. [2024-11-12 11:50:56,495 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 11:50:56,525 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 11:50:56,526 INFO L316 CfgBuilder]: Removed 72 assume(true) statements. [2024-11-12 11:50:56,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 11:50:56 BoogieIcfgContainer [2024-11-12 11:50:56,526 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 11:50:56,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 11:50:56,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 11:50:56,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 11:50:56,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 11:50:53" (1/3) ... [2024-11-12 11:50:56,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48dd226c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 11:50:56, skipping insertion in model container [2024-11-12 11:50:56,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:50:54" (2/3) ... [2024-11-12 11:50:56,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48dd226c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 11:50:56, skipping insertion in model container [2024-11-12 11:50:56,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 11:50:56" (3/3) ... [2024-11-12 11:50:56,536 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test6-2.i [2024-11-12 11:50:56,551 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 11:50:56,551 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-12 11:50:56,619 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 11:50:56,626 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;@1620fd07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 11:50:56,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-12 11:50:56,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 474 states, 450 states have (on average 1.5977777777777777) internal successors, (719), 454 states have internal predecessors, (719), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 11:50:56,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 11:50:56,636 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:50:56,637 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:50:56,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:50:56,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:50:56,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1705359720, now seen corresponding path program 1 times [2024-11-12 11:50:56,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:50:56,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73232412] [2024-11-12 11:50:56,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:50:56,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:50:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:50:56,871 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-12 11:50:56,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:50:56,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73232412] [2024-11-12 11:50:56,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73232412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:50:56,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:50:56,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 11:50:56,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598686193] [2024-11-12 11:50:56,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:50:56,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 11:50:56,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:50:56,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 11:50:56,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 11:50:56,926 INFO L87 Difference]: Start difference. First operand has 474 states, 450 states have (on average 1.5977777777777777) internal successors, (719), 454 states have internal predecessors, (719), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-12 11:50:57,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:50:57,002 INFO L93 Difference]: Finished difference Result 943 states and 1508 transitions. [2024-11-12 11:50:57,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 11:50:57,005 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2024-11-12 11:50:57,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:50:57,019 INFO L225 Difference]: With dead ends: 943 [2024-11-12 11:50:57,019 INFO L226 Difference]: Without dead ends: 467 [2024-11-12 11:50:57,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 11:50:57,028 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 11:50:57,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 11:50:57,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-11-12 11:50:57,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2024-11-12 11:50:57,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 444 states have (on average 1.4256756756756757) internal successors, (633), 448 states have internal predecessors, (633), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:50:57,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 663 transitions. [2024-11-12 11:50:57,097 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 663 transitions. Word has length 8 [2024-11-12 11:50:57,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:50:57,098 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 663 transitions. [2024-11-12 11:50:57,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-12 11:50:57,098 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 663 transitions. [2024-11-12 11:50:57,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-12 11:50:57,099 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:50:57,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:50:57,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 11:50:57,100 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:50:57,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:50:57,103 INFO L85 PathProgramCache]: Analyzing trace with hash -68909494, now seen corresponding path program 1 times [2024-11-12 11:50:57,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:50:57,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639485947] [2024-11-12 11:50:57,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:50:57,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:50:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:50:57,304 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-12 11:50:57,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:50:57,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639485947] [2024-11-12 11:50:57,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639485947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:50:57,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:50:57,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 11:50:57,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371600351] [2024-11-12 11:50:57,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:50:57,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 11:50:57,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:50:57,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 11:50:57,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 11:50:57,310 INFO L87 Difference]: Start difference. First operand 467 states and 663 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-12 11:50:57,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:50:57,535 INFO L93 Difference]: Finished difference Result 1158 states and 1654 transitions. [2024-11-12 11:50:57,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 11:50:57,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-11-12 11:50:57,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:50:57,542 INFO L225 Difference]: With dead ends: 1158 [2024-11-12 11:50:57,542 INFO L226 Difference]: Without dead ends: 907 [2024-11-12 11:50:57,544 INFO L434 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-12 11:50:57,545 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 606 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 11:50:57,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 2113 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 11:50:57,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2024-11-12 11:50:57,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 469. [2024-11-12 11:50:57,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 446 states have (on average 1.4237668161434978) internal successors, (635), 450 states have internal predecessors, (635), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:50:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 665 transitions. [2024-11-12 11:50:57,599 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 665 transitions. Word has length 10 [2024-11-12 11:50:57,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:50:57,600 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 665 transitions. [2024-11-12 11:50:57,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-12 11:50:57,600 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 665 transitions. [2024-11-12 11:50:57,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 11:50:57,603 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:50:57,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:50:57,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 11:50:57,605 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:50:57,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:50:57,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2094545925, now seen corresponding path program 1 times [2024-11-12 11:50:57,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:50:57,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481619555] [2024-11-12 11:50:57,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:50:57,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:50:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:50:57,986 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-12 11:50:57,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:50:57,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481619555] [2024-11-12 11:50:57,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481619555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:50:57,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:50:57,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 11:50:57,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481418713] [2024-11-12 11:50:57,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:50:57,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 11:50:57,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:50:57,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 11:50:57,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 11:50:57,992 INFO L87 Difference]: Start difference. First operand 469 states and 665 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:50:58,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:50:58,102 INFO L93 Difference]: Finished difference Result 892 states and 1260 transitions. [2024-11-12 11:50:58,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 11:50:58,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-12 11:50:58,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:50:58,107 INFO L225 Difference]: With dead ends: 892 [2024-11-12 11:50:58,108 INFO L226 Difference]: Without dead ends: 427 [2024-11-12 11:50:58,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-12 11:50:58,110 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 36 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 11:50:58,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1660 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 11:50:58,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-12 11:50:58,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2024-11-12 11:50:58,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 404 states have (on average 1.381188118811881) internal successors, (558), 408 states have internal predecessors, (558), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:50:58,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 588 transitions. [2024-11-12 11:50:58,129 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 588 transitions. Word has length 66 [2024-11-12 11:50:58,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:50:58,129 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 588 transitions. [2024-11-12 11:50:58,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:50:58,130 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 588 transitions. [2024-11-12 11:50:58,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 11:50:58,136 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:50:58,136 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:50:58,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 11:50:58,136 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:50:58,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:50:58,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1762783129, now seen corresponding path program 1 times [2024-11-12 11:50:58,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:50:58,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685272898] [2024-11-12 11:50:58,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:50:58,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:50:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:50:58,268 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-12 11:50:58,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:50:58,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685272898] [2024-11-12 11:50:58,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685272898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:50:58,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:50:58,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 11:50:58,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142784208] [2024-11-12 11:50:58,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:50:58,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 11:50:58,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:50:58,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 11:50:58,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 11:50:58,271 INFO L87 Difference]: Start difference. First operand 427 states and 588 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:50:58,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:50:58,337 INFO L93 Difference]: Finished difference Result 844 states and 1166 transitions. [2024-11-12 11:50:58,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 11:50:58,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-12 11:50:58,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:50:58,340 INFO L225 Difference]: With dead ends: 844 [2024-11-12 11:50:58,340 INFO L226 Difference]: Without dead ends: 421 [2024-11-12 11:50:58,341 INFO L434 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-12 11:50:58,342 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 9 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 11:50:58,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1661 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 11:50:58,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-12 11:50:58,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2024-11-12 11:50:58,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 398 states have (on average 1.3768844221105527) internal successors, (548), 402 states have internal predecessors, (548), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:50:58,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 578 transitions. [2024-11-12 11:50:58,355 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 578 transitions. Word has length 66 [2024-11-12 11:50:58,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:50:58,356 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 578 transitions. [2024-11-12 11:50:58,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:50:58,356 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 578 transitions. [2024-11-12 11:50:58,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 11:50:58,357 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:50:58,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:50:58,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 11:50:58,358 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:50:58,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:50:58,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1018233745, now seen corresponding path program 1 times [2024-11-12 11:50:58,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:50:58,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469767369] [2024-11-12 11:50:58,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:50:58,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:50:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:50:58,831 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-12 11:50:58,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:50:58,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469767369] [2024-11-12 11:50:58,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469767369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:50:58,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:50:58,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 11:50:58,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893516234] [2024-11-12 11:50:58,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:50:58,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 11:50:58,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:50:58,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 11:50:58,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 11:50:58,835 INFO L87 Difference]: Start difference. First operand 421 states and 578 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:50:59,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:50:59,210 INFO L93 Difference]: Finished difference Result 843 states and 1160 transitions. [2024-11-12 11:50:59,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 11:50:59,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-12 11:50:59,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:50:59,213 INFO L225 Difference]: With dead ends: 843 [2024-11-12 11:50:59,213 INFO L226 Difference]: Without dead ends: 426 [2024-11-12 11:50:59,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 11:50:59,217 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 10 mSDsluCounter, 1951 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2512 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 11:50:59,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2512 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 11:50:59,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-12 11:50:59,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 423. [2024-11-12 11:50:59,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 400 states have (on average 1.375) internal successors, (550), 404 states have internal predecessors, (550), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:50:59,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 580 transitions. [2024-11-12 11:50:59,237 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 580 transitions. Word has length 66 [2024-11-12 11:50:59,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:50:59,238 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 580 transitions. [2024-11-12 11:50:59,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:50:59,239 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 580 transitions. [2024-11-12 11:50:59,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-12 11:50:59,240 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:50:59,241 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:50:59,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 11:50:59,241 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:50:59,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:50:59,245 INFO L85 PathProgramCache]: Analyzing trace with hash -2097980756, now seen corresponding path program 1 times [2024-11-12 11:50:59,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:50:59,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301914324] [2024-11-12 11:50:59,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:50:59,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:50:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:50:59,534 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-12 11:50:59,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:50:59,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301914324] [2024-11-12 11:50:59,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301914324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:50:59,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:50:59,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 11:50:59,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455679808] [2024-11-12 11:50:59,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:50:59,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 11:50:59,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:50:59,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 11:50:59,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 11:50:59,539 INFO L87 Difference]: Start difference. First operand 423 states and 580 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:50:59,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:50:59,668 INFO L93 Difference]: Finished difference Result 842 states and 1156 transitions. [2024-11-12 11:50:59,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 11:50:59,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-12 11:50:59,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:50:59,673 INFO L225 Difference]: With dead ends: 842 [2024-11-12 11:50:59,673 INFO L226 Difference]: Without dead ends: 423 [2024-11-12 11:50:59,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 11:50:59,676 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 13 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 11:50:59,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1573 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 11:50:59,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-12 11:50:59,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2024-11-12 11:50:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 400 states have (on average 1.3725) internal successors, (549), 404 states have internal predecessors, (549), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:50:59,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 579 transitions. [2024-11-12 11:50:59,692 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 579 transitions. Word has length 67 [2024-11-12 11:50:59,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:50:59,694 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 579 transitions. [2024-11-12 11:50:59,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:50:59,694 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 579 transitions. [2024-11-12 11:50:59,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-12 11:50:59,695 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:50:59,695 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:50:59,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 11:50:59,696 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:50:59,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:50:59,697 INFO L85 PathProgramCache]: Analyzing trace with hash 362380824, now seen corresponding path program 1 times [2024-11-12 11:50:59,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:50:59,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079713924] [2024-11-12 11:50:59,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:50:59,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:50:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:51:00,018 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-12 11:51:00,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:51:00,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079713924] [2024-11-12 11:51:00,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079713924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:51:00,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:51:00,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 11:51:00,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277239552] [2024-11-12 11:51:00,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:51:00,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 11:51:00,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:51:00,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 11:51:00,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 11:51:00,021 INFO L87 Difference]: Start difference. First operand 423 states and 579 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:00,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:51:00,355 INFO L93 Difference]: Finished difference Result 847 states and 1162 transitions. [2024-11-12 11:51:00,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 11:51:00,356 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-12 11:51:00,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:51:00,359 INFO L225 Difference]: With dead ends: 847 [2024-11-12 11:51:00,359 INFO L226 Difference]: Without dead ends: 428 [2024-11-12 11:51:00,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 11:51:00,361 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 10 mSDsluCounter, 2459 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 3014 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 11:51:00,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 3014 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 11:51:00,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-12 11:51:00,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 427. [2024-11-12 11:51:00,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 404 states have (on average 1.3712871287128714) internal successors, (554), 408 states have internal predecessors, (554), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:51:00,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 584 transitions. [2024-11-12 11:51:00,375 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 584 transitions. Word has length 67 [2024-11-12 11:51:00,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:51:00,376 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 584 transitions. [2024-11-12 11:51:00,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:00,376 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 584 transitions. [2024-11-12 11:51:00,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-12 11:51:00,377 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:51:00,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:51:00,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 11:51:00,378 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:51:00,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:51:00,378 INFO L85 PathProgramCache]: Analyzing trace with hash 543599956, now seen corresponding path program 1 times [2024-11-12 11:51:00,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:51:00,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207213612] [2024-11-12 11:51:00,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:51:00,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:51:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:51:00,601 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-12 11:51:00,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:51:00,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207213612] [2024-11-12 11:51:00,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207213612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:51:00,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:51:00,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 11:51:00,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627633315] [2024-11-12 11:51:00,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:51:00,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 11:51:00,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:51:00,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 11:51:00,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 11:51:00,604 INFO L87 Difference]: Start difference. First operand 427 states and 584 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:00,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:51:00,822 INFO L93 Difference]: Finished difference Result 853 states and 1169 transitions. [2024-11-12 11:51:00,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 11:51:00,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-12 11:51:00,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:51:00,827 INFO L225 Difference]: With dead ends: 853 [2024-11-12 11:51:00,827 INFO L226 Difference]: Without dead ends: 430 [2024-11-12 11:51:00,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 11:51:00,829 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 4 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2061 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 11:51:00,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2061 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 11:51:00,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-12 11:51:00,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2024-11-12 11:51:00,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 407 states have (on average 1.3685503685503686) internal successors, (557), 411 states have internal predecessors, (557), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:51:00,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 587 transitions. [2024-11-12 11:51:00,848 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 587 transitions. Word has length 68 [2024-11-12 11:51:00,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:51:00,849 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 587 transitions. [2024-11-12 11:51:00,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:00,850 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 587 transitions. [2024-11-12 11:51:00,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-12 11:51:00,852 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:51:00,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:51:00,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 11:51:00,853 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:51:00,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:51:00,853 INFO L85 PathProgramCache]: Analyzing trace with hash 2064596987, now seen corresponding path program 1 times [2024-11-12 11:51:00,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:51:00,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479608933] [2024-11-12 11:51:00,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:51:00,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:51:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:51:01,269 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-12 11:51:01,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:51:01,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479608933] [2024-11-12 11:51:01,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479608933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:51:01,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:51:01,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 11:51:01,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176797966] [2024-11-12 11:51:01,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:51:01,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 11:51:01,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:51:01,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 11:51:01,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 11:51:01,273 INFO L87 Difference]: Start difference. First operand 430 states and 587 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:51:01,740 INFO L93 Difference]: Finished difference Result 869 states and 1191 transitions. [2024-11-12 11:51:01,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 11:51:01,741 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-12 11:51:01,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:51:01,746 INFO L225 Difference]: With dead ends: 869 [2024-11-12 11:51:01,746 INFO L226 Difference]: Without dead ends: 443 [2024-11-12 11:51:01,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-12 11:51:01,750 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 30 mSDsluCounter, 3509 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 4065 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 11:51:01,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 4065 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 11:51:01,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-12 11:51:01,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 440. [2024-11-12 11:51:01,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 417 states have (on average 1.369304556354916) internal successors, (571), 421 states have internal predecessors, (571), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:51:01,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 601 transitions. [2024-11-12 11:51:01,768 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 601 transitions. Word has length 68 [2024-11-12 11:51:01,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:51:01,768 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 601 transitions. [2024-11-12 11:51:01,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:01,769 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 601 transitions. [2024-11-12 11:51:01,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-12 11:51:01,772 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:51:01,772 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:51:01,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 11:51:01,773 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:51:01,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:51:01,774 INFO L85 PathProgramCache]: Analyzing trace with hash -617699308, now seen corresponding path program 1 times [2024-11-12 11:51:01,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:51:01,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166785137] [2024-11-12 11:51:01,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:51:01,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:51:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:51:02,252 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-12 11:51:02,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:51:02,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166785137] [2024-11-12 11:51:02,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166785137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:51:02,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:51:02,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 11:51:02,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982721525] [2024-11-12 11:51:02,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:51:02,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 11:51:02,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:51:02,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 11:51:02,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 11:51:02,255 INFO L87 Difference]: Start difference. First operand 440 states and 601 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:02,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:51:02,579 INFO L93 Difference]: Finished difference Result 879 states and 1203 transitions. [2024-11-12 11:51:02,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 11:51:02,580 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-12 11:51:02,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:51:02,582 INFO L225 Difference]: With dead ends: 879 [2024-11-12 11:51:02,582 INFO L226 Difference]: Without dead ends: 443 [2024-11-12 11:51:02,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-12 11:51:02,584 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 23 mSDsluCounter, 2508 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3068 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 11:51:02,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3068 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 11:51:02,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-12 11:51:02,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2024-11-12 11:51:02,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 420 states have (on average 1.3666666666666667) internal successors, (574), 424 states have internal predecessors, (574), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:51:02,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 604 transitions. [2024-11-12 11:51:02,597 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 604 transitions. Word has length 68 [2024-11-12 11:51:02,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:51:02,597 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 604 transitions. [2024-11-12 11:51:02,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 604 transitions. [2024-11-12 11:51:02,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-12 11:51:02,598 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:51:02,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:51:02,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 11:51:02,599 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:51:02,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:51:02,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1880623215, now seen corresponding path program 1 times [2024-11-12 11:51:02,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:51:02,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397464425] [2024-11-12 11:51:02,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:51:02,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:51:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:51:02,870 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-12 11:51:02,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:51:02,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397464425] [2024-11-12 11:51:02,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397464425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:51:02,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:51:02,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 11:51:02,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803621872] [2024-11-12 11:51:02,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:51:02,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 11:51:02,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:51:02,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 11:51:02,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 11:51:02,872 INFO L87 Difference]: Start difference. First operand 443 states and 604 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:03,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:51:03,204 INFO L93 Difference]: Finished difference Result 887 states and 1212 transitions. [2024-11-12 11:51:03,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 11:51:03,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-12 11:51:03,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:51:03,207 INFO L225 Difference]: With dead ends: 887 [2024-11-12 11:51:03,208 INFO L226 Difference]: Without dead ends: 448 [2024-11-12 11:51:03,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 11:51:03,209 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 9 mSDsluCounter, 2459 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3020 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 11:51:03,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3020 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 11:51:03,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-12 11:51:03,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 443. [2024-11-12 11:51:03,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 420 states have (on average 1.3666666666666667) internal successors, (574), 424 states have internal predecessors, (574), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:51:03,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 604 transitions. [2024-11-12 11:51:03,224 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 604 transitions. Word has length 69 [2024-11-12 11:51:03,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:51:03,224 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 604 transitions. [2024-11-12 11:51:03,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:03,224 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 604 transitions. [2024-11-12 11:51:03,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-12 11:51:03,225 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:51:03,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:51:03,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 11:51:03,225 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:51:03,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:51:03,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1143892763, now seen corresponding path program 1 times [2024-11-12 11:51:03,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:51:03,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162857048] [2024-11-12 11:51:03,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:51:03,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:51:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:51:03,845 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-12 11:51:03,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:51:03,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162857048] [2024-11-12 11:51:03,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162857048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:51:03,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:51:03,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 11:51:03,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605005517] [2024-11-12 11:51:03,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:51:03,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 11:51:03,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:51:03,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 11:51:03,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-12 11:51:03,848 INFO L87 Difference]: Start difference. First operand 443 states and 604 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:04,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:51:04,970 INFO L93 Difference]: Finished difference Result 1279 states and 1758 transitions. [2024-11-12 11:51:04,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 11:51:04,971 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-12 11:51:04,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:51:04,975 INFO L225 Difference]: With dead ends: 1279 [2024-11-12 11:51:04,975 INFO L226 Difference]: Without dead ends: 840 [2024-11-12 11:51:04,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-12 11:51:04,977 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 649 mSDsluCounter, 3704 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 4347 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 11:51:04,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 4347 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-12 11:51:04,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-11-12 11:51:04,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 475. [2024-11-12 11:51:04,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 452 states have (on average 1.3407079646017699) internal successors, (606), 456 states have internal predecessors, (606), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:51:04,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 636 transitions. [2024-11-12 11:51:05,000 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 636 transitions. Word has length 69 [2024-11-12 11:51:05,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:51:05,000 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 636 transitions. [2024-11-12 11:51:05,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:05,001 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 636 transitions. [2024-11-12 11:51:05,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-12 11:51:05,002 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:51:05,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:51:05,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 11:51:05,003 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:51:05,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:51:05,003 INFO L85 PathProgramCache]: Analyzing trace with hash -251769952, now seen corresponding path program 1 times [2024-11-12 11:51:05,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:51:05,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284055133] [2024-11-12 11:51:05,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:51:05,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:51:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:51:05,311 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-12 11:51:05,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:51:05,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284055133] [2024-11-12 11:51:05,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284055133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:51:05,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:51:05,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 11:51:05,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35898010] [2024-11-12 11:51:05,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:51:05,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 11:51:05,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:51:05,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 11:51:05,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-12 11:51:05,314 INFO L87 Difference]: Start difference. First operand 475 states and 636 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:05,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:51:05,610 INFO L93 Difference]: Finished difference Result 924 states and 1250 transitions. [2024-11-12 11:51:05,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 11:51:05,611 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-12 11:51:05,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:51:05,614 INFO L225 Difference]: With dead ends: 924 [2024-11-12 11:51:05,614 INFO L226 Difference]: Without dead ends: 485 [2024-11-12 11:51:05,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-12 11:51:05,616 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 16 mSDsluCounter, 2554 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3109 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 11:51:05,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3109 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 11:51:05,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-11-12 11:51:05,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 478. [2024-11-12 11:51:05,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 455 states have (on average 1.3406593406593406) internal successors, (610), 459 states have internal predecessors, (610), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:51:05,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 640 transitions. [2024-11-12 11:51:05,631 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 640 transitions. Word has length 70 [2024-11-12 11:51:05,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:51:05,631 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 640 transitions. [2024-11-12 11:51:05,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:05,631 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 640 transitions. [2024-11-12 11:51:05,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-12 11:51:05,632 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:51:05,632 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:51:05,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 11:51:05,633 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:51:05,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:51:05,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1885470852, now seen corresponding path program 1 times [2024-11-12 11:51:05,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:51:05,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365297430] [2024-11-12 11:51:05,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:51:05,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:51:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:51:05,955 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-12 11:51:05,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:51:05,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365297430] [2024-11-12 11:51:05,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365297430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:51:05,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:51:05,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 11:51:05,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777096618] [2024-11-12 11:51:05,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:51:05,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 11:51:05,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:51:05,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 11:51:05,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 11:51:05,958 INFO L87 Difference]: Start difference. First operand 478 states and 640 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:06,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:51:06,441 INFO L93 Difference]: Finished difference Result 930 states and 1258 transitions. [2024-11-12 11:51:06,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 11:51:06,442 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-12 11:51:06,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:51:06,446 INFO L225 Difference]: With dead ends: 930 [2024-11-12 11:51:06,446 INFO L226 Difference]: Without dead ends: 488 [2024-11-12 11:51:06,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-12 11:51:06,448 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 26 mSDsluCounter, 3441 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 4001 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 11:51:06,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 4001 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 11:51:06,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-11-12 11:51:06,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 478. [2024-11-12 11:51:06,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 455 states have (on average 1.3406593406593406) internal successors, (610), 459 states have internal predecessors, (610), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:51:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 640 transitions. [2024-11-12 11:51:06,467 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 640 transitions. Word has length 70 [2024-11-12 11:51:06,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:51:06,467 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 640 transitions. [2024-11-12 11:51:06,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:06,467 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 640 transitions. [2024-11-12 11:51:06,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-12 11:51:06,468 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:51:06,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:51:06,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 11:51:06,469 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:51:06,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:51:06,469 INFO L85 PathProgramCache]: Analyzing trace with hash 100457695, now seen corresponding path program 1 times [2024-11-12 11:51:06,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:51:06,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713340568] [2024-11-12 11:51:06,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:51:06,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:51:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:51:06,775 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-12 11:51:06,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:51:06,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713340568] [2024-11-12 11:51:06,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713340568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:51:06,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:51:06,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 11:51:06,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75177480] [2024-11-12 11:51:06,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:51:06,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 11:51:06,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:51:06,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 11:51:06,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-12 11:51:06,777 INFO L87 Difference]: Start difference. First operand 478 states and 640 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:07,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:51:07,234 INFO L93 Difference]: Finished difference Result 936 states and 1267 transitions. [2024-11-12 11:51:07,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 11:51:07,235 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-12 11:51:07,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:51:07,238 INFO L225 Difference]: With dead ends: 936 [2024-11-12 11:51:07,238 INFO L226 Difference]: Without dead ends: 494 [2024-11-12 11:51:07,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-12 11:51:07,241 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 22 mSDsluCounter, 3494 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 4056 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 11:51:07,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 4056 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 11:51:07,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-11-12 11:51:07,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 488. [2024-11-12 11:51:07,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 465 states have (on average 1.3376344086021505) internal successors, (622), 469 states have internal predecessors, (622), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:51:07,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 652 transitions. [2024-11-12 11:51:07,260 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 652 transitions. Word has length 71 [2024-11-12 11:51:07,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:51:07,261 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 652 transitions. [2024-11-12 11:51:07,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:07,262 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 652 transitions. [2024-11-12 11:51:07,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-12 11:51:07,263 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:51:07,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:51:07,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 11:51:07,263 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:51:07,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:51:07,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1930413179, now seen corresponding path program 1 times [2024-11-12 11:51:07,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:51:07,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009343775] [2024-11-12 11:51:07,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:51:07,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:51:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:51:07,612 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-12 11:51:07,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:51:07,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009343775] [2024-11-12 11:51:07,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009343775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:51:07,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:51:07,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 11:51:07,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73439303] [2024-11-12 11:51:07,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:51:07,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 11:51:07,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:51:07,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 11:51:07,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 11:51:07,618 INFO L87 Difference]: Start difference. First operand 488 states and 652 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:08,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:51:08,079 INFO L93 Difference]: Finished difference Result 956 states and 1291 transitions. [2024-11-12 11:51:08,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 11:51:08,080 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-12 11:51:08,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:51:08,083 INFO L225 Difference]: With dead ends: 956 [2024-11-12 11:51:08,083 INFO L226 Difference]: Without dead ends: 504 [2024-11-12 11:51:08,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 11:51:08,085 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 13 mSDsluCounter, 3984 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4532 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 11:51:08,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4532 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 11:51:08,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-11-12 11:51:08,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 491. [2024-11-12 11:51:08,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 468 states have (on average 1.3376068376068375) internal successors, (626), 472 states have internal predecessors, (626), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:51:08,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 656 transitions. [2024-11-12 11:51:08,109 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 656 transitions. Word has length 71 [2024-11-12 11:51:08,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:51:08,110 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 656 transitions. [2024-11-12 11:51:08,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:08,110 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 656 transitions. [2024-11-12 11:51:08,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-12 11:51:08,111 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:51:08,111 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:51:08,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 11:51:08,111 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:51:08,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:51:08,112 INFO L85 PathProgramCache]: Analyzing trace with hash 432360443, now seen corresponding path program 1 times [2024-11-12 11:51:08,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:51:08,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417206304] [2024-11-12 11:51:08,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:51:08,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:51:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:51:08,520 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-12 11:51:08,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:51:08,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417206304] [2024-11-12 11:51:08,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417206304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:51:08,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:51:08,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 11:51:08,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129458557] [2024-11-12 11:51:08,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:51:08,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 11:51:08,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:51:08,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 11:51:08,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 11:51:08,523 INFO L87 Difference]: Start difference. First operand 491 states and 656 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:08,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:51:08,829 INFO L93 Difference]: Finished difference Result 951 states and 1281 transitions. [2024-11-12 11:51:08,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 11:51:08,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-12 11:51:08,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:51:08,832 INFO L225 Difference]: With dead ends: 951 [2024-11-12 11:51:08,832 INFO L226 Difference]: Without dead ends: 496 [2024-11-12 11:51:08,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 11:51:08,834 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 7 mSDsluCounter, 2488 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3044 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 11:51:08,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3044 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 11:51:08,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-11-12 11:51:08,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 491. [2024-11-12 11:51:08,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 468 states have (on average 1.3354700854700854) internal successors, (625), 472 states have internal predecessors, (625), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:51:08,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 655 transitions. [2024-11-12 11:51:08,853 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 655 transitions. Word has length 71 [2024-11-12 11:51:08,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:51:08,853 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 655 transitions. [2024-11-12 11:51:08,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:08,854 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 655 transitions. [2024-11-12 11:51:08,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-12 11:51:08,854 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:51:08,854 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:51:08,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 11:51:08,855 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:51:08,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:51:08,855 INFO L85 PathProgramCache]: Analyzing trace with hash 2045031444, now seen corresponding path program 1 times [2024-11-12 11:51:08,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:51:08,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436116695] [2024-11-12 11:51:08,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:51:08,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:51:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:51:09,116 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-12 11:51:09,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:51:09,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436116695] [2024-11-12 11:51:09,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436116695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:51:09,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:51:09,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 11:51:09,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60054496] [2024-11-12 11:51:09,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:51:09,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 11:51:09,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:51:09,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 11:51:09,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 11:51:09,118 INFO L87 Difference]: Start difference. First operand 491 states and 655 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:09,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:51:09,439 INFO L93 Difference]: Finished difference Result 949 states and 1279 transitions. [2024-11-12 11:51:09,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 11:51:09,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-12 11:51:09,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:51:09,443 INFO L225 Difference]: With dead ends: 949 [2024-11-12 11:51:09,443 INFO L226 Difference]: Without dead ends: 494 [2024-11-12 11:51:09,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 11:51:09,444 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 4 mSDsluCounter, 2443 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3003 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 11:51:09,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3003 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 11:51:09,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-11-12 11:51:09,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2024-11-12 11:51:09,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 471 states have (on average 1.3333333333333333) internal successors, (628), 475 states have internal predecessors, (628), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:51:09,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 658 transitions. [2024-11-12 11:51:09,461 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 658 transitions. Word has length 71 [2024-11-12 11:51:09,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:51:09,461 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 658 transitions. [2024-11-12 11:51:09,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:09,462 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 658 transitions. [2024-11-12 11:51:09,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-12 11:51:09,462 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:51:09,463 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:51:09,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 11:51:09,463 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:51:09,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:51:09,464 INFO L85 PathProgramCache]: Analyzing trace with hash -665390877, now seen corresponding path program 1 times [2024-11-12 11:51:09,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:51:09,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931374828] [2024-11-12 11:51:09,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:51:09,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:51:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:51:09,920 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-12 11:51:09,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:51:09,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931374828] [2024-11-12 11:51:09,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931374828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:51:09,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:51:09,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 11:51:09,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176498611] [2024-11-12 11:51:09,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:51:09,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 11:51:09,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:51:09,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 11:51:09,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-12 11:51:09,924 INFO L87 Difference]: Start difference. First operand 494 states and 658 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:10,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:51:10,462 INFO L93 Difference]: Finished difference Result 964 states and 1298 transitions. [2024-11-12 11:51:10,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 11:51:10,463 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-12 11:51:10,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:51:10,466 INFO L225 Difference]: With dead ends: 964 [2024-11-12 11:51:10,466 INFO L226 Difference]: Without dead ends: 506 [2024-11-12 11:51:10,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-12 11:51:10,467 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 9 mSDsluCounter, 3483 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4042 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 11:51:10,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4042 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 11:51:10,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-12 11:51:10,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 498. [2024-11-12 11:51:10,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 475 states have (on average 1.3326315789473684) internal successors, (633), 479 states have internal predecessors, (633), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:51:10,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 663 transitions. [2024-11-12 11:51:10,484 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 663 transitions. Word has length 72 [2024-11-12 11:51:10,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:51:10,485 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 663 transitions. [2024-11-12 11:51:10,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:10,485 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 663 transitions. [2024-11-12 11:51:10,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-12 11:51:10,486 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:51:10,486 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:51:10,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 11:51:10,486 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:51:10,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:51:10,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1263182800, now seen corresponding path program 1 times [2024-11-12 11:51:10,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:51:10,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315719906] [2024-11-12 11:51:10,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:51:10,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:51:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:51:10,859 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-12 11:51:10,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:51:10,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315719906] [2024-11-12 11:51:10,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315719906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:51:10,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:51:10,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 11:51:10,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586619904] [2024-11-12 11:51:10,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:51:10,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 11:51:10,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:51:10,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 11:51:10,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-12 11:51:10,862 INFO L87 Difference]: Start difference. First operand 498 states and 663 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:11,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:51:11,372 INFO L93 Difference]: Finished difference Result 973 states and 1308 transitions. [2024-11-12 11:51:11,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 11:51:11,373 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-12 11:51:11,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:51:11,376 INFO L225 Difference]: With dead ends: 973 [2024-11-12 11:51:11,376 INFO L226 Difference]: Without dead ends: 511 [2024-11-12 11:51:11,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-12 11:51:11,379 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 22 mSDsluCounter, 4526 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 5082 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 11:51:11,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 5082 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 11:51:11,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-12 11:51:11,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 501. [2024-11-12 11:51:11,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 478 states have (on average 1.3305439330543933) internal successors, (636), 482 states have internal predecessors, (636), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:51:11,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 666 transitions. [2024-11-12 11:51:11,400 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 666 transitions. Word has length 72 [2024-11-12 11:51:11,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:51:11,400 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 666 transitions. [2024-11-12 11:51:11,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:11,401 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 666 transitions. [2024-11-12 11:51:11,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-12 11:51:11,401 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:51:11,401 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:51:11,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 11:51:11,402 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:51:11,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:51:11,403 INFO L85 PathProgramCache]: Analyzing trace with hash 228654279, now seen corresponding path program 1 times [2024-11-12 11:51:11,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:51:11,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268289818] [2024-11-12 11:51:11,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:51:11,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:51:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:51:11,938 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-12 11:51:11,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:51:11,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268289818] [2024-11-12 11:51:11,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268289818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:51:11,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:51:11,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 11:51:11,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488359619] [2024-11-12 11:51:11,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:51:11,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 11:51:11,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:51:11,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 11:51:11,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-12 11:51:11,940 INFO L87 Difference]: Start difference. First operand 501 states and 666 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:13,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:51:13,434 INFO L93 Difference]: Finished difference Result 972 states and 1304 transitions. [2024-11-12 11:51:13,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 11:51:13,435 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-12 11:51:13,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:51:13,439 INFO L225 Difference]: With dead ends: 972 [2024-11-12 11:51:13,439 INFO L226 Difference]: Without dead ends: 507 [2024-11-12 11:51:13,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-12 11:51:13,440 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 33 mSDsluCounter, 3418 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3971 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 11:51:13,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3971 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 11:51:13,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2024-11-12 11:51:13,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 502. [2024-11-12 11:51:13,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 479 states have (on average 1.3298538622129437) internal successors, (637), 483 states have internal predecessors, (637), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:51:13,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 667 transitions. [2024-11-12 11:51:13,456 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 667 transitions. Word has length 72 [2024-11-12 11:51:13,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:51:13,457 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 667 transitions. [2024-11-12 11:51:13,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:13,457 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 667 transitions. [2024-11-12 11:51:13,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-12 11:51:13,458 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:51:13,458 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:51:13,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 11:51:13,458 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:51:13,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:51:13,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1607808641, now seen corresponding path program 1 times [2024-11-12 11:51:13,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:51:13,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985443153] [2024-11-12 11:51:13,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:51:13,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:51:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:51:13,705 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-12 11:51:13,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:51:13,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985443153] [2024-11-12 11:51:13,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985443153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:51:13,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:51:13,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 11:51:13,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538655725] [2024-11-12 11:51:13,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:51:13,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 11:51:13,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:51:13,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 11:51:13,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 11:51:13,708 INFO L87 Difference]: Start difference. First operand 502 states and 667 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:14,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:51:14,170 INFO L93 Difference]: Finished difference Result 977 states and 1311 transitions. [2024-11-12 11:51:14,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 11:51:14,170 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-12 11:51:14,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:51:14,173 INFO L225 Difference]: With dead ends: 977 [2024-11-12 11:51:14,173 INFO L226 Difference]: Without dead ends: 511 [2024-11-12 11:51:14,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-12 11:51:14,177 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 22 mSDsluCounter, 3441 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 4001 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 11:51:14,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 4001 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 11:51:14,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-12 11:51:14,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 499. [2024-11-12 11:51:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 476 states have (on average 1.3319327731092436) internal successors, (634), 480 states have internal predecessors, (634), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:51:14,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 664 transitions. [2024-11-12 11:51:14,194 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 664 transitions. Word has length 72 [2024-11-12 11:51:14,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:51:14,194 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 664 transitions. [2024-11-12 11:51:14,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:14,195 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 664 transitions. [2024-11-12 11:51:14,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-12 11:51:14,195 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:51:14,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:51:14,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 11:51:14,196 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:51:14,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:51:14,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2084167451, now seen corresponding path program 1 times [2024-11-12 11:51:14,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:51:14,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570717545] [2024-11-12 11:51:14,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:51:14,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:51:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:51:29,923 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288)) (.cse0 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192))) (and (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (<= 4408680405129836981 (+ (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059) (* (div (+ (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|) 8817360810260198248 .cse1 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* (- 1) .cse0)) 4294967296) 2147483648))))) is different from false [2024-11-12 11:51:29,999 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-12 11:51:29,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:51:29,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570717545] [2024-11-12 11:51:29,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570717545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:51:29,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:51:29,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 11:51:30,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768133944] [2024-11-12 11:51:30,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:51:30,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 11:51:30,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:51:30,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 11:51:30,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2024-11-12 11:51:30,001 INFO L87 Difference]: Start difference. First operand 499 states and 664 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:51:34,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 11:51:38,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 11:51:41,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 11:51:43,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 11:51:47,504 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192)) (.cse3 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288))) (let ((.cse0 (+ .cse3 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse6 (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse7 (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059)) (.cse2 (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|)) (.cse4 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse5 (* (- 1) .cse1))) (and (or (< .cse0 (+ .cse1 (mod |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296))) (< 4408680405129836980 (+ (* 1030789529 |c_ULTIMATE.start_main_~_hj_i~0#1|) (* 2147483648 (div (+ .cse2 8817360810260198248 (* (- 2061579059) |c_ULTIMATE.start_main_~_hj_i~0#1|) .cse3 .cse4 .cse5) 4294967296)) .cse6 .cse7 (* (div |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296) 2147483648)))) (= .cse1 .cse0) (<= 4408680405129836981 (+ .cse6 .cse7 (* (div (+ .cse2 8817360810260198248 .cse3 .cse4 .cse5) 4294967296) 2147483648)))))) is different from false [2024-11-12 11:51:51,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 11:51:55,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 11:51:59,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 11:52:03,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 11:52:07,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 11:52:11,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 11:52:15,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 11:52:19,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []