./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4a058bd9944921e52018f99044f11f694f824f3f09daf510330544b4558ba193 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 11:53:55,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 11:53:56,086 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 11:53:56,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 11:53:56,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 11:53:56,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 11:53:56,128 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 11:53:56,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 11:53:56,129 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 11:53:56,130 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 11:53:56,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 11:53:56,132 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 11:53:56,132 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 11:53:56,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 11:53:56,133 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 11:53:56,134 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 11:53:56,134 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 11:53:56,134 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 11:53:56,134 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 11:53:56,135 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 11:53:56,135 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 11:53:56,136 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 11:53:56,136 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 11:53:56,136 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 11:53:56,136 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 11:53:56,137 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 11:53:56,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 11:53:56,137 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 11:53:56,138 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 11:53:56,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 11:53:56,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 11:53:56,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 11:53:56,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 11:53:56,139 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 11:53:56,140 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 11:53:56,140 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 11:53:56,140 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 11:53:56,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 11:53:56,141 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 11:53:56,141 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 11:53:56,141 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 11:53:56,142 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 11:53:56,142 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 -> 4a058bd9944921e52018f99044f11f694f824f3f09daf510330544b4558ba193 [2024-11-12 11:53:56,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 11:53:56,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 11:53:56,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 11:53:56,450 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 11:53:56,451 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 11:53:56,452 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i [2024-11-12 11:53:57,995 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 11:53:58,330 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 11:53:58,331 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i [2024-11-12 11:53:58,358 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23d04b84f/381c705a3f384e91a7c3eb5ac955ab7c/FLAG3d1fa2ce0 [2024-11-12 11:53:58,371 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23d04b84f/381c705a3f384e91a7c3eb5ac955ab7c [2024-11-12 11:53:58,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 11:53:58,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 11:53:58,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 11:53:58,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 11:53:58,382 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 11:53:58,383 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 11:53:58" (1/1) ... [2024-11-12 11:53:58,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74fbb505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:53:58, skipping insertion in model container [2024-11-12 11:53:58,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 11:53:58" (1/1) ... [2024-11-12 11:53:58,443 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 11:53:59,104 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_JEN_test6-2.i[44118,44131] [2024-11-12 11:53:59,119 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_JEN_test6-2.i[44660,44673] [2024-11-12 11:53:59,237 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_JEN_test6-2.i[56247,56260] [2024-11-12 11:53:59,238 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_JEN_test6-2.i[56368,56381] [2024-11-12 11:53:59,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 11:53:59,284 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 11:53:59,329 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_JEN_test6-2.i[44118,44131] [2024-11-12 11:53:59,332 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_JEN_test6-2.i[44660,44673] [2024-11-12 11:53:59,407 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_JEN_test6-2.i[56247,56260] [2024-11-12 11:53:59,408 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_JEN_test6-2.i[56368,56381] [2024-11-12 11:53:59,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 11:53:59,602 INFO L204 MainTranslator]: Completed translation [2024-11-12 11:53:59,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:53:59 WrapperNode [2024-11-12 11:53:59,603 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 11:53:59,604 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 11:53:59,604 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 11:53:59,604 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 11:53:59,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:53:59" (1/1) ... [2024-11-12 11:53:59,658 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:53:59" (1/1) ... [2024-11-12 11:53:59,735 INFO L138 Inliner]: procedures = 282, calls = 349, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1647 [2024-11-12 11:53:59,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 11:53:59,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 11:53:59,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 11:53:59,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 11:53:59,748 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:53:59" (1/1) ... [2024-11-12 11:53:59,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:53:59" (1/1) ... [2024-11-12 11:53:59,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:53:59" (1/1) ... [2024-11-12 11:53:59,911 INFO L175 MemorySlicer]: Split 318 memory accesses to 4 slices as follows [2, 12, 270, 34]. 85 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 62 writes are split as follows [0, 1, 57, 4]. [2024-11-12 11:53:59,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:53:59" (1/1) ... [2024-11-12 11:53:59,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:53:59" (1/1) ... [2024-11-12 11:53:59,971 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:53:59" (1/1) ... [2024-11-12 11:53:59,984 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:53:59" (1/1) ... [2024-11-12 11:54:00,000 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:53:59" (1/1) ... [2024-11-12 11:54:00,015 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:53:59" (1/1) ... [2024-11-12 11:54:00,039 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 11:54:00,041 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 11:54:00,041 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 11:54:00,041 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 11:54:00,042 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:53:59" (1/1) ... [2024-11-12 11:54:00,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 11:54:00,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 11:54:00,090 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 11:54:00,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 11:54:00,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 11:54:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 11:54:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 11:54:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 11:54:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-12 11:54:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 11:54:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-12 11:54:00,151 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-12 11:54:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 11:54:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 11:54:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 11:54:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-12 11:54:00,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 11:54:00,153 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 11:54:00,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 11:54:00,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 11:54:00,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 11:54:00,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-12 11:54:00,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 11:54:00,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 11:54:00,155 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-12 11:54:00,155 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-12 11:54:00,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 11:54:00,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 11:54:00,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 11:54:00,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-12 11:54:00,156 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-12 11:54:00,157 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-12 11:54:00,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 11:54:00,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 11:54:00,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 11:54:00,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-12 11:54:00,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 11:54:00,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 11:54:00,444 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 11:54:00,446 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 11:54:02,036 INFO L? ?]: Removed 364 outVars from TransFormulas that were not future-live. [2024-11-12 11:54:02,037 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 11:54:02,071 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 11:54:02,073 INFO L316 CfgBuilder]: Removed 72 assume(true) statements. [2024-11-12 11:54:02,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 11:54:02 BoogieIcfgContainer [2024-11-12 11:54:02,074 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 11:54:02,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 11:54:02,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 11:54:02,081 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 11:54:02,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 11:53:58" (1/3) ... [2024-11-12 11:54:02,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de702ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 11:54:02, skipping insertion in model container [2024-11-12 11:54:02,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:53:59" (2/3) ... [2024-11-12 11:54:02,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de702ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 11:54:02, skipping insertion in model container [2024-11-12 11:54:02,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 11:54:02" (3/3) ... [2024-11-12 11:54:02,084 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test6-2.i [2024-11-12 11:54:02,101 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 11:54:02,101 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-12 11:54:02,176 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 11:54:02,183 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;@4be1f9f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 11:54:02,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-12 11:54:02,191 INFO L276 IsEmpty]: Start isEmpty. Operand has 474 states, 450 states have (on average 1.5977777777777777) internal successors, (719), 454 states have internal predecessors, (719), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 11:54:02,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 11:54:02,199 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:54:02,200 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:54:02,200 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:54:02,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:54:02,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1705359720, now seen corresponding path program 1 times [2024-11-12 11:54:02,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:54:02,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937403532] [2024-11-12 11:54:02,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:54:02,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:54:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:54:02,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:54:02,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:54:02,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937403532] [2024-11-12 11:54:02,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937403532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:54:02,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:54:02,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 11:54:02,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38544429] [2024-11-12 11:54:02,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:54:02,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 11:54:02,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:54:02,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 11:54:02,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 11:54:02,494 INFO L87 Difference]: Start difference. First operand has 474 states, 450 states have (on average 1.5977777777777777) internal successors, (719), 454 states have internal predecessors, (719), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:02,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:54:02,559 INFO L93 Difference]: Finished difference Result 943 states and 1508 transitions. [2024-11-12 11:54:02,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 11:54:02,562 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-12 11:54:02,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:54:02,574 INFO L225 Difference]: With dead ends: 943 [2024-11-12 11:54:02,574 INFO L226 Difference]: Without dead ends: 467 [2024-11-12 11:54:02,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 11:54:02,583 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 11:54:02,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 11:54:02,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-11-12 11:54:02,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2024-11-12 11:54:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 444 states have (on average 1.4256756756756757) internal successors, (633), 448 states have internal predecessors, (633), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:54:02,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 663 transitions. [2024-11-12 11:54:02,658 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 663 transitions. Word has length 8 [2024-11-12 11:54:02,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:54:02,659 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 663 transitions. [2024-11-12 11:54:02,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:02,659 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 663 transitions. [2024-11-12 11:54:02,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-12 11:54:02,660 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:54:02,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:54:02,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 11:54:02,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:54:02,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:54:02,661 INFO L85 PathProgramCache]: Analyzing trace with hash -68909494, now seen corresponding path program 1 times [2024-11-12 11:54:02,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:54:02,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695573920] [2024-11-12 11:54:02,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:54:02,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:54:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:54:02,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:54:02,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:54:02,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695573920] [2024-11-12 11:54:02,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695573920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:54:02,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:54:02,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 11:54:02,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282111969] [2024-11-12 11:54:02,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:54:02,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 11:54:02,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:54:02,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 11:54:02,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 11:54:02,886 INFO L87 Difference]: Start difference. First operand 467 states and 663 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:03,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:54:03,131 INFO L93 Difference]: Finished difference Result 1158 states and 1654 transitions. [2024-11-12 11:54:03,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 11:54:03,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-12 11:54:03,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:54:03,138 INFO L225 Difference]: With dead ends: 1158 [2024-11-12 11:54:03,138 INFO L226 Difference]: Without dead ends: 907 [2024-11-12 11:54:03,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 11:54:03,140 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 606 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 11:54:03,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 2113 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 11:54:03,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2024-11-12 11:54:03,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 469. [2024-11-12 11:54:03,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 446 states have (on average 1.4237668161434978) internal successors, (635), 450 states have internal predecessors, (635), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:54:03,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 665 transitions. [2024-11-12 11:54:03,190 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 665 transitions. Word has length 10 [2024-11-12 11:54:03,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:54:03,191 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 665 transitions. [2024-11-12 11:54:03,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:03,191 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 665 transitions. [2024-11-12 11:54:03,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 11:54:03,195 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:54:03,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:54:03,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 11:54:03,196 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:54:03,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:54:03,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2094545925, now seen corresponding path program 1 times [2024-11-12 11:54:03,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:54:03,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929018825] [2024-11-12 11:54:03,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:54:03,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:54:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:54:03,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:54:03,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:54:03,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929018825] [2024-11-12 11:54:03,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929018825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:54:03,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:54:03,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 11:54:03,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558268660] [2024-11-12 11:54:03,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:54:03,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 11:54:03,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:54:03,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 11:54:03,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 11:54:03,587 INFO L87 Difference]: Start difference. First operand 469 states and 665 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:03,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:54:03,692 INFO L93 Difference]: Finished difference Result 892 states and 1260 transitions. [2024-11-12 11:54:03,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 11:54:03,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-12 11:54:03,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:54:03,697 INFO L225 Difference]: With dead ends: 892 [2024-11-12 11:54:03,697 INFO L226 Difference]: Without dead ends: 427 [2024-11-12 11:54:03,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 11:54:03,702 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 36 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 11:54:03,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1660 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 11:54:03,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-12 11:54:03,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2024-11-12 11:54:03,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 404 states have (on average 1.381188118811881) internal successors, (558), 408 states have internal predecessors, (558), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:54:03,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 588 transitions. [2024-11-12 11:54:03,722 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 588 transitions. Word has length 66 [2024-11-12 11:54:03,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:54:03,723 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 588 transitions. [2024-11-12 11:54:03,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:03,723 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 588 transitions. [2024-11-12 11:54:03,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 11:54:03,725 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:54:03,725 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:54:03,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 11:54:03,726 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:54:03,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:54:03,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1762783129, now seen corresponding path program 1 times [2024-11-12 11:54:03,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:54:03,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361977939] [2024-11-12 11:54:03,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:54:03,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:54:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:54:03,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:54:03,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:54:03,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361977939] [2024-11-12 11:54:03,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361977939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:54:03,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:54:03,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 11:54:03,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988755134] [2024-11-12 11:54:03,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:54:03,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 11:54:03,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:54:03,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 11:54:03,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 11:54:03,913 INFO L87 Difference]: Start difference. First operand 427 states and 588 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:03,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:54:03,979 INFO L93 Difference]: Finished difference Result 844 states and 1166 transitions. [2024-11-12 11:54:03,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 11:54:03,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-12 11:54:03,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:54:03,983 INFO L225 Difference]: With dead ends: 844 [2024-11-12 11:54:03,983 INFO L226 Difference]: Without dead ends: 421 [2024-11-12 11:54:03,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 11:54:03,988 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 9 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 11:54:03,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1661 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 11:54:03,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-12 11:54:04,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2024-11-12 11:54:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 398 states have (on average 1.3768844221105527) internal successors, (548), 402 states have internal predecessors, (548), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:54:04,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 578 transitions. [2024-11-12 11:54:04,033 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 578 transitions. Word has length 66 [2024-11-12 11:54:04,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:54:04,034 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 578 transitions. [2024-11-12 11:54:04,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:04,034 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 578 transitions. [2024-11-12 11:54:04,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 11:54:04,038 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:54:04,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:54:04,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 11:54:04,039 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:54:04,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:54:04,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1018233745, now seen corresponding path program 1 times [2024-11-12 11:54:04,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:54:04,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993996693] [2024-11-12 11:54:04,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:54:04,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:54:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:54:04,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:54:04,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:54:04,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993996693] [2024-11-12 11:54:04,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993996693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:54:04,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:54:04,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 11:54:04,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547163756] [2024-11-12 11:54:04,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:54:04,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 11:54:04,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:54:04,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 11:54:04,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 11:54:04,459 INFO L87 Difference]: Start difference. First operand 421 states and 578 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:04,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:54:04,831 INFO L93 Difference]: Finished difference Result 843 states and 1160 transitions. [2024-11-12 11:54:04,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 11:54:04,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-12 11:54:04,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:54:04,835 INFO L225 Difference]: With dead ends: 843 [2024-11-12 11:54:04,835 INFO L226 Difference]: Without dead ends: 426 [2024-11-12 11:54:04,836 INFO L434 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-12 11:54:04,837 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 10 mSDsluCounter, 1951 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2512 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 11:54:04,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2512 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 11:54:04,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-12 11:54:04,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 423. [2024-11-12 11:54:04,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 400 states have (on average 1.375) internal successors, (550), 404 states have internal predecessors, (550), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:54:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 580 transitions. [2024-11-12 11:54:04,877 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 580 transitions. Word has length 66 [2024-11-12 11:54:04,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:54:04,878 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 580 transitions. [2024-11-12 11:54:04,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:04,879 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 580 transitions. [2024-11-12 11:54:04,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-12 11:54:04,880 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:54:04,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:54:04,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 11:54:04,881 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:54:04,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:54:04,882 INFO L85 PathProgramCache]: Analyzing trace with hash -2097980756, now seen corresponding path program 1 times [2024-11-12 11:54:04,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:54:04,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865065211] [2024-11-12 11:54:04,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:54:04,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:54:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:54:05,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:54:05,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:54:05,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865065211] [2024-11-12 11:54:05,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865065211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:54:05,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:54:05,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 11:54:05,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799726872] [2024-11-12 11:54:05,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:54:05,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 11:54:05,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:54:05,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 11:54:05,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 11:54:05,280 INFO L87 Difference]: Start difference. First operand 423 states and 580 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:05,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:54:05,418 INFO L93 Difference]: Finished difference Result 842 states and 1156 transitions. [2024-11-12 11:54:05,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 11:54:05,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-12 11:54:05,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:54:05,423 INFO L225 Difference]: With dead ends: 842 [2024-11-12 11:54:05,423 INFO L226 Difference]: Without dead ends: 423 [2024-11-12 11:54:05,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 11:54:05,427 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 13 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 11:54:05,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1573 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 11:54:05,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-12 11:54:05,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2024-11-12 11:54:05,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 400 states have (on average 1.3725) internal successors, (549), 404 states have internal predecessors, (549), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:54:05,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 579 transitions. [2024-11-12 11:54:05,444 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 579 transitions. Word has length 67 [2024-11-12 11:54:05,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:54:05,445 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 579 transitions. [2024-11-12 11:54:05,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:05,446 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 579 transitions. [2024-11-12 11:54:05,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-12 11:54:05,447 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:54:05,447 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:54:05,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 11:54:05,448 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:54:05,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:54:05,448 INFO L85 PathProgramCache]: Analyzing trace with hash 362380824, now seen corresponding path program 1 times [2024-11-12 11:54:05,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:54:05,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143064272] [2024-11-12 11:54:05,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:54:05,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:54:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:54:05,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:54:05,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:54:05,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143064272] [2024-11-12 11:54:05,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143064272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:54:05,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:54:05,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 11:54:05,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374343275] [2024-11-12 11:54:05,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:54:05,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 11:54:05,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:54:05,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 11:54:05,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 11:54:05,735 INFO L87 Difference]: Start difference. First operand 423 states and 579 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:06,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:54:06,079 INFO L93 Difference]: Finished difference Result 847 states and 1162 transitions. [2024-11-12 11:54:06,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 11:54:06,080 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-12 11:54:06,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:54:06,082 INFO L225 Difference]: With dead ends: 847 [2024-11-12 11:54:06,082 INFO L226 Difference]: Without dead ends: 428 [2024-11-12 11:54:06,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 11:54:06,084 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 10 mSDsluCounter, 2459 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 3014 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 11:54:06,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 3014 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 11:54:06,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-12 11:54:06,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 427. [2024-11-12 11:54:06,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 404 states have (on average 1.3712871287128714) internal successors, (554), 408 states have internal predecessors, (554), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:54:06,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 584 transitions. [2024-11-12 11:54:06,097 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 584 transitions. Word has length 67 [2024-11-12 11:54:06,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:54:06,097 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 584 transitions. [2024-11-12 11:54:06,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:06,098 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 584 transitions. [2024-11-12 11:54:06,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-12 11:54:06,099 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:54:06,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:54:06,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 11:54:06,099 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:54:06,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:54:06,100 INFO L85 PathProgramCache]: Analyzing trace with hash 543599956, now seen corresponding path program 1 times [2024-11-12 11:54:06,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:54:06,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647149553] [2024-11-12 11:54:06,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:54:06,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:54:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:54:06,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:54:06,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:54:06,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647149553] [2024-11-12 11:54:06,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647149553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:54:06,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:54:06,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 11:54:06,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032733419] [2024-11-12 11:54:06,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:54:06,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 11:54:06,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:54:06,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 11:54:06,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 11:54:06,373 INFO L87 Difference]: Start difference. First operand 427 states and 584 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:06,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:54:06,597 INFO L93 Difference]: Finished difference Result 853 states and 1169 transitions. [2024-11-12 11:54:06,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 11:54:06,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-12 11:54:06,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:54:06,601 INFO L225 Difference]: With dead ends: 853 [2024-11-12 11:54:06,602 INFO L226 Difference]: Without dead ends: 430 [2024-11-12 11:54:06,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 11:54:06,604 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 4 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2061 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 11:54:06,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2061 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 11:54:06,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-12 11:54:06,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2024-11-12 11:54:06,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 407 states have (on average 1.3685503685503686) internal successors, (557), 411 states have internal predecessors, (557), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:54:06,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 587 transitions. [2024-11-12 11:54:06,618 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 587 transitions. Word has length 68 [2024-11-12 11:54:06,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:54:06,619 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 587 transitions. [2024-11-12 11:54:06,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:06,620 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 587 transitions. [2024-11-12 11:54:06,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-12 11:54:06,622 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:54:06,622 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:54:06,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 11:54:06,623 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:54:06,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:54:06,623 INFO L85 PathProgramCache]: Analyzing trace with hash 2064596987, now seen corresponding path program 1 times [2024-11-12 11:54:06,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:54:06,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211714005] [2024-11-12 11:54:06,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:54:06,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:54:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:54:07,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:54:07,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:54:07,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211714005] [2024-11-12 11:54:07,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211714005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:54:07,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:54:07,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 11:54:07,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651219288] [2024-11-12 11:54:07,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:54:07,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 11:54:07,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:54:07,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 11:54:07,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 11:54:07,056 INFO L87 Difference]: Start difference. First operand 430 states and 587 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:07,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:54:07,556 INFO L93 Difference]: Finished difference Result 869 states and 1191 transitions. [2024-11-12 11:54:07,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 11:54:07,557 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-12 11:54:07,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:54:07,560 INFO L225 Difference]: With dead ends: 869 [2024-11-12 11:54:07,560 INFO L226 Difference]: Without dead ends: 443 [2024-11-12 11:54:07,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-12 11:54:07,562 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 30 mSDsluCounter, 3509 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 4065 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 11:54:07,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 4065 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 11:54:07,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-12 11:54:07,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 440. [2024-11-12 11:54:07,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 417 states have (on average 1.369304556354916) internal successors, (571), 421 states have internal predecessors, (571), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:54:07,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 601 transitions. [2024-11-12 11:54:07,575 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 601 transitions. Word has length 68 [2024-11-12 11:54:07,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:54:07,576 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 601 transitions. [2024-11-12 11:54:07,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:07,576 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 601 transitions. [2024-11-12 11:54:07,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-12 11:54:07,577 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:54:07,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:54:07,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 11:54:07,578 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:54:07,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:54:07,578 INFO L85 PathProgramCache]: Analyzing trace with hash -617699308, now seen corresponding path program 1 times [2024-11-12 11:54:07,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:54:07,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432275118] [2024-11-12 11:54:07,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:54:07,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:54:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:54:08,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:54:08,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:54:08,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432275118] [2024-11-12 11:54:08,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432275118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:54:08,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:54:08,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 11:54:08,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055268249] [2024-11-12 11:54:08,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:54:08,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 11:54:08,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:54:08,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 11:54:08,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 11:54:08,022 INFO L87 Difference]: Start difference. First operand 440 states and 601 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:08,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:54:08,372 INFO L93 Difference]: Finished difference Result 879 states and 1203 transitions. [2024-11-12 11:54:08,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 11:54:08,373 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-12 11:54:08,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:54:08,375 INFO L225 Difference]: With dead ends: 879 [2024-11-12 11:54:08,376 INFO L226 Difference]: Without dead ends: 443 [2024-11-12 11:54:08,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-12 11:54:08,377 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 23 mSDsluCounter, 2508 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3068 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 11:54:08,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3068 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 11:54:08,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-12 11:54:08,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2024-11-12 11:54:08,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 420 states have (on average 1.3666666666666667) internal successors, (574), 424 states have internal predecessors, (574), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:54:08,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 604 transitions. [2024-11-12 11:54:08,391 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 604 transitions. Word has length 68 [2024-11-12 11:54:08,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:54:08,392 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 604 transitions. [2024-11-12 11:54:08,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:08,392 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 604 transitions. [2024-11-12 11:54:08,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-12 11:54:08,393 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:54:08,393 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:54:08,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 11:54:08,393 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:54:08,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:54:08,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1880623215, now seen corresponding path program 1 times [2024-11-12 11:54:08,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:54:08,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917112908] [2024-11-12 11:54:08,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:54:08,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:54:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:54:08,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:54:08,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:54:08,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917112908] [2024-11-12 11:54:08,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917112908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:54:08,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:54:08,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 11:54:08,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43866231] [2024-11-12 11:54:08,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:54:08,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 11:54:08,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:54:08,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 11:54:08,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 11:54:08,658 INFO L87 Difference]: Start difference. First operand 443 states and 604 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:09,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:54:09,015 INFO L93 Difference]: Finished difference Result 887 states and 1212 transitions. [2024-11-12 11:54:09,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 11:54:09,016 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-12 11:54:09,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:54:09,019 INFO L225 Difference]: With dead ends: 887 [2024-11-12 11:54:09,019 INFO L226 Difference]: Without dead ends: 448 [2024-11-12 11:54:09,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 11:54:09,021 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 9 mSDsluCounter, 2459 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3020 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 11:54:09,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3020 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 11:54:09,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-12 11:54:09,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 443. [2024-11-12 11:54:09,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 420 states have (on average 1.3666666666666667) internal successors, (574), 424 states have internal predecessors, (574), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:54:09,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 604 transitions. [2024-11-12 11:54:09,036 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 604 transitions. Word has length 69 [2024-11-12 11:54:09,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:54:09,036 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 604 transitions. [2024-11-12 11:54:09,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:09,036 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 604 transitions. [2024-11-12 11:54:09,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-12 11:54:09,037 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:54:09,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:54:09,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 11:54:09,038 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:54:09,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:54:09,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1143892763, now seen corresponding path program 1 times [2024-11-12 11:54:09,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:54:09,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109388304] [2024-11-12 11:54:09,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:54:09,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:54:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:54:09,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:54:09,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:54:09,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109388304] [2024-11-12 11:54:09,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109388304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:54:09,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:54:09,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 11:54:09,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233641882] [2024-11-12 11:54:09,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:54:09,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 11:54:09,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:54:09,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 11:54:09,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-12 11:54:09,691 INFO L87 Difference]: Start difference. First operand 443 states and 604 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:10,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:54:10,842 INFO L93 Difference]: Finished difference Result 1279 states and 1758 transitions. [2024-11-12 11:54:10,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 11:54:10,842 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-12 11:54:10,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:54:10,846 INFO L225 Difference]: With dead ends: 1279 [2024-11-12 11:54:10,846 INFO L226 Difference]: Without dead ends: 840 [2024-11-12 11:54:10,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-12 11:54:10,848 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 649 mSDsluCounter, 3704 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 4347 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 11:54:10,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 4347 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-12 11:54:10,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-11-12 11:54:10,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 475. [2024-11-12 11:54:10,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 452 states have (on average 1.3407079646017699) internal successors, (606), 456 states have internal predecessors, (606), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:54:10,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 636 transitions. [2024-11-12 11:54:10,866 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 636 transitions. Word has length 69 [2024-11-12 11:54:10,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:54:10,866 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 636 transitions. [2024-11-12 11:54:10,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:10,867 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 636 transitions. [2024-11-12 11:54:10,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-12 11:54:10,867 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:54:10,868 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:54:10,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 11:54:10,868 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:54:10,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:54:10,869 INFO L85 PathProgramCache]: Analyzing trace with hash -251769952, now seen corresponding path program 1 times [2024-11-12 11:54:10,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:54:10,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562333461] [2024-11-12 11:54:10,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:54:10,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:54:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:54:11,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:54:11,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:54:11,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562333461] [2024-11-12 11:54:11,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562333461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:54:11,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:54:11,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 11:54:11,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513363234] [2024-11-12 11:54:11,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:54:11,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 11:54:11,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:54:11,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 11:54:11,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-12 11:54:11,173 INFO L87 Difference]: Start difference. First operand 475 states and 636 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:11,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:54:11,450 INFO L93 Difference]: Finished difference Result 924 states and 1250 transitions. [2024-11-12 11:54:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 11:54:11,451 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-12 11:54:11,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:54:11,454 INFO L225 Difference]: With dead ends: 924 [2024-11-12 11:54:11,454 INFO L226 Difference]: Without dead ends: 485 [2024-11-12 11:54:11,455 INFO L434 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-12 11:54:11,456 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 16 mSDsluCounter, 2554 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3109 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 11:54:11,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3109 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 11:54:11,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-11-12 11:54:11,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 478. [2024-11-12 11:54:11,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 455 states have (on average 1.3406593406593406) internal successors, (610), 459 states have internal predecessors, (610), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:54:11,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 640 transitions. [2024-11-12 11:54:11,470 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 640 transitions. Word has length 70 [2024-11-12 11:54:11,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:54:11,470 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 640 transitions. [2024-11-12 11:54:11,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:11,471 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 640 transitions. [2024-11-12 11:54:11,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-12 11:54:11,471 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:54:11,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:54:11,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 11:54:11,472 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:54:11,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:54:11,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1885470852, now seen corresponding path program 1 times [2024-11-12 11:54:11,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:54:11,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372504461] [2024-11-12 11:54:11,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:54:11,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:54:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:54:11,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:54:11,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:54:11,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372504461] [2024-11-12 11:54:11,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372504461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:54:11,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:54:11,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 11:54:11,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979214317] [2024-11-12 11:54:11,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:54:11,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 11:54:11,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:54:11,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 11:54:11,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 11:54:11,781 INFO L87 Difference]: Start difference. First operand 478 states and 640 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:12,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:54:12,264 INFO L93 Difference]: Finished difference Result 930 states and 1258 transitions. [2024-11-12 11:54:12,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 11:54:12,264 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-12 11:54:12,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:54:12,268 INFO L225 Difference]: With dead ends: 930 [2024-11-12 11:54:12,269 INFO L226 Difference]: Without dead ends: 488 [2024-11-12 11:54:12,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-12 11:54:12,270 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 26 mSDsluCounter, 3441 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 4001 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 11:54:12,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 4001 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 11:54:12,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-11-12 11:54:12,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 478. [2024-11-12 11:54:12,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 455 states have (on average 1.3406593406593406) internal successors, (610), 459 states have internal predecessors, (610), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:54:12,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 640 transitions. [2024-11-12 11:54:12,291 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 640 transitions. Word has length 70 [2024-11-12 11:54:12,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:54:12,291 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 640 transitions. [2024-11-12 11:54:12,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:12,292 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 640 transitions. [2024-11-12 11:54:12,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-12 11:54:12,292 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:54:12,292 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:54:12,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 11:54:12,293 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:54:12,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:54:12,293 INFO L85 PathProgramCache]: Analyzing trace with hash 100457695, now seen corresponding path program 1 times [2024-11-12 11:54:12,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:54:12,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916635725] [2024-11-12 11:54:12,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:54:12,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:54:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:54:12,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:54:12,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:54:12,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916635725] [2024-11-12 11:54:12,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916635725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:54:12,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:54:12,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 11:54:12,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172991434] [2024-11-12 11:54:12,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:54:12,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 11:54:12,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:54:12,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 11:54:12,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-12 11:54:12,647 INFO L87 Difference]: Start difference. First operand 478 states and 640 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:13,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:54:13,098 INFO L93 Difference]: Finished difference Result 936 states and 1267 transitions. [2024-11-12 11:54:13,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 11:54:13,098 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-12 11:54:13,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:54:13,101 INFO L225 Difference]: With dead ends: 936 [2024-11-12 11:54:13,102 INFO L226 Difference]: Without dead ends: 494 [2024-11-12 11:54:13,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-12 11:54:13,103 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 22 mSDsluCounter, 3494 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 4056 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 11:54:13,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 4056 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 11:54:13,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-11-12 11:54:13,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 488. [2024-11-12 11:54:13,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 465 states have (on average 1.3376344086021505) internal successors, (622), 469 states have internal predecessors, (622), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:54:13,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 652 transitions. [2024-11-12 11:54:13,121 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 652 transitions. Word has length 71 [2024-11-12 11:54:13,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:54:13,121 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 652 transitions. [2024-11-12 11:54:13,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:13,122 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 652 transitions. [2024-11-12 11:54:13,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-12 11:54:13,122 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:54:13,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:54:13,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 11:54:13,123 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:54:13,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:54:13,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1930413179, now seen corresponding path program 1 times [2024-11-12 11:54:13,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:54:13,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234713323] [2024-11-12 11:54:13,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:54:13,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:54:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:54:13,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:54:13,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:54:13,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234713323] [2024-11-12 11:54:13,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234713323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:54:13,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:54:13,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 11:54:13,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298304256] [2024-11-12 11:54:13,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:54:13,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 11:54:13,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:54:13,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 11:54:13,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 11:54:13,488 INFO L87 Difference]: Start difference. First operand 488 states and 652 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:13,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:54:13,980 INFO L93 Difference]: Finished difference Result 956 states and 1291 transitions. [2024-11-12 11:54:13,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 11:54:13,981 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-12 11:54:13,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:54:13,985 INFO L225 Difference]: With dead ends: 956 [2024-11-12 11:54:13,986 INFO L226 Difference]: Without dead ends: 504 [2024-11-12 11:54:13,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 11:54:13,988 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 13 mSDsluCounter, 3984 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4532 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 11:54:13,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4532 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 11:54:13,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-11-12 11:54:14,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 491. [2024-11-12 11:54:14,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 468 states have (on average 1.3376068376068375) internal successors, (626), 472 states have internal predecessors, (626), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:54:14,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 656 transitions. [2024-11-12 11:54:14,012 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 656 transitions. Word has length 71 [2024-11-12 11:54:14,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:54:14,013 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 656 transitions. [2024-11-12 11:54:14,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:14,013 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 656 transitions. [2024-11-12 11:54:14,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-12 11:54:14,015 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:54:14,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:54:14,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 11:54:14,016 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:54:14,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:54:14,016 INFO L85 PathProgramCache]: Analyzing trace with hash 432360443, now seen corresponding path program 1 times [2024-11-12 11:54:14,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:54:14,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418979174] [2024-11-12 11:54:14,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:54:14,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:54:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:54:14,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:54:14,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:54:14,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418979174] [2024-11-12 11:54:14,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418979174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:54:14,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:54:14,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 11:54:14,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110486381] [2024-11-12 11:54:14,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:54:14,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 11:54:14,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:54:14,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 11:54:14,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 11:54:14,352 INFO L87 Difference]: Start difference. First operand 491 states and 656 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:14,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:54:14,670 INFO L93 Difference]: Finished difference Result 951 states and 1281 transitions. [2024-11-12 11:54:14,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 11:54:14,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-12 11:54:14,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:54:14,674 INFO L225 Difference]: With dead ends: 951 [2024-11-12 11:54:14,674 INFO L226 Difference]: Without dead ends: 496 [2024-11-12 11:54:14,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 11:54:14,676 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 7 mSDsluCounter, 2488 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3044 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 11:54:14,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3044 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 11:54:14,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-11-12 11:54:14,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 491. [2024-11-12 11:54:14,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 468 states have (on average 1.3354700854700854) internal successors, (625), 472 states have internal predecessors, (625), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:54:14,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 655 transitions. [2024-11-12 11:54:14,696 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 655 transitions. Word has length 71 [2024-11-12 11:54:14,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:54:14,696 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 655 transitions. [2024-11-12 11:54:14,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:14,697 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 655 transitions. [2024-11-12 11:54:14,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-12 11:54:14,698 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:54:14,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:54:14,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 11:54:14,698 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:54:14,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:54:14,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2045031444, now seen corresponding path program 1 times [2024-11-12 11:54:14,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:54:14,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617314916] [2024-11-12 11:54:14,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:54:14,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:54:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:54:15,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:54:15,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:54:15,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617314916] [2024-11-12 11:54:15,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617314916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:54:15,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:54:15,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 11:54:15,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497450722] [2024-11-12 11:54:15,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:54:15,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 11:54:15,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:54:15,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 11:54:15,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 11:54:15,056 INFO L87 Difference]: Start difference. First operand 491 states and 655 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:54:15,423 INFO L93 Difference]: Finished difference Result 949 states and 1279 transitions. [2024-11-12 11:54:15,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 11:54:15,424 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-12 11:54:15,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:54:15,429 INFO L225 Difference]: With dead ends: 949 [2024-11-12 11:54:15,429 INFO L226 Difference]: Without dead ends: 494 [2024-11-12 11:54:15,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 11:54:15,431 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 4 mSDsluCounter, 2443 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3003 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 11:54:15,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3003 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 11:54:15,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-11-12 11:54:15,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2024-11-12 11:54:15,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 471 states have (on average 1.3333333333333333) internal successors, (628), 475 states have internal predecessors, (628), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:54:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 658 transitions. [2024-11-12 11:54:15,453 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 658 transitions. Word has length 71 [2024-11-12 11:54:15,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:54:15,454 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 658 transitions. [2024-11-12 11:54:15,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:15,454 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 658 transitions. [2024-11-12 11:54:15,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-12 11:54:15,455 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:54:15,455 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:54:15,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 11:54:15,455 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:54:15,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:54:15,456 INFO L85 PathProgramCache]: Analyzing trace with hash -665390877, now seen corresponding path program 1 times [2024-11-12 11:54:15,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:54:15,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342497388] [2024-11-12 11:54:15,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:54:15,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:54:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:54:15,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:54:15,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:54:15,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342497388] [2024-11-12 11:54:15,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342497388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:54:15,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:54:15,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 11:54:15,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537869773] [2024-11-12 11:54:15,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:54:15,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 11:54:15,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:54:15,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 11:54:15,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-12 11:54:15,935 INFO L87 Difference]: Start difference. First operand 494 states and 658 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:16,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:54:16,608 INFO L93 Difference]: Finished difference Result 964 states and 1298 transitions. [2024-11-12 11:54:16,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 11:54:16,609 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-12 11:54:16,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:54:16,612 INFO L225 Difference]: With dead ends: 964 [2024-11-12 11:54:16,613 INFO L226 Difference]: Without dead ends: 506 [2024-11-12 11:54:16,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-12 11:54:16,615 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 9 mSDsluCounter, 3483 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4042 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 11:54:16,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4042 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 11:54:16,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-12 11:54:16,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 498. [2024-11-12 11:54:16,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 475 states have (on average 1.3326315789473684) internal successors, (633), 479 states have internal predecessors, (633), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:54:16,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 663 transitions. [2024-11-12 11:54:16,658 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 663 transitions. Word has length 72 [2024-11-12 11:54:16,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:54:16,658 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 663 transitions. [2024-11-12 11:54:16,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:16,659 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 663 transitions. [2024-11-12 11:54:16,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-12 11:54:16,659 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:54:16,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:54:16,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 11:54:16,660 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:54:16,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:54:16,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1263182800, now seen corresponding path program 1 times [2024-11-12 11:54:16,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:54:16,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556326044] [2024-11-12 11:54:16,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:54:16,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:54:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:54:17,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:54:17,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:54:17,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556326044] [2024-11-12 11:54:17,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556326044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:54:17,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:54:17,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 11:54:17,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234435766] [2024-11-12 11:54:17,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:54:17,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 11:54:17,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:54:17,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 11:54:17,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-12 11:54:17,036 INFO L87 Difference]: Start difference. First operand 498 states and 663 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:17,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:54:17,586 INFO L93 Difference]: Finished difference Result 973 states and 1308 transitions. [2024-11-12 11:54:17,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 11:54:17,586 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-12 11:54:17,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:54:17,589 INFO L225 Difference]: With dead ends: 973 [2024-11-12 11:54:17,589 INFO L226 Difference]: Without dead ends: 511 [2024-11-12 11:54:17,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-12 11:54:17,592 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 22 mSDsluCounter, 4526 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 5082 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 11:54:17,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 5082 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 11:54:17,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-12 11:54:17,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 501. [2024-11-12 11:54:17,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 478 states have (on average 1.3305439330543933) internal successors, (636), 482 states have internal predecessors, (636), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:54:17,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 666 transitions. [2024-11-12 11:54:17,614 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 666 transitions. Word has length 72 [2024-11-12 11:54:17,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:54:17,614 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 666 transitions. [2024-11-12 11:54:17,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:17,614 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 666 transitions. [2024-11-12 11:54:17,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-12 11:54:17,615 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:54:17,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:54:17,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 11:54:17,616 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:54:17,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:54:17,617 INFO L85 PathProgramCache]: Analyzing trace with hash 228654279, now seen corresponding path program 1 times [2024-11-12 11:54:17,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:54:17,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60578746] [2024-11-12 11:54:17,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:54:17,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:54:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:54:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:54:18,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:54:18,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60578746] [2024-11-12 11:54:18,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60578746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:54:18,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:54:18,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 11:54:18,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146380168] [2024-11-12 11:54:18,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:54:18,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 11:54:18,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:54:18,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 11:54:18,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-12 11:54:18,176 INFO L87 Difference]: Start difference. First operand 501 states and 666 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:22,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 11:54:23,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:54:23,017 INFO L93 Difference]: Finished difference Result 970 states and 1302 transitions. [2024-11-12 11:54:23,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 11:54:23,018 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-12 11:54:23,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:54:23,022 INFO L225 Difference]: With dead ends: 970 [2024-11-12 11:54:23,022 INFO L226 Difference]: Without dead ends: 505 [2024-11-12 11:54:23,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-12 11:54:23,024 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 31 mSDsluCounter, 3418 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3971 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.7s IncrementalHoareTripleChecker+Time [2024-11-12 11:54:23,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3971 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 603 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2024-11-12 11:54:23,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-11-12 11:54:23,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 502. [2024-11-12 11:54:23,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 479 states have (on average 1.3298538622129437) internal successors, (637), 483 states have internal predecessors, (637), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:54:23,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 667 transitions. [2024-11-12 11:54:23,043 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 667 transitions. Word has length 72 [2024-11-12 11:54:23,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:54:23,044 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 667 transitions. [2024-11-12 11:54:23,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:23,044 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 667 transitions. [2024-11-12 11:54:23,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-12 11:54:23,045 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:54:23,045 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:54:23,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 11:54:23,045 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:54:23,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:54:23,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1607808641, now seen corresponding path program 1 times [2024-11-12 11:54:23,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:54:23,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704958097] [2024-11-12 11:54:23,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:54:23,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:54:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:54:23,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:54:23,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:54:23,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704958097] [2024-11-12 11:54:23,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704958097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:54:23,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:54:23,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 11:54:23,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127207591] [2024-11-12 11:54:23,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:54:23,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 11:54:23,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:54:23,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 11:54:23,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 11:54:23,375 INFO L87 Difference]: Start difference. First operand 502 states and 667 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:23,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:54:23,907 INFO L93 Difference]: Finished difference Result 977 states and 1311 transitions. [2024-11-12 11:54:23,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 11:54:23,908 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-12 11:54:23,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:54:23,911 INFO L225 Difference]: With dead ends: 977 [2024-11-12 11:54:23,912 INFO L226 Difference]: Without dead ends: 511 [2024-11-12 11:54:23,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-12 11:54:23,914 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 22 mSDsluCounter, 3441 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 4001 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 11:54:23,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 4001 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 11:54:23,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-12 11:54:23,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 499. [2024-11-12 11:54:23,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 476 states have (on average 1.3319327731092436) internal successors, (634), 480 states have internal predecessors, (634), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 11:54:23,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 664 transitions. [2024-11-12 11:54:23,933 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 664 transitions. Word has length 72 [2024-11-12 11:54:23,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:54:23,933 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 664 transitions. [2024-11-12 11:54:23,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:23,933 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 664 transitions. [2024-11-12 11:54:23,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-12 11:54:23,934 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:54:23,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:54:23,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 11:54:23,935 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-12 11:54:23,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:54:23,935 INFO L85 PathProgramCache]: Analyzing trace with hash 2084167451, now seen corresponding path program 1 times [2024-11-12 11:54:23,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:54:23,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411925694] [2024-11-12 11:54:23,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:54:23,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:54:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:54:48,857 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288)) (.cse0 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192))) (and (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (<= 4408680405129836981 (+ (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059) (* (div (+ (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|) 8817360810260198248 .cse1 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* (- 1) .cse0)) 4294967296) 2147483648))))) is different from false [2024-11-12 11:54:48,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:54:48,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:54:48,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411925694] [2024-11-12 11:54:48,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411925694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:54:48,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:54:48,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 11:54:48,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809406950] [2024-11-12 11:54:48,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:54:48,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 11:54:48,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:54:48,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 11:54:48,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2024-11-12 11:54:48,935 INFO L87 Difference]: Start difference. First operand 499 states and 664 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:54:53,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 11:54:57,061 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-12 11:55:01,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 11:55:05,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 11:55:08,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 11:55:10,133 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-12 11:55:14,141 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192)) (.cse3 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288))) (let ((.cse0 (+ .cse3 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse6 (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse7 (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059)) (.cse2 (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|)) (.cse4 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse5 (* (- 1) .cse1))) (and (or (< .cse0 (+ .cse1 (mod |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296))) (< 4408680405129836980 (+ (* 1030789529 |c_ULTIMATE.start_main_~_hj_i~0#1|) (* 2147483648 (div (+ .cse2 8817360810260198248 (* (- 2061579059) |c_ULTIMATE.start_main_~_hj_i~0#1|) .cse3 .cse4 .cse5) 4294967296)) .cse6 .cse7 (* (div |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296) 2147483648)))) (= .cse1 .cse0) (<= 4408680405129836981 (+ .cse6 .cse7 (* (div (+ .cse2 8817360810260198248 .cse3 .cse4 .cse5) 4294967296) 2147483648)))))) is different from false [2024-11-12 11:55:16,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 11:55:18,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 11:55:20,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []