./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/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-dev-4a390ef-m [2024-10-24 14:49:11,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 14:49:11,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 14:49:11,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 14:49:11,382 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 14:49:11,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 14:49:11,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 14:49:11,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 14:49:11,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 14:49:11,410 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 14:49:11,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 14:49:11,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 14:49:11,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 14:49:11,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 14:49:11,412 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 14:49:11,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 14:49:11,415 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 14:49:11,415 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 14:49:11,415 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 14:49:11,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 14:49:11,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 14:49:11,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 14:49:11,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 14:49:11,417 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 14:49:11,418 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 14:49:11,418 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 14:49:11,418 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 14:49:11,418 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 14:49:11,419 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 14:49:11,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 14:49:11,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 14:49:11,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 14:49:11,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 14:49:11,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 14:49:11,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 14:49:11,421 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 14:49:11,421 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 14:49:11,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 14:49:11,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 14:49:11,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 14:49:11,422 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 14:49:11,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 14:49:11,423 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-10-24 14:49:11,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 14:49:11,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 14:49:11,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 14:49:11,689 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 14:49:11,689 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 14:49:11,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i [2024-10-24 14:49:13,152 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 14:49:13,445 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 14:49:13,446 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i [2024-10-24 14:49:13,466 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be4c8b3e6/389261b94cde446db3be5150785e0495/FLAGa2e1dc121 [2024-10-24 14:49:13,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be4c8b3e6/389261b94cde446db3be5150785e0495 [2024-10-24 14:49:13,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 14:49:13,720 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 14:49:13,720 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 14:49:13,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 14:49:13,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 14:49:13,728 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:49:13" (1/1) ... [2024-10-24 14:49:13,729 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72162798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:13, skipping insertion in model container [2024-10-24 14:49:13,729 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:49:13" (1/1) ... [2024-10-24 14:49:13,784 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 14:49:14,348 WARN L248 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-10-24 14:49:14,370 WARN L248 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-10-24 14:49:14,463 WARN L248 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-10-24 14:49:14,464 WARN L248 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-10-24 14:49:14,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 14:49:14,500 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 14:49:14,541 WARN L248 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-10-24 14:49:14,543 WARN L248 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-10-24 14:49:14,594 WARN L248 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-10-24 14:49:14,598 WARN L248 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-10-24 14:49:14,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 14:49:14,680 INFO L204 MainTranslator]: Completed translation [2024-10-24 14:49:14,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:14 WrapperNode [2024-10-24 14:49:14,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 14:49:14,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 14:49:14,682 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 14:49:14,682 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 14:49:14,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:14" (1/1) ... [2024-10-24 14:49:14,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:14" (1/1) ... [2024-10-24 14:49:14,813 INFO L138 Inliner]: procedures = 282, calls = 339, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1638 [2024-10-24 14:49:14,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 14:49:14,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 14:49:14,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 14:49:14,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 14:49:14,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:14" (1/1) ... [2024-10-24 14:49:14,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:14" (1/1) ... [2024-10-24 14:49:14,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:14" (1/1) ... [2024-10-24 14:49:14,955 INFO L175 MemorySlicer]: Split 309 memory accesses to 4 slices as follows [2, 3, 34, 270]. 87 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 63 writes are split as follows [0, 2, 4, 57]. [2024-10-24 14:49:14,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:14" (1/1) ... [2024-10-24 14:49:14,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:14" (1/1) ... [2024-10-24 14:49:15,014 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:14" (1/1) ... [2024-10-24 14:49:15,032 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:14" (1/1) ... [2024-10-24 14:49:15,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:14" (1/1) ... [2024-10-24 14:49:15,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:14" (1/1) ... [2024-10-24 14:49:15,062 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 14:49:15,063 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 14:49:15,063 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 14:49:15,063 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 14:49:15,064 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:14" (1/1) ... [2024-10-24 14:49:15,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 14:49:15,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 14:49:15,101 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-10-24 14:49:15,105 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-10-24 14:49:15,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 14:49:15,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 14:49:15,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 14:49:15,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 14:49:15,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-24 14:49:15,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 14:49:15,159 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-10-24 14:49:15,159 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-10-24 14:49:15,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 14:49:15,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 14:49:15,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 14:49:15,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 14:49:15,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 14:49:15,160 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 14:49:15,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 14:49:15,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 14:49:15,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 14:49:15,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 14:49:15,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 14:49:15,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 14:49:15,162 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-10-24 14:49:15,162 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-10-24 14:49:15,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 14:49:15,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 14:49:15,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 14:49:15,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-24 14:49:15,163 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-10-24 14:49:15,163 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-10-24 14:49:15,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 14:49:15,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 14:49:15,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 14:49:15,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 14:49:15,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 14:49:15,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 14:49:15,438 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 14:49:15,440 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 14:49:17,025 INFO L? ?]: Removed 364 outVars from TransFormulas that were not future-live. [2024-10-24 14:49:17,025 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 14:49:17,076 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 14:49:17,077 INFO L314 CfgBuilder]: Removed 72 assume(true) statements. [2024-10-24 14:49:17,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:49:17 BoogieIcfgContainer [2024-10-24 14:49:17,077 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 14:49:17,079 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 14:49:17,080 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 14:49:17,083 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 14:49:17,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:49:13" (1/3) ... [2024-10-24 14:49:17,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c092118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:49:17, skipping insertion in model container [2024-10-24 14:49:17,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:14" (2/3) ... [2024-10-24 14:49:17,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c092118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:49:17, skipping insertion in model container [2024-10-24 14:49:17,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:49:17" (3/3) ... [2024-10-24 14:49:17,087 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test6-2.i [2024-10-24 14:49:17,103 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 14:49:17,103 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-24 14:49:17,175 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 14:49:17,181 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;@3cb44485, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 14:49:17,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-24 14:49:17,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 462 states, 438 states have (on average 1.6141552511415524) internal successors, (707), 442 states have internal predecessors, (707), 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-10-24 14:49:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 14:49:17,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:49:17,194 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:49:17,195 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-10-24 14:49:17,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:49:17,200 INFO L85 PathProgramCache]: Analyzing trace with hash 123534520, now seen corresponding path program 1 times [2024-10-24 14:49:17,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:49:17,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903882005] [2024-10-24 14:49:17,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:49:17,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:49:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:49:17,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:49:17,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:49:17,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903882005] [2024-10-24 14:49:17,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903882005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:49:17,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:49:17,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 14:49:17,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952770335] [2024-10-24 14:49:17,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:49:17,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 14:49:17,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:49:17,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 14:49:17,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 14:49:17,447 INFO L87 Difference]: Start difference. First operand has 462 states, 438 states have (on average 1.6141552511415524) internal successors, (707), 442 states have internal predecessors, (707), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-10-24 14:49:17,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:49:17,572 INFO L93 Difference]: Finished difference Result 921 states and 1486 transitions. [2024-10-24 14:49:17,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 14:49:17,578 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2024-10-24 14:49:17,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:49:17,596 INFO L225 Difference]: With dead ends: 921 [2024-10-24 14:49:17,597 INFO L226 Difference]: Without dead ends: 458 [2024-10-24 14:49:17,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 14:49:17,609 INFO L432 NwaCegarLoop]: 647 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 14:49:17,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 647 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 14:49:17,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-10-24 14:49:17,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2024-10-24 14:49:17,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 435 states have (on average 1.4344827586206896) internal successors, (624), 439 states have internal predecessors, (624), 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-10-24 14:49:17,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 654 transitions. [2024-10-24 14:49:17,700 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 654 transitions. Word has length 7 [2024-10-24 14:49:17,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:49:17,700 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 654 transitions. [2024-10-24 14:49:17,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-10-24 14:49:17,701 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 654 transitions. [2024-10-24 14:49:17,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 14:49:17,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:49:17,702 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:49:17,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 14:49:17,702 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-10-24 14:49:17,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:49:17,704 INFO L85 PathProgramCache]: Analyzing trace with hash 215496090, now seen corresponding path program 1 times [2024-10-24 14:49:17,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:49:17,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865163992] [2024-10-24 14:49:17,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:49:17,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:49:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:49:17,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:49:17,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:49:17,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865163992] [2024-10-24 14:49:17,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865163992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:49:17,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:49:17,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 14:49:17,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022257418] [2024-10-24 14:49:17,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:49:17,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 14:49:17,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:49:17,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 14:49:17,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 14:49:17,907 INFO L87 Difference]: Start difference. First operand 458 states and 654 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 14:49:18,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:49:18,124 INFO L93 Difference]: Finished difference Result 1141 states and 1637 transitions. [2024-10-24 14:49:18,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 14:49:18,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-24 14:49:18,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:49:18,130 INFO L225 Difference]: With dead ends: 1141 [2024-10-24 14:49:18,130 INFO L226 Difference]: Without dead ends: 894 [2024-10-24 14:49:18,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 14:49:18,133 INFO L432 NwaCegarLoop]: 721 mSDtfsCounter, 602 mSDsluCounter, 1338 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 2059 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 14:49:18,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 2059 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 14:49:18,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-10-24 14:49:18,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 460. [2024-10-24 14:49:18,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 437 states have (on average 1.4324942791762014) internal successors, (626), 441 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-10-24 14:49:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 656 transitions. [2024-10-24 14:49:18,189 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 656 transitions. Word has length 9 [2024-10-24 14:49:18,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:49:18,189 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 656 transitions. [2024-10-24 14:49:18,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 14:49:18,194 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 656 transitions. [2024-10-24 14:49:18,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-24 14:49:18,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:49:18,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:49:18,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 14:49:18,197 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-10-24 14:49:18,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:49:18,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1344700540, now seen corresponding path program 1 times [2024-10-24 14:49:18,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:49:18,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84618012] [2024-10-24 14:49:18,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:49:18,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:49:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:49:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:49:18,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:49:18,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84618012] [2024-10-24 14:49:18,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84618012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:49:18,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:49:18,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 14:49:18,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737325310] [2024-10-24 14:49:18,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:49:18,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 14:49:18,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:49:18,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 14:49:18,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 14:49:18,494 INFO L87 Difference]: Start difference. First operand 460 states and 656 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-10-24 14:49:18,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:49:18,622 INFO L93 Difference]: Finished difference Result 920 states and 1312 transitions. [2024-10-24 14:49:18,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 14:49:18,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 64 [2024-10-24 14:49:18,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:49:18,626 INFO L225 Difference]: With dead ends: 920 [2024-10-24 14:49:18,628 INFO L226 Difference]: Without dead ends: 463 [2024-10-24 14:49:18,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 14:49:18,630 INFO L432 NwaCegarLoop]: 618 mSDtfsCounter, 106 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 14:49:18,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1763 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 14:49:18,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-24 14:49:18,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 460. [2024-10-24 14:49:18,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 437 states have (on average 1.4164759725400458) internal successors, (619), 441 states have internal predecessors, (619), 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-10-24 14:49:18,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 649 transitions. [2024-10-24 14:49:18,659 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 649 transitions. Word has length 64 [2024-10-24 14:49:18,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:49:18,661 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 649 transitions. [2024-10-24 14:49:18,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-10-24 14:49:18,662 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 649 transitions. [2024-10-24 14:49:18,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-24 14:49:18,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:49:18,665 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:49:18,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 14:49:18,665 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-10-24 14:49:18,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:49:18,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1049205422, now seen corresponding path program 1 times [2024-10-24 14:49:18,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:49:18,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298168885] [2024-10-24 14:49:18,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:49:18,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:49:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:49:18,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:49:18,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:49:18,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298168885] [2024-10-24 14:49:18,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298168885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:49:18,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:49:18,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 14:49:18,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941877089] [2024-10-24 14:49:18,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:49:18,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 14:49:18,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:49:18,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 14:49:18,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 14:49:18,808 INFO L87 Difference]: Start difference. First operand 460 states and 649 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-10-24 14:49:18,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:49:18,896 INFO L93 Difference]: Finished difference Result 869 states and 1220 transitions. [2024-10-24 14:49:18,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 14:49:18,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 64 [2024-10-24 14:49:18,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:49:18,901 INFO L225 Difference]: With dead ends: 869 [2024-10-24 14:49:18,901 INFO L226 Difference]: Without dead ends: 412 [2024-10-24 14:49:18,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 14:49:18,904 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 9 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 14:49:18,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1612 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 14:49:18,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-24 14:49:18,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2024-10-24 14:49:18,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 389 states have (on average 1.3856041131105399) internal successors, (539), 393 states have internal predecessors, (539), 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-10-24 14:49:18,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 569 transitions. [2024-10-24 14:49:18,922 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 569 transitions. Word has length 64 [2024-10-24 14:49:18,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:49:18,922 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 569 transitions. [2024-10-24 14:49:18,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-10-24 14:49:18,922 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 569 transitions. [2024-10-24 14:49:18,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-24 14:49:18,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:49:18,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:49:18,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 14:49:18,924 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-10-24 14:49:18,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:49:18,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1873954576, now seen corresponding path program 1 times [2024-10-24 14:49:18,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:49:18,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725336102] [2024-10-24 14:49:18,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:49:18,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:49:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:49:19,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:49:19,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:49:19,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725336102] [2024-10-24 14:49:19,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725336102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:49:19,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:49:19,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:49:19,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186413880] [2024-10-24 14:49:19,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:49:19,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:49:19,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:49:19,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:49:19,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:49:19,425 INFO L87 Difference]: Start difference. First operand 412 states and 569 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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-10-24 14:49:19,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:49:19,805 INFO L93 Difference]: Finished difference Result 826 states and 1143 transitions. [2024-10-24 14:49:19,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 14:49:19,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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 64 [2024-10-24 14:49:19,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:49:19,809 INFO L225 Difference]: With dead ends: 826 [2024-10-24 14:49:19,809 INFO L226 Difference]: Without dead ends: 417 [2024-10-24 14:49:19,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 14:49:19,811 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 10 mSDsluCounter, 1887 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2431 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 14:49:19,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2431 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 14:49:19,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-10-24 14:49:19,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 414. [2024-10-24 14:49:19,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 391 states have (on average 1.3836317135549872) internal successors, (541), 395 states have internal predecessors, (541), 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-10-24 14:49:19,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 571 transitions. [2024-10-24 14:49:19,831 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 571 transitions. Word has length 64 [2024-10-24 14:49:19,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:49:19,831 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 571 transitions. [2024-10-24 14:49:19,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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-10-24 14:49:19,832 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 571 transitions. [2024-10-24 14:49:19,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 14:49:19,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:49:19,833 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:49:19,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 14:49:19,833 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-10-24 14:49:19,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:49:19,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1439444555, now seen corresponding path program 1 times [2024-10-24 14:49:19,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:49:19,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440192380] [2024-10-24 14:49:19,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:49:19,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:49:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:49:20,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:49:20,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:49:20,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440192380] [2024-10-24 14:49:20,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440192380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:49:20,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:49:20,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 14:49:20,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315386049] [2024-10-24 14:49:20,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:49:20,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 14:49:20,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:49:20,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 14:49:20,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 14:49:20,163 INFO L87 Difference]: Start difference. First operand 414 states and 571 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-10-24 14:49:20,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:49:20,315 INFO L93 Difference]: Finished difference Result 825 states and 1139 transitions. [2024-10-24 14:49:20,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 14:49:20,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 65 [2024-10-24 14:49:20,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:49:20,319 INFO L225 Difference]: With dead ends: 825 [2024-10-24 14:49:20,319 INFO L226 Difference]: Without dead ends: 414 [2024-10-24 14:49:20,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 14:49:20,321 INFO L432 NwaCegarLoop]: 549 mSDtfsCounter, 13 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 14:49:20,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1524 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 14:49:20,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-10-24 14:49:20,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2024-10-24 14:49:20,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 391 states have (on average 1.381074168797954) internal successors, (540), 395 states have internal predecessors, (540), 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-10-24 14:49:20,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 570 transitions. [2024-10-24 14:49:20,337 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 570 transitions. Word has length 65 [2024-10-24 14:49:20,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:49:20,339 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 570 transitions. [2024-10-24 14:49:20,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-10-24 14:49:20,340 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 570 transitions. [2024-10-24 14:49:20,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 14:49:20,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:49:20,342 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:49:20,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 14:49:20,342 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-10-24 14:49:20,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:49:20,347 INFO L85 PathProgramCache]: Analyzing trace with hash -395161161, now seen corresponding path program 1 times [2024-10-24 14:49:20,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:49:20,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688450122] [2024-10-24 14:49:20,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:49:20,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:49:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:49:20,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:49:20,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:49:20,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688450122] [2024-10-24 14:49:20,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688450122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:49:20,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:49:20,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 14:49:20,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943917370] [2024-10-24 14:49:20,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:49:20,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 14:49:20,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:49:20,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 14:49:20,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 14:49:20,627 INFO L87 Difference]: Start difference. First operand 414 states and 570 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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-10-24 14:49:20,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:49:20,978 INFO L93 Difference]: Finished difference Result 830 states and 1145 transitions. [2024-10-24 14:49:20,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:49:20,981 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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 65 [2024-10-24 14:49:20,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:49:20,984 INFO L225 Difference]: With dead ends: 830 [2024-10-24 14:49:20,985 INFO L226 Difference]: Without dead ends: 419 [2024-10-24 14:49:20,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 14:49:20,987 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 10 mSDsluCounter, 2379 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2917 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 14:49:20,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2917 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 14:49:20,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-10-24 14:49:20,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 418. [2024-10-24 14:49:20,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 395 states have (on average 1.379746835443038) internal successors, (545), 399 states have internal predecessors, (545), 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-10-24 14:49:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 575 transitions. [2024-10-24 14:49:21,000 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 575 transitions. Word has length 65 [2024-10-24 14:49:21,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:49:21,000 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 575 transitions. [2024-10-24 14:49:21,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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-10-24 14:49:21,001 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 575 transitions. [2024-10-24 14:49:21,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-24 14:49:21,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:49:21,003 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:49:21,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 14:49:21,003 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-10-24 14:49:21,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:49:21,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1465365099, now seen corresponding path program 1 times [2024-10-24 14:49:21,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:49:21,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199945506] [2024-10-24 14:49:21,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:49:21,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:49:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:49:21,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:49:21,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:49:21,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199945506] [2024-10-24 14:49:21,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199945506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:49:21,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:49:21,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:49:21,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859524376] [2024-10-24 14:49:21,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:49:21,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:49:21,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:49:21,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:49:21,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:49:21,276 INFO L87 Difference]: Start difference. First operand 418 states and 575 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-10-24 14:49:21,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:49:21,512 INFO L93 Difference]: Finished difference Result 836 states and 1152 transitions. [2024-10-24 14:49:21,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 14:49:21,513 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-10-24 14:49:21,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:49:21,515 INFO L225 Difference]: With dead ends: 836 [2024-10-24 14:49:21,516 INFO L226 Difference]: Without dead ends: 421 [2024-10-24 14:49:21,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:49:21,517 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 4 mSDsluCounter, 1446 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 14:49:21,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1996 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 14:49:21,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-10-24 14:49:21,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2024-10-24 14:49:21,528 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-10-24 14:49:21,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 578 transitions. [2024-10-24 14:49:21,530 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 578 transitions. Word has length 66 [2024-10-24 14:49:21,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:49:21,530 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 578 transitions. [2024-10-24 14:49:21,531 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-10-24 14:49:21,531 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 578 transitions. [2024-10-24 14:49:21,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-24 14:49:21,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:49:21,532 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:49:21,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 14:49:21,532 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-10-24 14:49:21,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:49:21,533 INFO L85 PathProgramCache]: Analyzing trace with hash 55631932, now seen corresponding path program 1 times [2024-10-24 14:49:21,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:49:21,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546552040] [2024-10-24 14:49:21,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:49:21,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:49:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:49:21,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:49:21,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:49:21,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546552040] [2024-10-24 14:49:21,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546552040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:49:21,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:49:21,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 14:49:21,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152415167] [2024-10-24 14:49:21,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:49:21,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 14:49:21,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:49:21,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 14:49:21,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 14:49:21,937 INFO L87 Difference]: Start difference. First operand 421 states and 578 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 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-10-24 14:49:22,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:49:22,437 INFO L93 Difference]: Finished difference Result 852 states and 1174 transitions. [2024-10-24 14:49:22,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 14:49:22,438 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 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-10-24 14:49:22,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:49:22,440 INFO L225 Difference]: With dead ends: 852 [2024-10-24 14:49:22,440 INFO L226 Difference]: Without dead ends: 434 [2024-10-24 14:49:22,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-24 14:49:22,442 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 30 mSDsluCounter, 3397 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3936 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 14:49:22,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3936 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 14:49:22,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-10-24 14:49:22,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2024-10-24 14:49:22,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 408 states have (on average 1.3774509803921569) internal successors, (562), 412 states have internal predecessors, (562), 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-10-24 14:49:22,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 592 transitions. [2024-10-24 14:49:22,454 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 592 transitions. Word has length 66 [2024-10-24 14:49:22,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:49:22,454 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 592 transitions. [2024-10-24 14:49:22,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 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-10-24 14:49:22,455 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 592 transitions. [2024-10-24 14:49:22,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-24 14:49:22,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:49:22,455 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:49:22,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 14:49:22,456 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-10-24 14:49:22,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:49:22,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1668302933, now seen corresponding path program 1 times [2024-10-24 14:49:22,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:49:22,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106619187] [2024-10-24 14:49:22,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:49:22,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:49:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:49:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:49:22,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:49:22,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106619187] [2024-10-24 14:49:22,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106619187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:49:22,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:49:22,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 14:49:22,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345383765] [2024-10-24 14:49:22,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:49:22,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 14:49:22,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:49:22,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 14:49:22,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 14:49:22,868 INFO L87 Difference]: Start difference. First operand 431 states and 592 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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-10-24 14:49:23,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:49:23,280 INFO L93 Difference]: Finished difference Result 862 states and 1186 transitions. [2024-10-24 14:49:23,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 14:49:23,280 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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-10-24 14:49:23,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:49:23,283 INFO L225 Difference]: With dead ends: 862 [2024-10-24 14:49:23,283 INFO L226 Difference]: Without dead ends: 434 [2024-10-24 14:49:23,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-24 14:49:23,285 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 23 mSDsluCounter, 2904 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3447 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 14:49:23,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3447 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 14:49:23,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-10-24 14:49:23,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2024-10-24 14:49:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 411 states have (on average 1.3746958637469586) internal successors, (565), 415 states have internal predecessors, (565), 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-10-24 14:49:23,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 595 transitions. [2024-10-24 14:49:23,298 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 595 transitions. Word has length 66 [2024-10-24 14:49:23,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:49:23,299 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 595 transitions. [2024-10-24 14:49:23,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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-10-24 14:49:23,300 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 595 transitions. [2024-10-24 14:49:23,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-24 14:49:23,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:49:23,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:49:23,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 14:49:23,301 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-10-24 14:49:23,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:49:23,302 INFO L85 PathProgramCache]: Analyzing trace with hash -267751346, now seen corresponding path program 1 times [2024-10-24 14:49:23,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:49:23,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726245771] [2024-10-24 14:49:23,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:49:23,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:49:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:49:23,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:49:23,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:49:23,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726245771] [2024-10-24 14:49:23,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726245771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:49:23,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:49:23,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 14:49:23,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254318187] [2024-10-24 14:49:23,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:49:23,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 14:49:23,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:49:23,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 14:49:23,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 14:49:23,599 INFO L87 Difference]: Start difference. First operand 434 states and 595 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-10-24 14:49:23,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:49:23,959 INFO L93 Difference]: Finished difference Result 870 states and 1195 transitions. [2024-10-24 14:49:23,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:49:23,960 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-10-24 14:49:23,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:49:23,963 INFO L225 Difference]: With dead ends: 870 [2024-10-24 14:49:23,964 INFO L226 Difference]: Without dead ends: 439 [2024-10-24 14:49:23,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 14:49:23,966 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 9 mSDsluCounter, 2379 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2923 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 14:49:23,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2923 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 14:49:23,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-10-24 14:49:23,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 434. [2024-10-24 14:49:23,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 411 states have (on average 1.3746958637469586) internal successors, (565), 415 states have internal predecessors, (565), 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-10-24 14:49:23,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 595 transitions. [2024-10-24 14:49:23,979 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 595 transitions. Word has length 67 [2024-10-24 14:49:23,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:49:23,980 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 595 transitions. [2024-10-24 14:49:23,980 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-10-24 14:49:23,980 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 595 transitions. [2024-10-24 14:49:23,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-24 14:49:23,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:49:23,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:49:23,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 14:49:23,981 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-10-24 14:49:23,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:49:23,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1004481798, now seen corresponding path program 1 times [2024-10-24 14:49:23,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:49:23,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225129481] [2024-10-24 14:49:23,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:49:23,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:49:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:49:24,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:49:24,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:49:24,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225129481] [2024-10-24 14:49:24,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225129481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:49:24,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:49:24,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 14:49:24,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919064887] [2024-10-24 14:49:24,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:49:24,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 14:49:24,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:49:24,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 14:49:24,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-24 14:49:24,575 INFO L87 Difference]: Start difference. First operand 434 states and 595 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 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-10-24 14:49:25,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:49:25,510 INFO L93 Difference]: Finished difference Result 1258 states and 1737 transitions. [2024-10-24 14:49:25,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 14:49:25,511 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 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-10-24 14:49:25,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:49:25,515 INFO L225 Difference]: With dead ends: 1258 [2024-10-24 14:49:25,515 INFO L226 Difference]: Without dead ends: 827 [2024-10-24 14:49:25,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 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-10-24 14:49:25,517 INFO L432 NwaCegarLoop]: 579 mSDtfsCounter, 646 mSDsluCounter, 2941 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 3520 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 14:49:25,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 3520 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 14:49:25,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2024-10-24 14:49:25,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 465. [2024-10-24 14:49:25,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 442 states have (on average 1.3484162895927603) internal successors, (596), 446 states have internal predecessors, (596), 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-10-24 14:49:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 626 transitions. [2024-10-24 14:49:25,536 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 626 transitions. Word has length 67 [2024-10-24 14:49:25,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:49:25,536 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 626 transitions. [2024-10-24 14:49:25,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 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-10-24 14:49:25,537 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 626 transitions. [2024-10-24 14:49:25,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-24 14:49:25,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:49:25,538 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:49:25,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 14:49:25,538 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-10-24 14:49:25,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:49:25,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1868095393, now seen corresponding path program 1 times [2024-10-24 14:49:25,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:49:25,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842483500] [2024-10-24 14:49:25,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:49:25,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:49:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:49:25,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:49:25,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:49:25,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842483500] [2024-10-24 14:49:25,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842483500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:49:25,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:49:25,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 14:49:25,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447117426] [2024-10-24 14:49:25,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:49:25,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 14:49:25,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:49:25,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 14:49:25,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-24 14:49:25,821 INFO L87 Difference]: Start difference. First operand 465 states and 626 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-10-24 14:49:26,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:49:26,131 INFO L93 Difference]: Finished difference Result 906 states and 1232 transitions. [2024-10-24 14:49:26,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 14:49:26,132 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-10-24 14:49:26,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:49:26,134 INFO L225 Difference]: With dead ends: 906 [2024-10-24 14:49:26,134 INFO L226 Difference]: Without dead ends: 475 [2024-10-24 14:49:26,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-24 14:49:26,136 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 16 mSDsluCounter, 2474 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3012 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 14:49:26,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3012 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 14:49:26,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-10-24 14:49:26,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 468. [2024-10-24 14:49:26,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 445 states have (on average 1.348314606741573) internal successors, (600), 449 states have internal predecessors, (600), 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-10-24 14:49:26,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 630 transitions. [2024-10-24 14:49:26,151 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 630 transitions. Word has length 68 [2024-10-24 14:49:26,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:49:26,151 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 630 transitions. [2024-10-24 14:49:26,151 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-10-24 14:49:26,152 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 630 transitions. [2024-10-24 14:49:26,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-24 14:49:26,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:49:26,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:49:26,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 14:49:26,153 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-10-24 14:49:26,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:49:26,153 INFO L85 PathProgramCache]: Analyzing trace with hash -289631099, now seen corresponding path program 1 times [2024-10-24 14:49:26,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:49:26,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989458038] [2024-10-24 14:49:26,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:49:26,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:49:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:49:26,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:49:26,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:49:26,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989458038] [2024-10-24 14:49:26,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989458038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:49:26,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:49:26,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 14:49:26,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146080872] [2024-10-24 14:49:26,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:49:26,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 14:49:26,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:49:26,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 14:49:26,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 14:49:26,410 INFO L87 Difference]: Start difference. First operand 468 states and 630 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-10-24 14:49:26,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:49:26,915 INFO L93 Difference]: Finished difference Result 912 states and 1240 transitions. [2024-10-24 14:49:26,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 14:49:26,915 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-10-24 14:49:26,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:49:26,919 INFO L225 Difference]: With dead ends: 912 [2024-10-24 14:49:26,919 INFO L226 Difference]: Without dead ends: 478 [2024-10-24 14:49:26,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-24 14:49:26,921 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 26 mSDsluCounter, 3329 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3872 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 14:49:26,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3872 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 14:49:26,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-10-24 14:49:26,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 468. [2024-10-24 14:49:26,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 445 states have (on average 1.348314606741573) internal successors, (600), 449 states have internal predecessors, (600), 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-10-24 14:49:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 630 transitions. [2024-10-24 14:49:26,939 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 630 transitions. Word has length 68 [2024-10-24 14:49:26,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:49:26,940 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 630 transitions. [2024-10-24 14:49:26,940 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-10-24 14:49:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 630 transitions. [2024-10-24 14:49:26,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 14:49:26,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:49:26,941 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:49:26,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 14:49:26,942 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-10-24 14:49:26,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:49:26,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1391773950, now seen corresponding path program 1 times [2024-10-24 14:49:26,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:49:26,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044907402] [2024-10-24 14:49:26,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:49:26,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:49:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:49:27,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:49:27,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:49:27,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044907402] [2024-10-24 14:49:27,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044907402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:49:27,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:49:27,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 14:49:27,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52029693] [2024-10-24 14:49:27,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:49:27,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 14:49:27,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:49:27,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 14:49:27,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:49:27,269 INFO L87 Difference]: Start difference. First operand 468 states and 630 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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-10-24 14:49:27,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:49:27,761 INFO L93 Difference]: Finished difference Result 918 states and 1249 transitions. [2024-10-24 14:49:27,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 14:49:27,761 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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-10-24 14:49:27,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:49:27,764 INFO L225 Difference]: With dead ends: 918 [2024-10-24 14:49:27,764 INFO L226 Difference]: Without dead ends: 484 [2024-10-24 14:49:27,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-24 14:49:27,767 INFO L432 NwaCegarLoop]: 545 mSDtfsCounter, 19 mSDsluCounter, 3408 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3953 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 14:49:27,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3953 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 14:49:27,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-10-24 14:49:27,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 478. [2024-10-24 14:49:27,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 455 states have (on average 1.3450549450549452) internal successors, (612), 459 states have internal predecessors, (612), 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-10-24 14:49:27,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 642 transitions. [2024-10-24 14:49:27,785 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 642 transitions. Word has length 69 [2024-10-24 14:49:27,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:49:27,785 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 642 transitions. [2024-10-24 14:49:27,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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-10-24 14:49:27,785 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 642 transitions. [2024-10-24 14:49:27,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 14:49:27,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:49:27,786 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:49:27,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 14:49:27,787 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-10-24 14:49:27,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:49:27,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1073237862, now seen corresponding path program 1 times [2024-10-24 14:49:27,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:49:27,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880067497] [2024-10-24 14:49:27,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:49:27,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:49:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:49:28,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:49:28,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:49:28,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880067497] [2024-10-24 14:49:28,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880067497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:49:28,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:49:28,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 14:49:28,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556145781] [2024-10-24 14:49:28,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:49:28,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 14:49:28,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:49:28,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 14:49:28,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:49:28,113 INFO L87 Difference]: Start difference. First operand 478 states and 642 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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-10-24 14:49:28,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:49:28,609 INFO L93 Difference]: Finished difference Result 938 states and 1273 transitions. [2024-10-24 14:49:28,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 14:49:28,613 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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-10-24 14:49:28,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:49:28,615 INFO L225 Difference]: With dead ends: 938 [2024-10-24 14:49:28,615 INFO L226 Difference]: Without dead ends: 494 [2024-10-24 14:49:28,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:49:28,617 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 13 mSDsluCounter, 3856 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4387 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 14:49:28,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4387 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 14:49:28,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-10-24 14:49:28,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 481. [2024-10-24 14:49:28,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 458 states have (on average 1.3449781659388647) internal successors, (616), 462 states have internal predecessors, (616), 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-10-24 14:49:28,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 646 transitions. [2024-10-24 14:49:28,635 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 646 transitions. Word has length 69 [2024-10-24 14:49:28,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:49:28,636 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 646 transitions. [2024-10-24 14:49:28,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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-10-24 14:49:28,636 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 646 transitions. [2024-10-24 14:49:28,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 14:49:28,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:49:28,637 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:49:28,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 14:49:28,637 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-10-24 14:49:28,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:49:28,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1723676698, now seen corresponding path program 1 times [2024-10-24 14:49:28,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:49:28,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335054546] [2024-10-24 14:49:28,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:49:28,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:49:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:49:28,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:49:28,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:49:28,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335054546] [2024-10-24 14:49:28,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335054546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:49:28,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:49:28,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 14:49:28,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721202721] [2024-10-24 14:49:28,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:49:28,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 14:49:28,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:49:28,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 14:49:28,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 14:49:28,953 INFO L87 Difference]: Start difference. First operand 481 states and 646 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-10-24 14:49:29,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:49:29,297 INFO L93 Difference]: Finished difference Result 933 states and 1263 transitions. [2024-10-24 14:49:29,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:49:29,298 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-10-24 14:49:29,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:49:29,301 INFO L225 Difference]: With dead ends: 933 [2024-10-24 14:49:29,301 INFO L226 Difference]: Without dead ends: 486 [2024-10-24 14:49:29,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 14:49:29,303 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 7 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2947 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 14:49:29,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2947 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 14:49:29,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2024-10-24 14:49:29,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 481. [2024-10-24 14:49:29,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 458 states have (on average 1.3427947598253276) internal successors, (615), 462 states have internal predecessors, (615), 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-10-24 14:49:29,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 645 transitions. [2024-10-24 14:49:29,320 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 645 transitions. Word has length 69 [2024-10-24 14:49:29,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:49:29,321 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 645 transitions. [2024-10-24 14:49:29,321 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-10-24 14:49:29,321 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 645 transitions. [2024-10-24 14:49:29,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 14:49:29,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:49:29,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:49:29,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 14:49:29,322 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-10-24 14:49:29,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:49:29,323 INFO L85 PathProgramCache]: Analyzing trace with hash -958619597, now seen corresponding path program 1 times [2024-10-24 14:49:29,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:49:29,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936995931] [2024-10-24 14:49:29,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:49:29,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:49:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:49:29,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:49:29,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:49:29,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936995931] [2024-10-24 14:49:29,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936995931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:49:29,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:49:29,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 14:49:29,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535631119] [2024-10-24 14:49:29,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:49:29,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 14:49:29,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:49:29,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 14:49:29,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 14:49:29,653 INFO L87 Difference]: Start difference. First operand 481 states and 645 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-10-24 14:49:30,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:49:30,031 INFO L93 Difference]: Finished difference Result 931 states and 1261 transitions. [2024-10-24 14:49:30,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:49:30,032 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-10-24 14:49:30,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:49:30,035 INFO L225 Difference]: With dead ends: 931 [2024-10-24 14:49:30,035 INFO L226 Difference]: Without dead ends: 484 [2024-10-24 14:49:30,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 14:49:30,037 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 4 mSDsluCounter, 2363 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2906 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 14:49:30,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2906 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 14:49:30,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-10-24 14:49:30,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2024-10-24 14:49:30,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 461 states have (on average 1.3405639913232104) internal successors, (618), 465 states have internal predecessors, (618), 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-10-24 14:49:30,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 648 transitions. [2024-10-24 14:49:30,056 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 648 transitions. Word has length 69 [2024-10-24 14:49:30,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:49:30,056 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 648 transitions. [2024-10-24 14:49:30,056 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-10-24 14:49:30,056 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 648 transitions. [2024-10-24 14:49:30,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-24 14:49:30,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:49:30,057 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:49:30,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 14:49:30,058 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-10-24 14:49:30,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:49:30,058 INFO L85 PathProgramCache]: Analyzing trace with hash 710707364, now seen corresponding path program 1 times [2024-10-24 14:49:30,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:49:30,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212058205] [2024-10-24 14:49:30,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:49:30,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:49:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:49:30,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:49:30,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:49:30,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212058205] [2024-10-24 14:49:30,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212058205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:49:30,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:49:30,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 14:49:30,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252688592] [2024-10-24 14:49:30,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:49:30,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 14:49:30,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:49:30,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 14:49:30,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:49:30,482 INFO L87 Difference]: Start difference. First operand 484 states and 648 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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-10-24 14:49:31,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:49:31,018 INFO L93 Difference]: Finished difference Result 946 states and 1280 transitions. [2024-10-24 14:49:31,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 14:49:31,019 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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-10-24 14:49:31,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:49:31,022 INFO L225 Difference]: With dead ends: 946 [2024-10-24 14:49:31,022 INFO L226 Difference]: Without dead ends: 496 [2024-10-24 14:49:31,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:49:31,023 INFO L432 NwaCegarLoop]: 542 mSDtfsCounter, 9 mSDsluCounter, 3371 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3913 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 14:49:31,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3913 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 14:49:31,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-10-24 14:49:31,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 488. [2024-10-24 14:49:31,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 465 states have (on average 1.3397849462365592) internal successors, (623), 469 states have internal predecessors, (623), 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-10-24 14:49:31,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 653 transitions. [2024-10-24 14:49:31,040 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 653 transitions. Word has length 70 [2024-10-24 14:49:31,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:49:31,040 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 653 transitions. [2024-10-24 14:49:31,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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-10-24 14:49:31,041 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 653 transitions. [2024-10-24 14:49:31,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-24 14:49:31,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:49:31,041 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:49:31,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 14:49:31,042 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-10-24 14:49:31,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:49:31,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1655686255, now seen corresponding path program 1 times [2024-10-24 14:49:31,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:49:31,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760332841] [2024-10-24 14:49:31,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:49:31,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:49:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:49:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:49:31,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:49:31,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760332841] [2024-10-24 14:49:31,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760332841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:49:31,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:49:31,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 14:49:31,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982380550] [2024-10-24 14:49:31,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:49:31,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 14:49:31,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:49:31,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 14:49:31,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-24 14:49:31,367 INFO L87 Difference]: Start difference. First operand 488 states and 653 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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-10-24 14:49:31,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:49:31,832 INFO L93 Difference]: Finished difference Result 955 states and 1290 transitions. [2024-10-24 14:49:31,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 14:49:31,833 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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-10-24 14:49:31,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:49:31,836 INFO L225 Difference]: With dead ends: 955 [2024-10-24 14:49:31,836 INFO L226 Difference]: Without dead ends: 501 [2024-10-24 14:49:31,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-24 14:49:31,837 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 36 mSDsluCounter, 3878 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 4417 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 14:49:31,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 4417 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 14:49:31,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-10-24 14:49:31,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 491. [2024-10-24 14:49:31,850 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-10-24 14:49:31,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 656 transitions. [2024-10-24 14:49:31,852 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 656 transitions. Word has length 70 [2024-10-24 14:49:31,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:49:31,853 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 656 transitions. [2024-10-24 14:49:31,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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-10-24 14:49:31,853 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 656 transitions. [2024-10-24 14:49:31,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-24 14:49:31,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:49:31,854 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:49:31,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 14:49:31,854 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-10-24 14:49:31,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:49:31,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1604752520, now seen corresponding path program 1 times [2024-10-24 14:49:31,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:49:31,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426438839] [2024-10-24 14:49:31,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:49:31,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:49:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:49:32,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:49:32,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:49:32,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426438839] [2024-10-24 14:49:32,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426438839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:49:32,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:49:32,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 14:49:32,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413412049] [2024-10-24 14:49:32,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:49:32,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 14:49:32,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:49:32,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 14:49:32,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:49:32,366 INFO L87 Difference]: Start difference. First operand 491 states and 656 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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-10-24 14:49:33,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:49:33,101 INFO L93 Difference]: Finished difference Result 954 states and 1286 transitions. [2024-10-24 14:49:33,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 14:49:33,102 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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-10-24 14:49:33,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:49:33,105 INFO L225 Difference]: With dead ends: 954 [2024-10-24 14:49:33,105 INFO L226 Difference]: Without dead ends: 497 [2024-10-24 14:49:33,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-24 14:49:33,108 INFO L432 NwaCegarLoop]: 536 mSDtfsCounter, 33 mSDsluCounter, 3306 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3842 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 14:49:33,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3842 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 14:49:33,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-10-24 14:49:33,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 492. [2024-10-24 14:49:33,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 469 states have (on average 1.3368869936034116) internal successors, (627), 473 states have internal predecessors, (627), 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-10-24 14:49:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 657 transitions. [2024-10-24 14:49:33,125 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 657 transitions. Word has length 70 [2024-10-24 14:49:33,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:49:33,128 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 657 transitions. [2024-10-24 14:49:33,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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-10-24 14:49:33,128 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 657 transitions. [2024-10-24 14:49:33,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-24 14:49:33,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:49:33,129 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:49:33,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 14:49:33,130 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-10-24 14:49:33,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:49:33,130 INFO L85 PathProgramCache]: Analyzing trace with hash -231710400, now seen corresponding path program 1 times [2024-10-24 14:49:33,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:49:33,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087740228] [2024-10-24 14:49:33,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:49:33,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:49:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:49:33,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:49:33,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:49:33,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087740228] [2024-10-24 14:49:33,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087740228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:49:33,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:49:33,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 14:49:33,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996486217] [2024-10-24 14:49:33,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:49:33,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 14:49:33,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:49:33,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 14:49:33,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 14:49:33,370 INFO L87 Difference]: Start difference. First operand 492 states and 657 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-10-24 14:49:33,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:49:33,849 INFO L93 Difference]: Finished difference Result 959 states and 1293 transitions. [2024-10-24 14:49:33,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 14:49:33,849 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-10-24 14:49:33,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:49:33,852 INFO L225 Difference]: With dead ends: 959 [2024-10-24 14:49:33,852 INFO L226 Difference]: Without dead ends: 501 [2024-10-24 14:49:33,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-24 14:49:33,853 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 22 mSDsluCounter, 3329 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3872 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 14:49:33,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3872 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 14:49:33,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-10-24 14:49:33,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 489. [2024-10-24 14:49:33,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 466 states have (on average 1.3390557939914163) internal successors, (624), 470 states have internal predecessors, (624), 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-10-24 14:49:33,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 654 transitions. [2024-10-24 14:49:33,868 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 654 transitions. Word has length 70 [2024-10-24 14:49:33,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:49:33,869 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 654 transitions. [2024-10-24 14:49:33,869 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-10-24 14:49:33,869 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 654 transitions. [2024-10-24 14:49:33,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-24 14:49:33,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:49:33,870 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:49:33,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 14:49:33,870 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-10-24 14:49:33,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:49:33,871 INFO L85 PathProgramCache]: Analyzing trace with hash -834701604, now seen corresponding path program 1 times [2024-10-24 14:49:33,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:49:33,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273937098] [2024-10-24 14:49:33,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:49:33,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:49:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:49:51,935 WARN L286 SmtUtils]: Spent 7.74s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 14:49:55,940 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-10-24 14:49:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:49:55,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:49:55,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273937098] [2024-10-24 14:49:55,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273937098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:49:55,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:49:55,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 14:49:55,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825906614] [2024-10-24 14:49:55,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:49:55,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 14:49:55,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:49:55,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 14:49:55,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2024-10-24 14:49:55,995 INFO L87 Difference]: Start difference. First operand 489 states and 654 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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-10-24 14:50:00,253 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-10-24 14:50:01,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 14:50:05,649 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-10-24 14:50:09,880 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-10-24 14:50:13,884 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-10-24 14:50:16,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 14:50:20,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 14:50:24,637 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-10-24 14:50:28,647 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-10-24 14:50:30,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 14:50:35,700 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-10-24 14:50:39,704 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-10-24 14:50:43,707 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 []