./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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_SFH_test6-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:23:46,332 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:23:46,417 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 05:23:46,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:23:46,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:23:46,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:23:46,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:23:46,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:23:46,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 05:23:46,453 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 05:23:46,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:23:46,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:23:46,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:23:46,455 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:23:46,455 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:23:46,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:23:46,456 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:23:46,457 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:23:46,457 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:23:46,457 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:23:46,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:23:46,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:23:46,462 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:23:46,463 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:23:46,463 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:23:46,463 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:23:46,463 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:23:46,464 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:23:46,464 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:23:46,464 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:23:46,464 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 05:23:46,465 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:23:46,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:23:46,465 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:23:46,465 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:23:46,465 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:23:46,466 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:23:46,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:23:46,467 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:23:46,467 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:23:46,467 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:23:46,468 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:23:46,468 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 -> 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 [2024-11-19 05:23:46,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:23:46,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:23:46,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:23:46,777 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:23:46,777 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:23:46,778 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2024-11-19 05:23:48,301 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:23:48,628 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:23:48,628 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2024-11-19 05:23:48,665 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f8dde0e8/6cebb9712ddc4d95b1b8f953e45a45d8/FLAG5353f3626 [2024-11-19 05:23:48,882 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f8dde0e8/6cebb9712ddc4d95b1b8f953e45a45d8 [2024-11-19 05:23:48,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:23:48,885 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:23:48,886 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:23:48,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:23:48,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:23:48,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:23:48" (1/1) ... [2024-11-19 05:23:48,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f9f93bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:48, skipping insertion in model container [2024-11-19 05:23:48,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:23:48" (1/1) ... [2024-11-19 05:23:48,967 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:23:49,495 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_SFH_test6-1.i[44118,44131] [2024-11-19 05:23:49,517 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_SFH_test6-1.i[44660,44673] [2024-11-19 05:23:49,608 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_SFH_test6-1.i[56247,56260] [2024-11-19 05:23:49,609 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_SFH_test6-1.i[56368,56381] [2024-11-19 05:23:49,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:23:49,638 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:23:49,678 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_SFH_test6-1.i[44118,44131] [2024-11-19 05:23:49,681 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_SFH_test6-1.i[44660,44673] [2024-11-19 05:23:49,741 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_SFH_test6-1.i[56247,56260] [2024-11-19 05:23:49,742 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_SFH_test6-1.i[56368,56381] [2024-11-19 05:23:49,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:23:49,912 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:23:49,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:49 WrapperNode [2024-11-19 05:23:49,914 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:23:49,916 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:23:49,916 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:23:49,916 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:23:49,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:49" (1/1) ... [2024-11-19 05:23:49,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:49" (1/1) ... [2024-11-19 05:23:50,052 INFO L138 Inliner]: procedures = 282, calls = 296, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1477 [2024-11-19 05:23:50,054 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:23:50,055 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:23:50,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:23:50,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:23:50,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:49" (1/1) ... [2024-11-19 05:23:50,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:49" (1/1) ... [2024-11-19 05:23:50,084 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:49" (1/1) ... [2024-11-19 05:23:50,168 INFO L175 MemorySlicer]: Split 268 memory accesses to 4 slices as follows [2, 34, 12, 220]. 82 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 0, 10, 0]. The 54 writes are split as follows [0, 4, 1, 49]. [2024-11-19 05:23:50,168 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:49" (1/1) ... [2024-11-19 05:23:50,169 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:49" (1/1) ... [2024-11-19 05:23:50,210 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:49" (1/1) ... [2024-11-19 05:23:50,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:49" (1/1) ... [2024-11-19 05:23:50,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:49" (1/1) ... [2024-11-19 05:23:50,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:49" (1/1) ... [2024-11-19 05:23:50,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:23:50,256 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:23:50,256 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:23:50,257 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:23:50,257 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:49" (1/1) ... [2024-11-19 05:23:50,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:23:50,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:23:50,294 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-19 05:23:50,298 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-19 05:23:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 05:23:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 05:23:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 05:23:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 05:23:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-19 05:23:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 05:23:50,346 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-19 05:23:50,346 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-19 05:23:50,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 05:23:50,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 05:23:50,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 05:23:50,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 05:23:50,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 05:23:50,349 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 05:23:50,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 05:23:50,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 05:23:50,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 05:23:50,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 05:23:50,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 05:23:50,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:23:50,351 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-19 05:23:50,351 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-19 05:23:50,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 05:23:50,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 05:23:50,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 05:23:50,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-19 05:23:50,351 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-19 05:23:50,351 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-19 05:23:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 05:23:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 05:23:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 05:23:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 05:23:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:23:50,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:23:50,611 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:23:50,612 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:23:51,999 INFO L? ?]: Removed 333 outVars from TransFormulas that were not future-live. [2024-11-19 05:23:52,000 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:23:52,031 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:23:52,032 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-19 05:23:52,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:23:52 BoogieIcfgContainer [2024-11-19 05:23:52,032 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:23:52,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:23:52,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:23:52,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:23:52,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:23:48" (1/3) ... [2024-11-19 05:23:52,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df29222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:23:52, skipping insertion in model container [2024-11-19 05:23:52,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:49" (2/3) ... [2024-11-19 05:23:52,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df29222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:23:52, skipping insertion in model container [2024-11-19 05:23:52,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:23:52" (3/3) ... [2024-11-19 05:23:52,043 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test6-1.i [2024-11-19 05:23:52,060 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:23:52,060 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-19 05:23:52,258 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:23:52,274 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;@5c1c1a6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:23:52,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-19 05:23:52,281 INFO L276 IsEmpty]: Start isEmpty. Operand has 435 states, 413 states have (on average 1.5980629539951574) internal successors, (660), 417 states have internal predecessors, (660), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 05:23:52,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 05:23:52,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:23:52,288 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:23:52,289 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-19 05:23:52,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:23:52,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1705359720, now seen corresponding path program 1 times [2024-11-19 05:23:52,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:23:52,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788451295] [2024-11-19 05:23:52,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:23:52,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:23:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:23:52,518 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-19 05:23:52,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:23:52,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788451295] [2024-11-19 05:23:52,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788451295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:23:52,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:23:52,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:23:52,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916151827] [2024-11-19 05:23:52,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:23:52,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 05:23:52,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:23:52,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 05:23:52,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 05:23:52,559 INFO L87 Difference]: Start difference. First operand has 435 states, 413 states have (on average 1.5980629539951574) internal successors, (660), 417 states have internal predecessors, (660), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) 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-19 05:23:52,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:23:52,635 INFO L93 Difference]: Finished difference Result 865 states and 1380 transitions. [2024-11-19 05:23:52,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 05:23:52,637 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-19 05:23:52,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:23:52,649 INFO L225 Difference]: With dead ends: 865 [2024-11-19 05:23:52,649 INFO L226 Difference]: Without dead ends: 428 [2024-11-19 05:23:52,655 INFO L431 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-19 05:23:52,658 INFO L432 NwaCegarLoop]: 613 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, 613 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-19 05:23:52,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:23:52,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-19 05:23:52,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2024-11-19 05:23:52,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 407 states have (on average 1.434889434889435) internal successors, (584), 412 states have internal predecessors, (584), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:23:52,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 609 transitions. [2024-11-19 05:23:52,722 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 609 transitions. Word has length 8 [2024-11-19 05:23:52,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:23:52,723 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 609 transitions. [2024-11-19 05:23:52,723 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-19 05:23:52,723 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 609 transitions. [2024-11-19 05:23:52,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 05:23:52,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:23:52,724 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:23:52,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:23:52,725 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-19 05:23:52,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:23:52,726 INFO L85 PathProgramCache]: Analyzing trace with hash -68909494, now seen corresponding path program 1 times [2024-11-19 05:23:52,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:23:52,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079816641] [2024-11-19 05:23:52,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:23:52,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:23:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:23:52,977 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-19 05:23:52,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:23:52,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079816641] [2024-11-19 05:23:52,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079816641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:23:52,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:23:52,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:23:52,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454561025] [2024-11-19 05:23:52,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:23:52,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:23:52,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:23:52,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:23:52,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:23:52,988 INFO L87 Difference]: Start difference. First operand 428 states and 609 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-19 05:23:53,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:23:53,203 INFO L93 Difference]: Finished difference Result 1041 states and 1492 transitions. [2024-11-19 05:23:53,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:23:53,203 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-19 05:23:53,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:23:53,209 INFO L225 Difference]: With dead ends: 1041 [2024-11-19 05:23:53,209 INFO L226 Difference]: Without dead ends: 829 [2024-11-19 05:23:53,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:23:53,212 INFO L432 NwaCegarLoop]: 632 mSDtfsCounter, 557 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 05:23:53,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1841 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:23:53,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-11-19 05:23:53,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 430. [2024-11-19 05:23:53,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 409 states have (on average 1.4327628361858191) internal successors, (586), 414 states have internal predecessors, (586), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:23:53,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 611 transitions. [2024-11-19 05:23:53,263 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 611 transitions. Word has length 10 [2024-11-19 05:23:53,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:23:53,265 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 611 transitions. [2024-11-19 05:23:53,265 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-19 05:23:53,265 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 611 transitions. [2024-11-19 05:23:53,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 05:23:53,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:23:53,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:23:53,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:23:53,267 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-19 05:23:53,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:23:53,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1469408361, now seen corresponding path program 1 times [2024-11-19 05:23:53,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:23:53,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732094398] [2024-11-19 05:23:53,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:23:53,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:23:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:23:53,624 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-19 05:23:53,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:23:53,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732094398] [2024-11-19 05:23:53,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732094398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:23:53,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:23:53,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:23:53,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373728762] [2024-11-19 05:23:53,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:23:53,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:23:53,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:23:53,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:23:53,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:23:53,629 INFO L87 Difference]: Start difference. First operand 430 states and 611 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-19 05:23:53,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:23:53,734 INFO L93 Difference]: Finished difference Result 814 states and 1152 transitions. [2024-11-19 05:23:53,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:23:53,735 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-19 05:23:53,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:23:53,737 INFO L225 Difference]: With dead ends: 814 [2024-11-19 05:23:53,737 INFO L226 Difference]: Without dead ends: 388 [2024-11-19 05:23:53,738 INFO L431 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-19 05:23:53,739 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 36 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1498 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-19 05:23:53,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1498 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:23:53,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-19 05:23:53,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2024-11-19 05:23:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 367 states have (on average 1.3869209809264305) internal successors, (509), 372 states have internal predecessors, (509), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:23:53,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 534 transitions. [2024-11-19 05:23:53,751 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 534 transitions. Word has length 66 [2024-11-19 05:23:53,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:23:53,752 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 534 transitions. [2024-11-19 05:23:53,752 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-19 05:23:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 534 transitions. [2024-11-19 05:23:53,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 05:23:53,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:23:53,754 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:23:53,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:23:53,754 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-19 05:23:53,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:23:53,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1801171157, now seen corresponding path program 1 times [2024-11-19 05:23:53,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:23:53,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935299268] [2024-11-19 05:23:53,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:23:53,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:23:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:23:53,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-19 05:23:53,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:23:53,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935299268] [2024-11-19 05:23:53,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935299268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:23:53,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:23:53,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:23:53,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871068935] [2024-11-19 05:23:53,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:23:53,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:23:53,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:23:53,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:23:53,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:23:53,922 INFO L87 Difference]: Start difference. First operand 388 states and 534 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-19 05:23:53,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:23:53,983 INFO L93 Difference]: Finished difference Result 766 states and 1058 transitions. [2024-11-19 05:23:53,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:23:53,984 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-19 05:23:53,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:23:53,987 INFO L225 Difference]: With dead ends: 766 [2024-11-19 05:23:53,987 INFO L226 Difference]: Without dead ends: 382 [2024-11-19 05:23:53,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:23:53,989 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 9 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1499 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-19 05:23:53,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1499 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:23:53,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-19 05:23:53,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2024-11-19 05:23:53,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 361 states have (on average 1.3822714681440442) internal successors, (499), 366 states have internal predecessors, (499), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:23:54,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 524 transitions. [2024-11-19 05:23:54,001 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 524 transitions. Word has length 66 [2024-11-19 05:23:54,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:23:54,001 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 524 transitions. [2024-11-19 05:23:54,002 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-19 05:23:54,002 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 524 transitions. [2024-11-19 05:23:54,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 05:23:54,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:23:54,003 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:23:54,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:23:54,005 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-19 05:23:54,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:23:54,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1749246755, now seen corresponding path program 1 times [2024-11-19 05:23:54,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:23:54,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889595842] [2024-11-19 05:23:54,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:23:54,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:23:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:23:54,468 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-19 05:23:54,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:23:54,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889595842] [2024-11-19 05:23:54,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889595842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:23:54,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:23:54,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 05:23:54,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750350363] [2024-11-19 05:23:54,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:23:54,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:23:54,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:23:54,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:23:54,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:23:54,471 INFO L87 Difference]: Start difference. First operand 382 states and 524 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-19 05:23:54,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:23:54,844 INFO L93 Difference]: Finished difference Result 765 states and 1052 transitions. [2024-11-19 05:23:54,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:23:54,845 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-19 05:23:54,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:23:54,847 INFO L225 Difference]: With dead ends: 765 [2024-11-19 05:23:54,848 INFO L226 Difference]: Without dead ends: 387 [2024-11-19 05:23:54,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:23:54,851 INFO L432 NwaCegarLoop]: 507 mSDtfsCounter, 10 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2242 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-19 05:23:54,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2242 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:23:54,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-19 05:23:54,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 384. [2024-11-19 05:23:54,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 363 states have (on average 1.3801652892561984) internal successors, (501), 368 states have internal predecessors, (501), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:23:54,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 526 transitions. [2024-11-19 05:23:54,869 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 526 transitions. Word has length 66 [2024-11-19 05:23:54,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:23:54,870 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 526 transitions. [2024-11-19 05:23:54,870 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-19 05:23:54,870 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 526 transitions. [2024-11-19 05:23:54,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 05:23:54,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:23:54,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:23:54,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:23:54,872 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-19 05:23:54,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:23:54,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1465973530, now seen corresponding path program 1 times [2024-11-19 05:23:54,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:23:54,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678404233] [2024-11-19 05:23:54,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:23:54,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:23:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:23:55,207 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-19 05:23:55,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:23:55,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678404233] [2024-11-19 05:23:55,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678404233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:23:55,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:23:55,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:23:55,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691038271] [2024-11-19 05:23:55,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:23:55,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:23:55,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:23:55,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:23:55,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:23:55,209 INFO L87 Difference]: Start difference. First operand 384 states and 526 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-19 05:23:55,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:23:55,333 INFO L93 Difference]: Finished difference Result 764 states and 1048 transitions. [2024-11-19 05:23:55,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:23:55,335 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-19 05:23:55,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:23:55,337 INFO L225 Difference]: With dead ends: 764 [2024-11-19 05:23:55,337 INFO L226 Difference]: Without dead ends: 384 [2024-11-19 05:23:55,339 INFO L431 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-19 05:23:55,340 INFO L432 NwaCegarLoop]: 512 mSDtfsCounter, 13 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1411 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-19 05:23:55,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1411 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:23:55,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-19 05:23:55,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2024-11-19 05:23:55,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 363 states have (on average 1.3774104683195592) internal successors, (500), 368 states have internal predecessors, (500), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:23:55,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 525 transitions. [2024-11-19 05:23:55,360 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 525 transitions. Word has length 67 [2024-11-19 05:23:55,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:23:55,360 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 525 transitions. [2024-11-19 05:23:55,360 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-19 05:23:55,360 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 525 transitions. [2024-11-19 05:23:55,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 05:23:55,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:23:55,364 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:23:55,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:23:55,364 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-19 05:23:55,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:23:55,365 INFO L85 PathProgramCache]: Analyzing trace with hash -368632186, now seen corresponding path program 1 times [2024-11-19 05:23:55,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:23:55,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331305943] [2024-11-19 05:23:55,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:23:55,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:23:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:23:55,687 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-19 05:23:55,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:23:55,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331305943] [2024-11-19 05:23:55,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331305943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:23:55,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:23:55,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 05:23:55,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151027234] [2024-11-19 05:23:55,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:23:55,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 05:23:55,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:23:55,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 05:23:55,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:23:55,690 INFO L87 Difference]: Start difference. First operand 384 states and 525 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-19 05:23:56,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:23:56,029 INFO L93 Difference]: Finished difference Result 769 states and 1054 transitions. [2024-11-19 05:23:56,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 05:23:56,030 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-19 05:23:56,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:23:56,032 INFO L225 Difference]: With dead ends: 769 [2024-11-19 05:23:56,032 INFO L226 Difference]: Without dead ends: 389 [2024-11-19 05:23:56,041 INFO L431 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-19 05:23:56,042 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 10 mSDsluCounter, 2189 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2690 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-19 05:23:56,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2690 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:23:56,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-19 05:23:56,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 388. [2024-11-19 05:23:56,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 367 states have (on average 1.3760217983651226) internal successors, (505), 372 states have internal predecessors, (505), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:23:56,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 530 transitions. [2024-11-19 05:23:56,059 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 530 transitions. Word has length 67 [2024-11-19 05:23:56,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:23:56,060 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 530 transitions. [2024-11-19 05:23:56,061 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-19 05:23:56,062 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 530 transitions. [2024-11-19 05:23:56,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 05:23:56,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:23:56,063 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:23:56,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:23:56,064 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-19 05:23:56,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:23:56,065 INFO L85 PathProgramCache]: Analyzing trace with hash -187413054, now seen corresponding path program 1 times [2024-11-19 05:23:56,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:23:56,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443021264] [2024-11-19 05:23:56,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:23:56,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:23:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:23:56,339 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-19 05:23:56,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:23:56,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443021264] [2024-11-19 05:23:56,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443021264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:23:56,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:23:56,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 05:23:56,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103690493] [2024-11-19 05:23:56,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:23:56,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:23:56,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:23:56,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:23:56,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:23:56,345 INFO L87 Difference]: Start difference. First operand 388 states and 530 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-19 05:23:56,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:23:56,615 INFO L93 Difference]: Finished difference Result 775 states and 1061 transitions. [2024-11-19 05:23:56,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:23:56,615 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-19 05:23:56,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:23:56,618 INFO L225 Difference]: With dead ends: 775 [2024-11-19 05:23:56,619 INFO L226 Difference]: Without dead ends: 391 [2024-11-19 05:23:56,620 INFO L431 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-19 05:23:56,621 INFO L432 NwaCegarLoop]: 513 mSDtfsCounter, 4 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2265 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 05:23:56,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2265 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 05:23:56,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-19 05:23:56,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2024-11-19 05:23:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 370 states have (on average 1.372972972972973) internal successors, (508), 375 states have internal predecessors, (508), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:23:56,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 533 transitions. [2024-11-19 05:23:56,641 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 533 transitions. Word has length 68 [2024-11-19 05:23:56,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:23:56,641 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 533 transitions. [2024-11-19 05:23:56,642 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-19 05:23:56,642 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 533 transitions. [2024-11-19 05:23:56,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 05:23:56,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:23:56,643 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:23:56,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:23:56,643 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-19 05:23:56,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:23:56,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1333583977, now seen corresponding path program 1 times [2024-11-19 05:23:56,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:23:56,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146804813] [2024-11-19 05:23:56,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:23:56,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:23:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:23:57,139 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-19 05:23:57,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:23:57,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146804813] [2024-11-19 05:23:57,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146804813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:23:57,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:23:57,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 05:23:57,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191785370] [2024-11-19 05:23:57,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:23:57,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 05:23:57,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:23:57,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 05:23:57,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 05:23:57,142 INFO L87 Difference]: Start difference. First operand 391 states and 533 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-19 05:23:57,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:23:57,639 INFO L93 Difference]: Finished difference Result 791 states and 1083 transitions. [2024-11-19 05:23:57,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 05:23:57,640 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-19 05:23:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:23:57,643 INFO L225 Difference]: With dead ends: 791 [2024-11-19 05:23:57,643 INFO L226 Difference]: Without dead ends: 404 [2024-11-19 05:23:57,644 INFO L431 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-19 05:23:57,645 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 30 mSDsluCounter, 3131 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3633 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-19 05:23:57,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3633 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 05:23:57,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-19 05:23:57,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 401. [2024-11-19 05:23:57,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 380 states have (on average 1.3736842105263158) internal successors, (522), 385 states have internal predecessors, (522), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:23:57,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 547 transitions. [2024-11-19 05:23:57,657 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 547 transitions. Word has length 68 [2024-11-19 05:23:57,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:23:57,657 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 547 transitions. [2024-11-19 05:23:57,657 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-19 05:23:57,657 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 547 transitions. [2024-11-19 05:23:57,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 05:23:57,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:23:57,660 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:23:57,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:23:57,660 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-19 05:23:57,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:23:57,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1348712318, now seen corresponding path program 1 times [2024-11-19 05:23:57,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:23:57,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70949464] [2024-11-19 05:23:57,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:23:57,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:23:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:23:58,115 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-19 05:23:58,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:23:58,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70949464] [2024-11-19 05:23:58,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70949464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:23:58,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:23:58,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:23:58,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187793891] [2024-11-19 05:23:58,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:23:58,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:23:58,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:23:58,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:23:58,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:23:58,118 INFO L87 Difference]: Start difference. First operand 401 states and 547 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-19 05:23:58,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:23:58,520 INFO L93 Difference]: Finished difference Result 801 states and 1095 transitions. [2024-11-19 05:23:58,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 05:23:58,523 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-19 05:23:58,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:23:58,526 INFO L225 Difference]: With dead ends: 801 [2024-11-19 05:23:58,526 INFO L226 Difference]: Without dead ends: 404 [2024-11-19 05:23:58,527 INFO L431 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-19 05:23:58,527 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 23 mSDsluCounter, 2676 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3182 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 05:23:58,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3182 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:23:58,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-19 05:23:58,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2024-11-19 05:23:58,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 383 states have (on average 1.370757180156658) internal successors, (525), 388 states have internal predecessors, (525), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:23:58,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 550 transitions. [2024-11-19 05:23:58,542 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 550 transitions. Word has length 68 [2024-11-19 05:23:58,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:23:58,543 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 550 transitions. [2024-11-19 05:23:58,543 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-19 05:23:58,543 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 550 transitions. [2024-11-19 05:23:58,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-19 05:23:58,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:23:58,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:23:58,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:23:58,544 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-19 05:23:58,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:23:58,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1149610205, now seen corresponding path program 1 times [2024-11-19 05:23:58,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:23:58,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472585368] [2024-11-19 05:23:58,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:23:58,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:23:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:23:58,818 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-19 05:23:58,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:23:58,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472585368] [2024-11-19 05:23:58,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472585368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:23:58,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:23:58,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 05:23:58,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017026231] [2024-11-19 05:23:58,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:23:58,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 05:23:58,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:23:58,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 05:23:58,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:23:58,821 INFO L87 Difference]: Start difference. First operand 404 states and 550 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-19 05:23:59,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:23:59,177 INFO L93 Difference]: Finished difference Result 809 states and 1104 transitions. [2024-11-19 05:23:59,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 05:23:59,178 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-19 05:23:59,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:23:59,180 INFO L225 Difference]: With dead ends: 809 [2024-11-19 05:23:59,181 INFO L226 Difference]: Without dead ends: 409 [2024-11-19 05:23:59,182 INFO L431 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-19 05:23:59,182 INFO L432 NwaCegarLoop]: 507 mSDtfsCounter, 9 mSDsluCounter, 2189 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2696 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-19 05:23:59,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2696 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:23:59,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-19 05:23:59,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 404. [2024-11-19 05:23:59,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 383 states have (on average 1.370757180156658) internal successors, (525), 388 states have internal predecessors, (525), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:23:59,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 550 transitions. [2024-11-19 05:23:59,195 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 550 transitions. Word has length 69 [2024-11-19 05:23:59,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:23:59,195 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 550 transitions. [2024-11-19 05:23:59,196 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-19 05:23:59,196 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 550 transitions. [2024-11-19 05:23:59,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-19 05:23:59,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:23:59,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:23:59,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:23:59,197 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-19 05:23:59,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:23:59,198 INFO L85 PathProgramCache]: Analyzing trace with hash 412879753, now seen corresponding path program 1 times [2024-11-19 05:23:59,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:23:59,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996806616] [2024-11-19 05:23:59,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:23:59,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:23:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:23:59,757 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-19 05:23:59,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:23:59,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996806616] [2024-11-19 05:23:59,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996806616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:23:59,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:23:59,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 05:23:59,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772079772] [2024-11-19 05:23:59,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:23:59,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 05:23:59,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:23:59,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 05:23:59,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 05:23:59,759 INFO L87 Difference]: Start difference. First operand 404 states and 550 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-19 05:24:00,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:24:00,501 INFO L93 Difference]: Finished difference Result 1162 states and 1596 transitions. [2024-11-19 05:24:00,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 05:24:00,501 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-19 05:24:00,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:24:00,505 INFO L225 Difference]: With dead ends: 1162 [2024-11-19 05:24:00,505 INFO L226 Difference]: Without dead ends: 762 [2024-11-19 05:24:00,506 INFO L431 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-19 05:24:00,507 INFO L432 NwaCegarLoop]: 496 mSDtfsCounter, 600 mSDsluCounter, 2168 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 2664 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 05:24:00,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 2664 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 05:24:00,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2024-11-19 05:24:00,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 436. [2024-11-19 05:24:00,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 415 states have (on average 1.342168674698795) internal successors, (557), 420 states have internal predecessors, (557), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:24:00,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 582 transitions. [2024-11-19 05:24:00,523 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 582 transitions. Word has length 69 [2024-11-19 05:24:00,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:24:00,523 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 582 transitions. [2024-11-19 05:24:00,523 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-19 05:24:00,524 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 582 transitions. [2024-11-19 05:24:00,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-19 05:24:00,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:24:00,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:24:00,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:24:00,525 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-19 05:24:00,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:24:00,526 INFO L85 PathProgramCache]: Analyzing trace with hash -982782962, now seen corresponding path program 1 times [2024-11-19 05:24:00,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:24:00,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347026573] [2024-11-19 05:24:00,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:24:00,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:24:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:24:00,823 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-19 05:24:00,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:24:00,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347026573] [2024-11-19 05:24:00,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347026573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:24:00,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:24:00,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 05:24:00,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988121185] [2024-11-19 05:24:00,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:24:00,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 05:24:00,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:24:00,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 05:24:00,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 05:24:00,825 INFO L87 Difference]: Start difference. First operand 436 states and 582 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-19 05:24:01,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:24:01,127 INFO L93 Difference]: Finished difference Result 846 states and 1142 transitions. [2024-11-19 05:24:01,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 05:24:01,128 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-19 05:24:01,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:24:01,131 INFO L225 Difference]: With dead ends: 846 [2024-11-19 05:24:01,131 INFO L226 Difference]: Without dead ends: 446 [2024-11-19 05:24:01,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 05:24:01,133 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 16 mSDsluCounter, 2284 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2785 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-19 05:24:01,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2785 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:24:01,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-19 05:24:01,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 439. [2024-11-19 05:24:01,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 418 states have (on average 1.3421052631578947) internal successors, (561), 423 states have internal predecessors, (561), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:24:01,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 586 transitions. [2024-11-19 05:24:01,147 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 586 transitions. Word has length 70 [2024-11-19 05:24:01,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:24:01,148 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 586 transitions. [2024-11-19 05:24:01,148 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-19 05:24:01,148 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 586 transitions. [2024-11-19 05:24:01,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-19 05:24:01,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:24:01,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:24:01,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:24:01,149 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-19 05:24:01,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:24:01,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1154457842, now seen corresponding path program 1 times [2024-11-19 05:24:01,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:24:01,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459329341] [2024-11-19 05:24:01,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:24:01,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:24:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:24:01,424 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-19 05:24:01,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:24:01,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459329341] [2024-11-19 05:24:01,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459329341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:24:01,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:24:01,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 05:24:01,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287971895] [2024-11-19 05:24:01,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:24:01,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 05:24:01,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:24:01,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 05:24:01,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 05:24:01,427 INFO L87 Difference]: Start difference. First operand 439 states and 586 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-19 05:24:01,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:24:01,932 INFO L93 Difference]: Finished difference Result 852 states and 1150 transitions. [2024-11-19 05:24:01,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 05:24:01,933 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-19 05:24:01,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:24:01,936 INFO L225 Difference]: With dead ends: 852 [2024-11-19 05:24:01,936 INFO L226 Difference]: Without dead ends: 449 [2024-11-19 05:24:01,937 INFO L431 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-19 05:24:01,938 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 26 mSDsluCounter, 3063 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3569 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-19 05:24:01,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3569 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 05:24:01,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-19 05:24:01,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 439. [2024-11-19 05:24:01,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 418 states have (on average 1.3421052631578947) internal successors, (561), 423 states have internal predecessors, (561), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:24:01,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 586 transitions. [2024-11-19 05:24:01,959 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 586 transitions. Word has length 70 [2024-11-19 05:24:01,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:24:01,959 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 586 transitions. [2024-11-19 05:24:01,959 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-19 05:24:01,960 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 586 transitions. [2024-11-19 05:24:01,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-19 05:24:01,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:24:01,960 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:24:01,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 05:24:01,961 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-19 05:24:01,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:24:01,961 INFO L85 PathProgramCache]: Analyzing trace with hash -630555315, now seen corresponding path program 1 times [2024-11-19 05:24:01,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:24:01,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104519585] [2024-11-19 05:24:01,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:24:01,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:24:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:24:02,302 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-19 05:24:02,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:24:02,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104519585] [2024-11-19 05:24:02,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104519585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:24:02,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:24:02,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 05:24:02,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731307850] [2024-11-19 05:24:02,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:24:02,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 05:24:02,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:24:02,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 05:24:02,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 05:24:02,305 INFO L87 Difference]: Start difference. First operand 439 states and 586 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-19 05:24:02,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:24:02,784 INFO L93 Difference]: Finished difference Result 858 states and 1159 transitions. [2024-11-19 05:24:02,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 05:24:02,785 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-19 05:24:02,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:24:02,788 INFO L225 Difference]: With dead ends: 858 [2024-11-19 05:24:02,788 INFO L226 Difference]: Without dead ends: 455 [2024-11-19 05:24:02,791 INFO L431 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-19 05:24:02,791 INFO L432 NwaCegarLoop]: 508 mSDtfsCounter, 22 mSDsluCounter, 3116 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3624 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-19 05:24:02,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3624 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 05:24:02,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-19 05:24:02,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 449. [2024-11-19 05:24:02,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 428 states have (on average 1.338785046728972) internal successors, (573), 433 states have internal predecessors, (573), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:24:02,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 598 transitions. [2024-11-19 05:24:02,807 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 598 transitions. Word has length 71 [2024-11-19 05:24:02,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:24:02,808 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 598 transitions. [2024-11-19 05:24:02,808 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-19 05:24:02,808 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 598 transitions. [2024-11-19 05:24:02,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-19 05:24:02,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:24:02,809 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:24:02,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:24:02,809 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-19 05:24:02,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:24:02,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1199400169, now seen corresponding path program 1 times [2024-11-19 05:24:02,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:24:02,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44775604] [2024-11-19 05:24:02,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:24:02,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:24:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:24:03,159 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-19 05:24:03,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:24:03,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44775604] [2024-11-19 05:24:03,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44775604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:24:03,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:24:03,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 05:24:03,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887130698] [2024-11-19 05:24:03,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:24:03,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 05:24:03,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:24:03,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 05:24:03,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 05:24:03,164 INFO L87 Difference]: Start difference. First operand 449 states and 598 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-19 05:24:03,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:24:03,655 INFO L93 Difference]: Finished difference Result 878 states and 1183 transitions. [2024-11-19 05:24:03,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 05:24:03,656 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-19 05:24:03,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:24:03,659 INFO L225 Difference]: With dead ends: 878 [2024-11-19 05:24:03,659 INFO L226 Difference]: Without dead ends: 465 [2024-11-19 05:24:03,661 INFO L431 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-19 05:24:03,661 INFO L432 NwaCegarLoop]: 494 mSDtfsCounter, 13 mSDsluCounter, 3552 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4046 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.5s IncrementalHoareTripleChecker+Time [2024-11-19 05:24:03,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4046 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 05:24:03,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-19 05:24:03,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 452. [2024-11-19 05:24:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 431 states have (on average 1.3387470997679813) internal successors, (577), 436 states have internal predecessors, (577), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:24:03,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 602 transitions. [2024-11-19 05:24:03,678 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 602 transitions. Word has length 71 [2024-11-19 05:24:03,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:24:03,678 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 602 transitions. [2024-11-19 05:24:03,678 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-19 05:24:03,679 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 602 transitions. [2024-11-19 05:24:03,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-19 05:24:03,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:24:03,680 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:24:03,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 05:24:03,681 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-19 05:24:03,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:24:03,681 INFO L85 PathProgramCache]: Analyzing trace with hash -298652567, now seen corresponding path program 1 times [2024-11-19 05:24:03,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:24:03,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453418173] [2024-11-19 05:24:03,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:24:03,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:24:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:24:04,007 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-19 05:24:04,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:24:04,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453418173] [2024-11-19 05:24:04,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453418173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:24:04,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:24:04,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 05:24:04,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816182800] [2024-11-19 05:24:04,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:24:04,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 05:24:04,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:24:04,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 05:24:04,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:24:04,010 INFO L87 Difference]: Start difference. First operand 452 states and 602 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-19 05:24:04,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:24:04,308 INFO L93 Difference]: Finished difference Result 873 states and 1173 transitions. [2024-11-19 05:24:04,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 05:24:04,309 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-19 05:24:04,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:24:04,313 INFO L225 Difference]: With dead ends: 873 [2024-11-19 05:24:04,313 INFO L226 Difference]: Without dead ends: 457 [2024-11-19 05:24:04,314 INFO L431 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-19 05:24:04,314 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 7 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2720 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-19 05:24:04,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2720 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:24:04,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-19 05:24:04,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 452. [2024-11-19 05:24:04,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 431 states have (on average 1.3364269141531322) internal successors, (576), 436 states have internal predecessors, (576), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:24:04,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 601 transitions. [2024-11-19 05:24:04,327 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 601 transitions. Word has length 71 [2024-11-19 05:24:04,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:24:04,328 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 601 transitions. [2024-11-19 05:24:04,328 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-19 05:24:04,328 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 601 transitions. [2024-11-19 05:24:04,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-19 05:24:04,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:24:04,329 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:24:04,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 05:24:04,329 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-19 05:24:04,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:24:04,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1314018434, now seen corresponding path program 1 times [2024-11-19 05:24:04,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:24:04,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532258117] [2024-11-19 05:24:04,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:24:04,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:24:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:24:04,648 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-19 05:24:04,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:24:04,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532258117] [2024-11-19 05:24:04,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532258117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:24:04,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:24:04,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 05:24:04,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013349836] [2024-11-19 05:24:04,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:24:04,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 05:24:04,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:24:04,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 05:24:04,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:24:04,652 INFO L87 Difference]: Start difference. First operand 452 states and 601 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-19 05:24:04,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:24:04,989 INFO L93 Difference]: Finished difference Result 871 states and 1171 transitions. [2024-11-19 05:24:04,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 05:24:04,990 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-19 05:24:04,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:24:04,993 INFO L225 Difference]: With dead ends: 871 [2024-11-19 05:24:04,993 INFO L226 Difference]: Without dead ends: 455 [2024-11-19 05:24:04,996 INFO L431 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-19 05:24:04,996 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 4 mSDsluCounter, 2173 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2679 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-19 05:24:04,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2679 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:24:04,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-19 05:24:05,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2024-11-19 05:24:05,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 434 states have (on average 1.3341013824884793) internal successors, (579), 439 states have internal predecessors, (579), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:24:05,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 604 transitions. [2024-11-19 05:24:05,014 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 604 transitions. Word has length 71 [2024-11-19 05:24:05,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:24:05,014 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 604 transitions. [2024-11-19 05:24:05,014 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-19 05:24:05,014 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 604 transitions. [2024-11-19 05:24:05,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-19 05:24:05,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:24:05,015 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:24:05,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 05:24:05,016 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-19 05:24:05,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:24:05,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1396403887, now seen corresponding path program 1 times [2024-11-19 05:24:05,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:24:05,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692139450] [2024-11-19 05:24:05,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:24:05,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:24:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:24:05,542 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-19 05:24:05,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:24:05,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692139450] [2024-11-19 05:24:05,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692139450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:24:05,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:24:05,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 05:24:05,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026849312] [2024-11-19 05:24:05,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:24:05,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 05:24:05,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:24:05,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 05:24:05,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 05:24:05,548 INFO L87 Difference]: Start difference. First operand 455 states and 604 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-19 05:24:06,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:24:06,087 INFO L93 Difference]: Finished difference Result 886 states and 1190 transitions. [2024-11-19 05:24:06,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 05:24:06,088 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-19 05:24:06,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:24:06,091 INFO L225 Difference]: With dead ends: 886 [2024-11-19 05:24:06,092 INFO L226 Difference]: Without dead ends: 467 [2024-11-19 05:24:06,093 INFO L431 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-19 05:24:06,093 INFO L432 NwaCegarLoop]: 505 mSDtfsCounter, 9 mSDsluCounter, 3105 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3610 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-19 05:24:06,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3610 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 05:24:06,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-11-19 05:24:06,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 459. [2024-11-19 05:24:06,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 438 states have (on average 1.3333333333333333) internal successors, (584), 443 states have internal predecessors, (584), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:24:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 609 transitions. [2024-11-19 05:24:06,107 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 609 transitions. Word has length 72 [2024-11-19 05:24:06,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:24:06,108 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 609 transitions. [2024-11-19 05:24:06,108 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-19 05:24:06,108 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 609 transitions. [2024-11-19 05:24:06,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-19 05:24:06,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:24:06,109 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:24:06,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 05:24:06,109 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-19 05:24:06,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:24:06,110 INFO L85 PathProgramCache]: Analyzing trace with hash 532169790, now seen corresponding path program 1 times [2024-11-19 05:24:06,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:24:06,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788106807] [2024-11-19 05:24:06,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:24:06,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:24:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:24:06,441 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-19 05:24:06,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:24:06,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788106807] [2024-11-19 05:24:06,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788106807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:24:06,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:24:06,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 05:24:06,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565742278] [2024-11-19 05:24:06,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:24:06,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 05:24:06,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:24:06,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 05:24:06,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-19 05:24:06,443 INFO L87 Difference]: Start difference. First operand 459 states and 609 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-19 05:24:06,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:24:06,957 INFO L93 Difference]: Finished difference Result 895 states and 1200 transitions. [2024-11-19 05:24:06,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 05:24:06,958 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-19 05:24:06,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:24:06,961 INFO L225 Difference]: With dead ends: 895 [2024-11-19 05:24:06,961 INFO L226 Difference]: Without dead ends: 472 [2024-11-19 05:24:06,962 INFO L431 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-19 05:24:06,962 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 36 mSDsluCounter, 3574 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 4076 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 05:24:06,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 4076 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 05:24:06,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-19 05:24:06,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 462. [2024-11-19 05:24:06,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 441 states have (on average 1.3310657596371882) internal successors, (587), 446 states have internal predecessors, (587), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:24:06,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 612 transitions. [2024-11-19 05:24:06,979 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 612 transitions. Word has length 72 [2024-11-19 05:24:06,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:24:06,979 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 612 transitions. [2024-11-19 05:24:06,980 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-19 05:24:06,980 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 612 transitions. [2024-11-19 05:24:06,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-19 05:24:06,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:24:06,980 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:24:06,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 05:24:06,981 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-19 05:24:06,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:24:06,981 INFO L85 PathProgramCache]: Analyzing trace with hash -502358731, now seen corresponding path program 1 times [2024-11-19 05:24:06,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:24:06,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985261530] [2024-11-19 05:24:06,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:24:06,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:24:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:24:07,541 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-19 05:24:07,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:24:07,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985261530] [2024-11-19 05:24:07,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985261530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:24:07,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:24:07,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 05:24:07,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920445366] [2024-11-19 05:24:07,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:24:07,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 05:24:07,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:24:07,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 05:24:07,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 05:24:07,545 INFO L87 Difference]: Start difference. First operand 462 states and 612 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-19 05:24:11,810 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-19 05:24:12,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:24:12,301 INFO L93 Difference]: Finished difference Result 892 states and 1194 transitions. [2024-11-19 05:24:12,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 05:24:12,302 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-19 05:24:12,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:24:12,305 INFO L225 Difference]: With dead ends: 892 [2024-11-19 05:24:12,305 INFO L226 Difference]: Without dead ends: 466 [2024-11-19 05:24:12,306 INFO L431 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-19 05:24:12,307 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 31 mSDsluCounter, 3040 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3539 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-19 05:24:12,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3539 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 603 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2024-11-19 05:24:12,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-19 05:24:12,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 463. [2024-11-19 05:24:12,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 442 states have (on average 1.330316742081448) internal successors, (588), 447 states have internal predecessors, (588), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:24:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 613 transitions. [2024-11-19 05:24:12,328 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 613 transitions. Word has length 72 [2024-11-19 05:24:12,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:24:12,329 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 613 transitions. [2024-11-19 05:24:12,329 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-19 05:24:12,329 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 613 transitions. [2024-11-19 05:24:12,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-19 05:24:12,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:24:12,330 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:24:12,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 05:24:12,330 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-19 05:24:12,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:24:12,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1956145645, now seen corresponding path program 1 times [2024-11-19 05:24:12,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:24:12,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113730677] [2024-11-19 05:24:12,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:24:12,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:24:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:24:12,622 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-19 05:24:12,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:24:12,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113730677] [2024-11-19 05:24:12,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113730677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:24:12,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:24:12,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 05:24:12,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87731276] [2024-11-19 05:24:12,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:24:12,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 05:24:12,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:24:12,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 05:24:12,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 05:24:12,624 INFO L87 Difference]: Start difference. First operand 463 states and 613 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-19 05:24:13,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:24:13,115 INFO L93 Difference]: Finished difference Result 899 states and 1203 transitions. [2024-11-19 05:24:13,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 05:24:13,116 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-19 05:24:13,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:24:13,119 INFO L225 Difference]: With dead ends: 899 [2024-11-19 05:24:13,119 INFO L226 Difference]: Without dead ends: 472 [2024-11-19 05:24:13,120 INFO L431 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-19 05:24:13,121 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 22 mSDsluCounter, 3063 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3569 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-19 05:24:13,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3569 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 05:24:13,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-19 05:24:13,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 460. [2024-11-19 05:24:13,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 439 states have (on average 1.3325740318906605) internal successors, (585), 444 states have internal predecessors, (585), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:24:13,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 610 transitions. [2024-11-19 05:24:13,137 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 610 transitions. Word has length 72 [2024-11-19 05:24:13,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:24:13,137 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 610 transitions. [2024-11-19 05:24:13,137 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-19 05:24:13,137 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 610 transitions. [2024-11-19 05:24:13,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-19 05:24:13,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:24:13,138 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:24:13,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 05:24:13,139 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-19 05:24:13,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:24:13,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1353154441, now seen corresponding path program 1 times [2024-11-19 05:24:13,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:24:13,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18622904] [2024-11-19 05:24:13,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:24:13,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:24:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:24:30,022 WARN L286 SmtUtils]: Spent 6.98s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-19 05:24:34,027 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-19 05:24:34,131 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-19 05:24:34,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:24:34,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18622904] [2024-11-19 05:24:34,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18622904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:24:34,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:24:34,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 05:24:34,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106423492] [2024-11-19 05:24:34,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:24:34,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 05:24:34,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:24:34,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 05:24:34,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2024-11-19 05:24:34,134 INFO L87 Difference]: Start difference. First operand 460 states and 610 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-19 05:24:38,418 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-19 05:24:42,422 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-19 05:24:46,425 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-19 05:24:50,431 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-19 05:24:53,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 05:24:57,899 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-19 05:25:01,910 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-19 05:25:03,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 05:25:07,482 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-19 05:25:11,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []