./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 ac848265e1daab3ca0f2905a3d0d6fdafaee38399ca7123ad8517babc999ef80 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:51:25,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:51:26,001 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 20:51:26,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:51:26,007 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:51:26,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:51:26,030 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:51:26,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:51:26,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:51:26,031 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:51:26,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:51:26,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:51:26,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:51:26,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:51:26,033 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:51:26,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:51:26,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:51:26,033 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 20:51:26,033 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:51:26,033 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 20:51:26,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:51:26,034 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:51:26,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:51:26,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:51:26,034 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 20:51:26,034 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:51:26,034 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:51:26,034 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:51:26,034 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:51:26,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:51:26,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:51:26,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:51:26,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:51:26,034 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:51:26,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:51:26,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:51:26,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:51:26,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:51:26,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:51:26,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:51:26,035 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:51:26,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:51:26,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:51:26,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:51:26,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:51:26,035 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:51:26,035 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:51:26,035 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:51:26,035 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> ac848265e1daab3ca0f2905a3d0d6fdafaee38399ca7123ad8517babc999ef80 [2025-01-09 20:51:26,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:51:26,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:51:26,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:51:26,276 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:51:26,276 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:51:26,277 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i [2025-01-09 20:51:27,511 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9635d5fd1/69dc56bd2af946bc8b0ade51a298f259/FLAG70b076851 [2025-01-09 20:51:27,827 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:51:27,827 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i [2025-01-09 20:51:27,838 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9635d5fd1/69dc56bd2af946bc8b0ade51a298f259/FLAG70b076851 [2025-01-09 20:51:27,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9635d5fd1/69dc56bd2af946bc8b0ade51a298f259 [2025-01-09 20:51:27,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:51:27,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:51:27,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:51:27,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:51:27,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:51:27,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:51:27" (1/1) ... [2025-01-09 20:51:27,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2222ce14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:51:27, skipping insertion in model container [2025-01-09 20:51:27,856 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:51:27" (1/1) ... [2025-01-09 20:51:27,884 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:51:28,166 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[44118,44131] [2025-01-09 20:51:28,174 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[44660,44673] [2025-01-09 20:51:28,241 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[56247,56260] [2025-01-09 20:51:28,241 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[56368,56381] [2025-01-09 20:51:28,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:51:28,259 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:51:28,284 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[44118,44131] [2025-01-09 20:51:28,285 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[44660,44673] [2025-01-09 20:51:28,328 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[56247,56260] [2025-01-09 20:51:28,329 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[56368,56381] [2025-01-09 20:51:28,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:51:28,376 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:51:28,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:51:28 WrapperNode [2025-01-09 20:51:28,377 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:51:28,378 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:51:28,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:51:28,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:51:28,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:51:28" (1/1) ... [2025-01-09 20:51:28,403 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:51:28" (1/1) ... [2025-01-09 20:51:28,459 INFO L138 Inliner]: procedures = 282, calls = 296, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1432 [2025-01-09 20:51:28,459 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:51:28,460 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:51:28,460 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:51:28,460 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:51:28,466 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:51:28" (1/1) ... [2025-01-09 20:51:28,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:51:28" (1/1) ... [2025-01-09 20:51:28,477 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:51:28" (1/1) ... [2025-01-09 20:51:28,542 INFO L175 MemorySlicer]: Split 268 memory accesses to 4 slices as follows [2, 34, 12, 220]. 82 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 0, 10, 0]. The 54 writes are split as follows [0, 4, 1, 49]. [2025-01-09 20:51:28,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:51:28" (1/1) ... [2025-01-09 20:51:28,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:51:28" (1/1) ... [2025-01-09 20:51:28,585 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:51:28" (1/1) ... [2025-01-09 20:51:28,588 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:51:28" (1/1) ... [2025-01-09 20:51:28,595 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:51:28" (1/1) ... [2025-01-09 20:51:28,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:51:28" (1/1) ... [2025-01-09 20:51:28,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:51:28" (1/1) ... [2025-01-09 20:51:28,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:51:28,608 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:51:28,609 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:51:28,609 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:51:28,609 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:51:28" (1/1) ... [2025-01-09 20:51:28,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:51:28,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:51:28,646 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 20:51:28,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 20:51:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:51:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:51:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:51:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:51:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 20:51:28,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:51:28,675 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2025-01-09 20:51:28,675 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2025-01-09 20:51:28,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:51:28,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:51:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:51:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 20:51:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 20:51:28,676 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 20:51:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:51:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:51:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:51:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 20:51:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:51:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:51:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2025-01-09 20:51:28,676 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2025-01-09 20:51:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:51:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:51:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:51:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 20:51:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2025-01-09 20:51:28,676 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2025-01-09 20:51:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:51:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:51:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:51:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 20:51:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:51:28,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:51:28,850 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:51:28,851 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:51:29,819 INFO L? ?]: Removed 335 outVars from TransFormulas that were not future-live. [2025-01-09 20:51:29,820 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:51:29,838 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:51:29,838 INFO L312 CfgBuilder]: Removed 31 assume(true) statements. [2025-01-09 20:51:29,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:51:29 BoogieIcfgContainer [2025-01-09 20:51:29,840 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:51:29,842 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:51:29,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:51:29,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:51:29,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:51:27" (1/3) ... [2025-01-09 20:51:29,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b70bb89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:51:29, skipping insertion in model container [2025-01-09 20:51:29,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:51:28" (2/3) ... [2025-01-09 20:51:29,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b70bb89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:51:29, skipping insertion in model container [2025-01-09 20:51:29,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:51:29" (3/3) ... [2025-01-09 20:51:29,847 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test6-1.i [2025-01-09 20:51:29,856 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:51:29,857 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test6-1.i that has 5 procedures, 433 locations, 1 initial locations, 36 loop locations, and 4 error locations. [2025-01-09 20:51:29,904 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:51:29,913 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;@6602d4b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:51:29,914 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 20:51:29,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 433 states, 411 states have (on average 1.5888077858880778) internal successors, (653), 415 states have internal predecessors, (653), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 20:51:29,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 20:51:29,923 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:51:29,923 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:51:29,924 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)] === [2025-01-09 20:51:29,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:51:29,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1883014248, now seen corresponding path program 1 times [2025-01-09 20:51:29,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:51:29,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22445481] [2025-01-09 20:51:29,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:51:29,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:51:29,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 20:51:30,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 20:51:30,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:51:30,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:51:30,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:51:30,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:51:30,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22445481] [2025-01-09 20:51:30,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22445481] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:51:30,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:51:30,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 20:51:30,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969309150] [2025-01-09 20:51:30,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:51:30,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 20:51:30,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:51:30,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 20:51:30,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:51:30,064 INFO L87 Difference]: Start difference. First operand has 433 states, 411 states have (on average 1.5888077858880778) internal successors, (653), 415 states have internal predecessors, (653), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:30,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:51:30,116 INFO L93 Difference]: Finished difference Result 862 states and 1367 transitions. [2025-01-09 20:51:30,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 20:51:30,118 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-09 20:51:30,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:51:30,125 INFO L225 Difference]: With dead ends: 862 [2025-01-09 20:51:30,125 INFO L226 Difference]: Without dead ends: 427 [2025-01-09 20:51:30,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:51:30,132 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:51:30,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:51:30,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-01-09 20:51:30,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2025-01-09 20:51:30,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 406 states have (on average 1.435960591133005) internal successors, (583), 411 states have internal predecessors, (583), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:51:30,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 608 transitions. [2025-01-09 20:51:30,188 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 608 transitions. Word has length 8 [2025-01-09 20:51:30,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:51:30,188 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 608 transitions. [2025-01-09 20:51:30,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:30,188 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 608 transitions. [2025-01-09 20:51:30,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 20:51:30,188 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:51:30,189 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:51:30,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:51:30,189 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)] === [2025-01-09 20:51:30,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:51:30,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1883663023, now seen corresponding path program 1 times [2025-01-09 20:51:30,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:51:30,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617186610] [2025-01-09 20:51:30,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:51:30,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:51:30,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 20:51:30,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 20:51:30,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:51:30,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:51:30,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:51:30,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:51:30,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617186610] [2025-01-09 20:51:30,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617186610] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:51:30,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:51:30,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:51:30,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007411022] [2025-01-09 20:51:30,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:51:30,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:51:30,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:51:30,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:51:30,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:51:30,364 INFO L87 Difference]: Start difference. First operand 427 states and 608 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:30,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:51:30,506 INFO L93 Difference]: Finished difference Result 1038 states and 1489 transitions. [2025-01-09 20:51:30,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:51:30,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-09 20:51:30,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:51:30,510 INFO L225 Difference]: With dead ends: 1038 [2025-01-09 20:51:30,510 INFO L226 Difference]: Without dead ends: 827 [2025-01-09 20:51:30,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:51:30,512 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 556 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:51:30,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1768 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:51:30,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2025-01-09 20:51:30,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 429. [2025-01-09 20:51:30,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 408 states have (on average 1.4338235294117647) internal successors, (585), 413 states have internal predecessors, (585), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:51:30,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 610 transitions. [2025-01-09 20:51:30,545 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 610 transitions. Word has length 10 [2025-01-09 20:51:30,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:51:30,545 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 610 transitions. [2025-01-09 20:51:30,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:30,545 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 610 transitions. [2025-01-09 20:51:30,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 20:51:30,548 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:51:30,548 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:51:30,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:51:30,548 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)] === [2025-01-09 20:51:30,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:51:30,549 INFO L85 PathProgramCache]: Analyzing trace with hash -2022370072, now seen corresponding path program 1 times [2025-01-09 20:51:30,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:51:30,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250863938] [2025-01-09 20:51:30,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:51:30,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:51:30,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 20:51:30,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 20:51:30,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:51:30,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:51:30,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:51:30,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:51:30,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250863938] [2025-01-09 20:51:30,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250863938] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:51:30,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:51:30,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:51:30,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049419921] [2025-01-09 20:51:30,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:51:30,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:51:30,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:51:30,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:51:30,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:51:30,835 INFO L87 Difference]: Start difference. First operand 429 states and 610 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:30,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:51:30,910 INFO L93 Difference]: Finished difference Result 812 states and 1150 transitions. [2025-01-09 20:51:30,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:51:30,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 20:51:30,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:51:30,913 INFO L225 Difference]: With dead ends: 812 [2025-01-09 20:51:30,915 INFO L226 Difference]: Without dead ends: 387 [2025-01-09 20:51:30,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:51:30,916 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 30 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:51:30,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1502 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:51:30,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-01-09 20:51:30,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2025-01-09 20:51:30,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 366 states have (on average 1.3879781420765027) internal successors, (508), 371 states have internal predecessors, (508), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:51:30,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 533 transitions. [2025-01-09 20:51:30,934 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 533 transitions. Word has length 66 [2025-01-09 20:51:30,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:51:30,934 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 533 transitions. [2025-01-09 20:51:30,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:30,934 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 533 transitions. [2025-01-09 20:51:30,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 20:51:30,936 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:51:30,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:51:30,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:51:30,937 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)] === [2025-01-09 20:51:30,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:51:30,937 INFO L85 PathProgramCache]: Analyzing trace with hash 37940060, now seen corresponding path program 1 times [2025-01-09 20:51:30,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:51:30,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897785983] [2025-01-09 20:51:30,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:51:30,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:51:30,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 20:51:31,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 20:51:31,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:51:31,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:51:31,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:51:31,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:51:31,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897785983] [2025-01-09 20:51:31,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897785983] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:51:31,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:51:31,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:51:31,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774541461] [2025-01-09 20:51:31,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:51:31,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:51:31,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:51:31,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:51:31,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:51:31,152 INFO L87 Difference]: Start difference. First operand 387 states and 533 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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) [2025-01-09 20:51:31,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:51:31,197 INFO L93 Difference]: Finished difference Result 770 states and 1062 transitions. [2025-01-09 20:51:31,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:51:31,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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 [2025-01-09 20:51:31,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:51:31,199 INFO L225 Difference]: With dead ends: 770 [2025-01-09 20:51:31,199 INFO L226 Difference]: Without dead ends: 387 [2025-01-09 20:51:31,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:51:31,200 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 0 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:51:31,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1016 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:51:31,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-01-09 20:51:31,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2025-01-09 20:51:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 366 states have (on average 1.3797814207650274) internal successors, (505), 371 states have internal predecessors, (505), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:51:31,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 530 transitions. [2025-01-09 20:51:31,209 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 530 transitions. Word has length 66 [2025-01-09 20:51:31,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:51:31,209 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 530 transitions. [2025-01-09 20:51:31,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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) [2025-01-09 20:51:31,209 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 530 transitions. [2025-01-09 20:51:31,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 20:51:31,210 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:51:31,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:51:31,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:51:31,210 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)] === [2025-01-09 20:51:31,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:51:31,211 INFO L85 PathProgramCache]: Analyzing trace with hash -2013043938, now seen corresponding path program 1 times [2025-01-09 20:51:31,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:51:31,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841001525] [2025-01-09 20:51:31,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:51:31,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:51:31,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 20:51:31,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 20:51:31,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:51:31,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:51:31,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:51:31,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:51:31,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841001525] [2025-01-09 20:51:31,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841001525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:51:31,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:51:31,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:51:31,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961802490] [2025-01-09 20:51:31,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:51:31,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:51:31,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:51:31,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:51:31,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:51:31,536 INFO L87 Difference]: Start difference. First operand 387 states and 530 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) [2025-01-09 20:51:31,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:51:31,804 INFO L93 Difference]: Finished difference Result 775 states and 1064 transitions. [2025-01-09 20:51:31,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:51:31,805 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 [2025-01-09 20:51:31,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:51:31,807 INFO L225 Difference]: With dead ends: 775 [2025-01-09 20:51:31,807 INFO L226 Difference]: Without dead ends: 392 [2025-01-09 20:51:31,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:51:31,810 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 14 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:51:31,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2254 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:51:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-01-09 20:51:31,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 389. [2025-01-09 20:51:31,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 368 states have (on average 1.377717391304348) internal successors, (507), 373 states have internal predecessors, (507), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:51:31,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 532 transitions. [2025-01-09 20:51:31,821 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 532 transitions. Word has length 66 [2025-01-09 20:51:31,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:51:31,822 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 532 transitions. [2025-01-09 20:51:31,822 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) [2025-01-09 20:51:31,822 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 532 transitions. [2025-01-09 20:51:31,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 20:51:31,824 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:51:31,824 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:51:31,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:51:31,824 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)] === [2025-01-09 20:51:31,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:51:31,826 INFO L85 PathProgramCache]: Analyzing trace with hash 589047661, now seen corresponding path program 1 times [2025-01-09 20:51:31,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:51:31,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380855759] [2025-01-09 20:51:31,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:51:31,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:51:31,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 20:51:31,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 20:51:31,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:51:31,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:51:32,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:51:32,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:51:32,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380855759] [2025-01-09 20:51:32,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380855759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:51:32,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:51:32,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:51:32,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413821770] [2025-01-09 20:51:32,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:51:32,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:51:32,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:51:32,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:51:32,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:51:32,064 INFO L87 Difference]: Start difference. First operand 389 states and 532 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) [2025-01-09 20:51:32,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:51:32,328 INFO L93 Difference]: Finished difference Result 779 states and 1068 transitions. [2025-01-09 20:51:32,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:51:32,329 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 [2025-01-09 20:51:32,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:51:32,331 INFO L225 Difference]: With dead ends: 779 [2025-01-09 20:51:32,331 INFO L226 Difference]: Without dead ends: 394 [2025-01-09 20:51:32,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:51:32,332 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 15 mSDsluCounter, 2201 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2705 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:51:32,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2705 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:51:32,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-01-09 20:51:32,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2025-01-09 20:51:32,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 372 states have (on average 1.3763440860215055) internal successors, (512), 377 states have internal predecessors, (512), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:51:32,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 537 transitions. [2025-01-09 20:51:32,345 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 537 transitions. Word has length 67 [2025-01-09 20:51:32,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:51:32,346 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 537 transitions. [2025-01-09 20:51:32,346 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) [2025-01-09 20:51:32,346 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 537 transitions. [2025-01-09 20:51:32,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 20:51:32,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:51:32,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:51:32,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:51:32,348 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)] === [2025-01-09 20:51:32,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:51:32,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1871313919, now seen corresponding path program 1 times [2025-01-09 20:51:32,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:51:32,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120382699] [2025-01-09 20:51:32,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:51:32,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:51:32,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 20:51:32,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 20:51:32,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:51:32,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:51:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:51:32,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:51:32,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120382699] [2025-01-09 20:51:32,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120382699] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:51:32,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:51:32,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:51:32,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990343484] [2025-01-09 20:51:32,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:51:32,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:51:32,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:51:32,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:51:32,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:51:32,577 INFO L87 Difference]: Start difference. First operand 393 states and 537 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:32,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:51:32,662 INFO L93 Difference]: Finished difference Result 782 states and 1070 transitions. [2025-01-09 20:51:32,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:51:32,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 20:51:32,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:51:32,665 INFO L225 Difference]: With dead ends: 782 [2025-01-09 20:51:32,665 INFO L226 Difference]: Without dead ends: 393 [2025-01-09 20:51:32,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:51:32,666 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 17 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:51:32,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1417 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:51:32,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-01-09 20:51:32,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2025-01-09 20:51:32,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 372 states have (on average 1.3736559139784945) internal successors, (511), 377 states have internal predecessors, (511), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:51:32,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 536 transitions. [2025-01-09 20:51:32,676 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 536 transitions. Word has length 67 [2025-01-09 20:51:32,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:51:32,676 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 536 transitions. [2025-01-09 20:51:32,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:32,676 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 536 transitions. [2025-01-09 20:51:32,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 20:51:32,677 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:51:32,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:51:32,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 20:51:32,677 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)] === [2025-01-09 20:51:32,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:51:32,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1502346090, now seen corresponding path program 1 times [2025-01-09 20:51:32,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:51:32,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255207473] [2025-01-09 20:51:32,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:51:32,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:51:32,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 20:51:32,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 20:51:32,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:51:32,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:51:32,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:51:32,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:51:32,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255207473] [2025-01-09 20:51:32,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255207473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:51:32,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:51:32,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:51:32,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461902704] [2025-01-09 20:51:32,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:51:32,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:51:32,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:51:32,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:51:32,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:51:32,974 INFO L87 Difference]: Start difference. First operand 393 states and 536 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) [2025-01-09 20:51:33,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:51:33,335 INFO L93 Difference]: Finished difference Result 795 states and 1089 transitions. [2025-01-09 20:51:33,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:51:33,335 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 [2025-01-09 20:51:33,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:51:33,337 INFO L225 Difference]: With dead ends: 795 [2025-01-09 20:51:33,337 INFO L226 Difference]: Without dead ends: 406 [2025-01-09 20:51:33,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 20:51:33,338 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 33 mSDsluCounter, 3150 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3655 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:51:33,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3655 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:51:33,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-01-09 20:51:33,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 403. [2025-01-09 20:51:33,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 382 states have (on average 1.37434554973822) internal successors, (525), 387 states have internal predecessors, (525), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:51:33,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 550 transitions. [2025-01-09 20:51:33,349 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 550 transitions. Word has length 68 [2025-01-09 20:51:33,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:51:33,349 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 550 transitions. [2025-01-09 20:51:33,349 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) [2025-01-09 20:51:33,349 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 550 transitions. [2025-01-09 20:51:33,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 20:51:33,350 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:51:33,350 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:51:33,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 20:51:33,350 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)] === [2025-01-09 20:51:33,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:51:33,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1179950205, now seen corresponding path program 1 times [2025-01-09 20:51:33,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:51:33,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846807969] [2025-01-09 20:51:33,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:51:33,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:51:33,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 20:51:33,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 20:51:33,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:51:33,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:51:33,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:51:33,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:51:33,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846807969] [2025-01-09 20:51:33,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846807969] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:51:33,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:51:33,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 20:51:33,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638078343] [2025-01-09 20:51:33,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:51:33,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 20:51:33,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:51:33,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 20:51:33,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:51:33,694 INFO L87 Difference]: Start difference. First operand 403 states and 550 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:33,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:51:33,938 INFO L93 Difference]: Finished difference Result 805 states and 1101 transitions. [2025-01-09 20:51:33,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 20:51:33,938 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 20:51:33,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:51:33,940 INFO L225 Difference]: With dead ends: 805 [2025-01-09 20:51:33,940 INFO L226 Difference]: Without dead ends: 406 [2025-01-09 20:51:33,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-09 20:51:33,940 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 27 mSDsluCounter, 2250 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2759 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:51:33,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2759 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:51:33,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-01-09 20:51:33,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2025-01-09 20:51:33,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 385 states have (on average 1.3714285714285714) internal successors, (528), 390 states have internal predecessors, (528), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:51:33,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 553 transitions. [2025-01-09 20:51:33,966 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 553 transitions. Word has length 68 [2025-01-09 20:51:33,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:51:33,967 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 553 transitions. [2025-01-09 20:51:33,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:33,967 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 553 transitions. [2025-01-09 20:51:33,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 20:51:33,968 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:51:33,968 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:51:33,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 20:51:33,968 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)] === [2025-01-09 20:51:33,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:51:33,969 INFO L85 PathProgramCache]: Analyzing trace with hash -18650941, now seen corresponding path program 1 times [2025-01-09 20:51:33,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:51:33,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007552668] [2025-01-09 20:51:33,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:51:33,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:51:33,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 20:51:34,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 20:51:34,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:51:34,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:51:34,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:51:34,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:51:34,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007552668] [2025-01-09 20:51:34,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007552668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:51:34,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:51:34,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:51:34,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716034322] [2025-01-09 20:51:34,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:51:34,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:51:34,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:51:34,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:51:34,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:51:34,131 INFO L87 Difference]: Start difference. First operand 406 states and 553 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:34,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:51:34,348 INFO L93 Difference]: Finished difference Result 811 states and 1107 transitions. [2025-01-09 20:51:34,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:51:34,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 20:51:34,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:51:34,351 INFO L225 Difference]: With dead ends: 811 [2025-01-09 20:51:34,351 INFO L226 Difference]: Without dead ends: 409 [2025-01-09 20:51:34,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:51:34,352 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 8 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2276 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:51:34,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2276 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:51:34,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-01-09 20:51:34,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2025-01-09 20:51:34,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 388 states have (on average 1.3685567010309279) internal successors, (531), 393 states have internal predecessors, (531), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:51:34,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 556 transitions. [2025-01-09 20:51:34,364 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 556 transitions. Word has length 68 [2025-01-09 20:51:34,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:51:34,364 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 556 transitions. [2025-01-09 20:51:34,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:34,364 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 556 transitions. [2025-01-09 20:51:34,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 20:51:34,366 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:51:34,366 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:51:34,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 20:51:34,366 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)] === [2025-01-09 20:51:34,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:51:34,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1894995888, now seen corresponding path program 1 times [2025-01-09 20:51:34,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:51:34,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488746237] [2025-01-09 20:51:34,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:51:34,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:51:34,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 20:51:34,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 20:51:34,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:51:34,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:51:34,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:51:34,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:51:34,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488746237] [2025-01-09 20:51:34,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488746237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:51:34,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:51:34,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:51:34,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903014074] [2025-01-09 20:51:34,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:51:34,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:51:34,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:51:34,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:51:34,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:51:34,769 INFO L87 Difference]: Start difference. First operand 409 states and 556 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:35,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:51:35,413 INFO L93 Difference]: Finished difference Result 1181 states and 1618 transitions. [2025-01-09 20:51:35,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:51:35,413 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 20:51:35,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:51:35,416 INFO L225 Difference]: With dead ends: 1181 [2025-01-09 20:51:35,416 INFO L226 Difference]: Without dead ends: 776 [2025-01-09 20:51:35,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-01-09 20:51:35,418 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 627 mSDsluCounter, 2566 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 3066 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 20:51:35,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 3066 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 20:51:35,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2025-01-09 20:51:35,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 447. [2025-01-09 20:51:35,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 426 states have (on average 1.3380281690140845) internal successors, (570), 431 states have internal predecessors, (570), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:51:35,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 595 transitions. [2025-01-09 20:51:35,429 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 595 transitions. Word has length 69 [2025-01-09 20:51:35,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:51:35,430 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 595 transitions. [2025-01-09 20:51:35,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:35,430 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 595 transitions. [2025-01-09 20:51:35,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 20:51:35,430 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:51:35,430 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:51:35,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 20:51:35,431 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)] === [2025-01-09 20:51:35,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:51:35,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1663240956, now seen corresponding path program 1 times [2025-01-09 20:51:35,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:51:35,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663442284] [2025-01-09 20:51:35,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:51:35,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:51:35,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 20:51:35,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 20:51:35,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:51:35,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:51:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:51:35,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:51:35,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663442284] [2025-01-09 20:51:35,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663442284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:51:35,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:51:35,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:51:35,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287131] [2025-01-09 20:51:35,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:51:35,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:51:35,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:51:35,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:51:35,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:51:35,593 INFO L87 Difference]: Start difference. First operand 447 states and 595 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) [2025-01-09 20:51:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:51:35,868 INFO L93 Difference]: Finished difference Result 857 states and 1155 transitions. [2025-01-09 20:51:35,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:51:35,868 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 [2025-01-09 20:51:35,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:51:35,870 INFO L225 Difference]: With dead ends: 857 [2025-01-09 20:51:35,870 INFO L226 Difference]: Without dead ends: 452 [2025-01-09 20:51:35,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:51:35,871 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 12 mSDsluCounter, 2202 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2712 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:51:35,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2712 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:51:35,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-01-09 20:51:35,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 447. [2025-01-09 20:51:35,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 426 states have (on average 1.3380281690140845) internal successors, (570), 431 states have internal predecessors, (570), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:51:35,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 595 transitions. [2025-01-09 20:51:35,889 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 595 transitions. Word has length 69 [2025-01-09 20:51:35,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:51:35,889 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 595 transitions. [2025-01-09 20:51:35,889 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) [2025-01-09 20:51:35,889 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 595 transitions. [2025-01-09 20:51:35,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 20:51:35,890 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:51:35,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:51:35,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 20:51:35,890 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)] === [2025-01-09 20:51:35,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:51:35,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1736365105, now seen corresponding path program 1 times [2025-01-09 20:51:35,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:51:35,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730391910] [2025-01-09 20:51:35,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:51:35,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:51:35,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 20:51:35,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 20:51:35,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:51:35,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:51:36,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:51:36,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:51:36,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730391910] [2025-01-09 20:51:36,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730391910] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:51:36,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:51:36,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:51:36,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720305496] [2025-01-09 20:51:36,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:51:36,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:51:36,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:51:36,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:51:36,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:51:36,080 INFO L87 Difference]: Start difference. First operand 447 states and 595 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) [2025-01-09 20:51:36,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:51:36,330 INFO L93 Difference]: Finished difference Result 862 states and 1161 transitions. [2025-01-09 20:51:36,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:51:36,330 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 [2025-01-09 20:51:36,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:51:36,332 INFO L225 Difference]: With dead ends: 862 [2025-01-09 20:51:36,332 INFO L226 Difference]: Without dead ends: 457 [2025-01-09 20:51:36,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:51:36,333 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 20 mSDsluCounter, 3154 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3658 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:51:36,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3658 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:51:36,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-01-09 20:51:36,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 450. [2025-01-09 20:51:36,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 429 states have (on average 1.337995337995338) internal successors, (574), 434 states have internal predecessors, (574), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:51:36,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 599 transitions. [2025-01-09 20:51:36,344 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 599 transitions. Word has length 70 [2025-01-09 20:51:36,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:51:36,344 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 599 transitions. [2025-01-09 20:51:36,344 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) [2025-01-09 20:51:36,344 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 599 transitions. [2025-01-09 20:51:36,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 20:51:36,345 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:51:36,345 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:51:36,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 20:51:36,345 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)] === [2025-01-09 20:51:36,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:51:36,346 INFO L85 PathProgramCache]: Analyzing trace with hash 400875699, now seen corresponding path program 1 times [2025-01-09 20:51:36,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:51:36,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139793201] [2025-01-09 20:51:36,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:51:36,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:51:36,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 20:51:36,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 20:51:36,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:51:36,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:51:36,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:51:36,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:51:36,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139793201] [2025-01-09 20:51:36,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139793201] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:51:36,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:51:36,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:51:36,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706077898] [2025-01-09 20:51:36,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:51:36,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:51:36,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:51:36,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:51:36,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:51:36,566 INFO L87 Difference]: Start difference. First operand 450 states and 599 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) [2025-01-09 20:51:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:51:36,914 INFO L93 Difference]: Finished difference Result 872 states and 1173 transitions. [2025-01-09 20:51:36,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:51:36,915 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 [2025-01-09 20:51:36,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:51:36,916 INFO L225 Difference]: With dead ends: 872 [2025-01-09 20:51:36,916 INFO L226 Difference]: Without dead ends: 464 [2025-01-09 20:51:36,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 20:51:36,917 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 37 mSDsluCounter, 3098 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3611 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:51:36,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3611 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:51:36,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-01-09 20:51:36,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 450. [2025-01-09 20:51:36,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 429 states have (on average 1.337995337995338) internal successors, (574), 434 states have internal predecessors, (574), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:51:36,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 599 transitions. [2025-01-09 20:51:36,927 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 599 transitions. Word has length 70 [2025-01-09 20:51:36,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:51:36,928 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 599 transitions. [2025-01-09 20:51:36,928 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) [2025-01-09 20:51:36,928 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 599 transitions. [2025-01-09 20:51:36,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 20:51:36,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:51:36,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:51:36,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 20:51:36,929 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)] === [2025-01-09 20:51:36,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:51:36,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1971307340, now seen corresponding path program 1 times [2025-01-09 20:51:36,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:51:36,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95332588] [2025-01-09 20:51:36,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:51:36,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:51:36,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 20:51:36,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 20:51:36,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:51:36,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:51:37,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:51:37,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:51:37,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95332588] [2025-01-09 20:51:37,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95332588] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:51:37,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:51:37,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 20:51:37,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708673465] [2025-01-09 20:51:37,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:51:37,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:51:37,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:51:37,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:51:37,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:51:37,147 INFO L87 Difference]: Start difference. First operand 450 states and 599 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:37,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:51:37,486 INFO L93 Difference]: Finished difference Result 874 states and 1178 transitions. [2025-01-09 20:51:37,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:51:37,487 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-01-09 20:51:37,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:51:37,489 INFO L225 Difference]: With dead ends: 874 [2025-01-09 20:51:37,489 INFO L226 Difference]: Without dead ends: 466 [2025-01-09 20:51:37,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 20:51:37,490 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 23 mSDsluCounter, 3164 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3675 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:51:37,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3675 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:51:37,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-01-09 20:51:37,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 460. [2025-01-09 20:51:37,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 439 states have (on average 1.3348519362186788) internal successors, (586), 444 states have internal predecessors, (586), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:51:37,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 611 transitions. [2025-01-09 20:51:37,500 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 611 transitions. Word has length 71 [2025-01-09 20:51:37,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:51:37,500 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 611 transitions. [2025-01-09 20:51:37,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:37,500 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 611 transitions. [2025-01-09 20:51:37,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 20:51:37,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:51:37,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:51:37,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 20:51:37,501 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)] === [2025-01-09 20:51:37,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:51:37,501 INFO L85 PathProgramCache]: Analyzing trace with hash -141351856, now seen corresponding path program 1 times [2025-01-09 20:51:37,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:51:37,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279697848] [2025-01-09 20:51:37,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:51:37,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:51:37,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 20:51:37,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 20:51:37,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:51:37,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:51:37,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:51:37,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:51:37,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279697848] [2025-01-09 20:51:37,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279697848] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:51:37,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:51:37,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 20:51:37,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143360493] [2025-01-09 20:51:37,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:51:37,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:51:37,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:51:37,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:51:37,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:51:37,725 INFO L87 Difference]: Start difference. First operand 460 states and 611 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:38,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:51:38,068 INFO L93 Difference]: Finished difference Result 894 states and 1202 transitions. [2025-01-09 20:51:38,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:51:38,069 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-01-09 20:51:38,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:51:38,071 INFO L225 Difference]: With dead ends: 894 [2025-01-09 20:51:38,071 INFO L226 Difference]: Without dead ends: 476 [2025-01-09 20:51:38,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:51:38,072 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 17 mSDsluCounter, 3573 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4070 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:51:38,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4070 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:51:38,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-01-09 20:51:38,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 463. [2025-01-09 20:51:38,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 442 states have (on average 1.334841628959276) internal successors, (590), 447 states have internal predecessors, (590), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:51:38,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 615 transitions. [2025-01-09 20:51:38,082 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 615 transitions. Word has length 71 [2025-01-09 20:51:38,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:51:38,082 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 615 transitions. [2025-01-09 20:51:38,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:38,082 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 615 transitions. [2025-01-09 20:51:38,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 20:51:38,083 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:51:38,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:51:38,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 20:51:38,083 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)] === [2025-01-09 20:51:38,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:51:38,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1639404592, now seen corresponding path program 1 times [2025-01-09 20:51:38,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:51:38,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202559379] [2025-01-09 20:51:38,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:51:38,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:51:38,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 20:51:38,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 20:51:38,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:51:38,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:51:38,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:51:38,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:51:38,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202559379] [2025-01-09 20:51:38,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202559379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:51:38,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:51:38,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:51:38,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028952955] [2025-01-09 20:51:38,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:51:38,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:51:38,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:51:38,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:51:38,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:51:38,255 INFO L87 Difference]: Start difference. First operand 463 states and 615 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:38,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:51:38,486 INFO L93 Difference]: Finished difference Result 889 states and 1192 transitions. [2025-01-09 20:51:38,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:51:38,486 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-01-09 20:51:38,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:51:38,488 INFO L225 Difference]: With dead ends: 889 [2025-01-09 20:51:38,488 INFO L226 Difference]: Without dead ends: 468 [2025-01-09 20:51:38,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:51:38,489 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 11 mSDsluCounter, 2230 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2735 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:51:38,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2735 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:51:38,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-01-09 20:51:38,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 463. [2025-01-09 20:51:38,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 442 states have (on average 1.332579185520362) internal successors, (589), 447 states have internal predecessors, (589), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:51:38,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 614 transitions. [2025-01-09 20:51:38,501 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 614 transitions. Word has length 71 [2025-01-09 20:51:38,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:51:38,501 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 614 transitions. [2025-01-09 20:51:38,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:38,501 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 614 transitions. [2025-01-09 20:51:38,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 20:51:38,502 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:51:38,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:51:38,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 20:51:38,502 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)] === [2025-01-09 20:51:38,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:51:38,503 INFO L85 PathProgramCache]: Analyzing trace with hash -26733591, now seen corresponding path program 1 times [2025-01-09 20:51:38,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:51:38,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772317453] [2025-01-09 20:51:38,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:51:38,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:51:38,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 20:51:38,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 20:51:38,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:51:38,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:51:38,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:51:38,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:51:38,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772317453] [2025-01-09 20:51:38,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772317453] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:51:38,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:51:38,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:51:38,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642414115] [2025-01-09 20:51:38,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:51:38,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:51:38,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:51:38,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:51:38,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:51:38,671 INFO L87 Difference]: Start difference. First operand 463 states and 614 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:38,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:51:38,907 INFO L93 Difference]: Finished difference Result 887 states and 1190 transitions. [2025-01-09 20:51:38,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:51:38,907 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-01-09 20:51:38,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:51:38,909 INFO L225 Difference]: With dead ends: 887 [2025-01-09 20:51:38,909 INFO L226 Difference]: Without dead ends: 466 [2025-01-09 20:51:38,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:51:38,910 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 8 mSDsluCounter, 2185 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2694 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:51:38,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2694 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:51:38,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-01-09 20:51:38,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2025-01-09 20:51:38,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 445 states have (on average 1.3303370786516855) internal successors, (592), 450 states have internal predecessors, (592), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:51:38,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 617 transitions. [2025-01-09 20:51:38,920 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 617 transitions. Word has length 71 [2025-01-09 20:51:38,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:51:38,920 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 617 transitions. [2025-01-09 20:51:38,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:38,920 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 617 transitions. [2025-01-09 20:51:38,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 20:51:38,921 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:51:38,921 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:51:38,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 20:51:38,921 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)] === [2025-01-09 20:51:38,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:51:38,921 INFO L85 PathProgramCache]: Analyzing trace with hash 535414226, now seen corresponding path program 1 times [2025-01-09 20:51:38,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:51:38,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106287798] [2025-01-09 20:51:38,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:51:38,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:51:38,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 20:51:38,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 20:51:38,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:51:38,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:51:39,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:51:39,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:51:39,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106287798] [2025-01-09 20:51:39,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106287798] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:51:39,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:51:39,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 20:51:39,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037592934] [2025-01-09 20:51:39,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:51:39,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:51:39,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:51:39,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:51:39,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:51:39,181 INFO L87 Difference]: Start difference. First operand 466 states and 617 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:43,362 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 [] [2025-01-09 20:51:43,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:51:43,588 INFO L93 Difference]: Finished difference Result 902 states and 1209 transitions. [2025-01-09 20:51:43,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:51:43,589 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-01-09 20:51:43,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:51:43,591 INFO L225 Difference]: With dead ends: 902 [2025-01-09 20:51:43,591 INFO L226 Difference]: Without dead ends: 478 [2025-01-09 20:51:43,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:51:43,592 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 13 mSDsluCounter, 3546 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4054 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:51:43,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4054 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 734 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-01-09 20:51:43,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-01-09 20:51:43,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 470. [2025-01-09 20:51:43,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 449 states have (on average 1.329621380846325) internal successors, (597), 454 states have internal predecessors, (597), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:51:43,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 622 transitions. [2025-01-09 20:51:43,604 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 622 transitions. Word has length 72 [2025-01-09 20:51:43,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:51:43,604 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 622 transitions. [2025-01-09 20:51:43,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:43,604 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 622 transitions. [2025-01-09 20:51:43,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 20:51:43,605 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:51:43,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:51:43,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 20:51:43,606 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)] === [2025-01-09 20:51:43,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:51:43,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1830979393, now seen corresponding path program 1 times [2025-01-09 20:51:43,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:51:43,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639346267] [2025-01-09 20:51:43,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:51:43,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:51:43,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 20:51:43,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 20:51:43,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:51:43,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:51:43,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:51:43,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:51:43,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639346267] [2025-01-09 20:51:43,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639346267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:51:43,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:51:43,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 20:51:43,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010679762] [2025-01-09 20:51:43,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:51:43,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 20:51:43,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:51:43,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 20:51:43,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 20:51:43,818 INFO L87 Difference]: Start difference. First operand 470 states and 622 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:44,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:51:44,192 INFO L93 Difference]: Finished difference Result 911 states and 1219 transitions. [2025-01-09 20:51:44,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:51:44,192 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-01-09 20:51:44,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:51:44,194 INFO L225 Difference]: With dead ends: 911 [2025-01-09 20:51:44,194 INFO L226 Difference]: Without dead ends: 483 [2025-01-09 20:51:44,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 20:51:44,197 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 26 mSDsluCounter, 4064 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 4569 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:51:44,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 4569 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 20:51:44,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-01-09 20:51:44,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 473. [2025-01-09 20:51:44,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 452 states have (on average 1.3274336283185841) internal successors, (600), 457 states have internal predecessors, (600), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:51:44,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 625 transitions. [2025-01-09 20:51:44,210 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 625 transitions. Word has length 72 [2025-01-09 20:51:44,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:51:44,211 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 625 transitions. [2025-01-09 20:51:44,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:44,211 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 625 transitions. [2025-01-09 20:51:44,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 20:51:44,212 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:51:44,213 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:51:44,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 20:51:44,214 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)] === [2025-01-09 20:51:44,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:51:44,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1429459382, now seen corresponding path program 1 times [2025-01-09 20:51:44,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:51:44,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453536336] [2025-01-09 20:51:44,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:51:44,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:51:44,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 20:51:44,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 20:51:44,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:51:44,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:51:44,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:51:44,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:51:44,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453536336] [2025-01-09 20:51:44,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453536336] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:51:44,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:51:44,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 20:51:44,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061895157] [2025-01-09 20:51:44,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:51:44,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:51:44,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:51:44,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:51:44,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:51:44,571 INFO L87 Difference]: Start difference. First operand 473 states and 625 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:46,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 20:51:47,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:51:47,317 INFO L93 Difference]: Finished difference Result 914 states and 1219 transitions. [2025-01-09 20:51:47,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:51:47,318 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-01-09 20:51:47,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:51:47,321 INFO L225 Difference]: With dead ends: 914 [2025-01-09 20:51:47,321 INFO L226 Difference]: Without dead ends: 483 [2025-01-09 20:51:47,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-09 20:51:47,322 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 44 mSDsluCounter, 3515 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 4021 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 20:51:47,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 4021 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 20:51:47,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-01-09 20:51:47,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 474. [2025-01-09 20:51:47,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 453 states have (on average 1.3267108167770418) internal successors, (601), 458 states have internal predecessors, (601), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:51:47,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 626 transitions. [2025-01-09 20:51:47,333 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 626 transitions. Word has length 72 [2025-01-09 20:51:47,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:51:47,334 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 626 transitions. [2025-01-09 20:51:47,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:47,334 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 626 transitions. [2025-01-09 20:51:47,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 20:51:47,334 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:51:47,334 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:51:47,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 20:51:47,335 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)] === [2025-01-09 20:51:47,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:51:47,335 INFO L85 PathProgramCache]: Analyzing trace with hash -407003538, now seen corresponding path program 1 times [2025-01-09 20:51:47,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:51:47,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812158330] [2025-01-09 20:51:47,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:51:47,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:51:47,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 20:51:47,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 20:51:47,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:51:47,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:51:47,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:51:47,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:51:47,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812158330] [2025-01-09 20:51:47,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812158330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:51:47,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:51:47,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:51:47,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214610587] [2025-01-09 20:51:47,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:51:47,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:51:47,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:51:47,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:51:47,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:51:47,485 INFO L87 Difference]: Start difference. First operand 474 states and 626 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:47,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:51:47,884 INFO L93 Difference]: Finished difference Result 919 states and 1226 transitions. [2025-01-09 20:51:47,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:51:47,886 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-01-09 20:51:47,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:51:47,888 INFO L225 Difference]: With dead ends: 919 [2025-01-09 20:51:47,888 INFO L226 Difference]: Without dead ends: 487 [2025-01-09 20:51:47,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 20:51:47,889 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 33 mSDsluCounter, 3098 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3611 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:51:47,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3611 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 20:51:47,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-01-09 20:51:47,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 471. [2025-01-09 20:51:47,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 450 states have (on average 1.3288888888888888) internal successors, (598), 455 states have internal predecessors, (598), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:51:47,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 623 transitions. [2025-01-09 20:51:47,899 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 623 transitions. Word has length 72 [2025-01-09 20:51:47,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:51:47,899 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 623 transitions. [2025-01-09 20:51:47,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:51:47,899 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 623 transitions. [2025-01-09 20:51:47,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 20:51:47,900 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:51:47,900 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:51:47,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 20:51:47,900 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)] === [2025-01-09 20:51:47,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:51:47,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1009994742, now seen corresponding path program 1 times [2025-01-09 20:51:47,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:51:47,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402596814] [2025-01-09 20:51:47,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:51:47,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:51:47,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 20:51:47,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 20:51:47,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:51:47,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:52:06,127 WARN L286 SmtUtils]: Spent 5.41s 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) [2025-01-09 20:52:34,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:52:34,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:52:34,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402596814] [2025-01-09 20:52:34,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402596814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:52:34,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:52:34,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 20:52:34,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663916748] [2025-01-09 20:52:34,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:52:34,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 20:52:34,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:52:34,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 20:52:34,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=83, Unknown=5, NotChecked=0, Total=110 [2025-01-09 20:52:34,840 INFO L87 Difference]: Start difference. First operand 471 states and 623 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:52:38,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 20:52:42,770 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 [] [2025-01-09 20:52:46,775 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 [] [2025-01-09 20:52:50,782 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 [] [2025-01-09 20:52:53,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 20:52:57,328 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 [] [2025-01-09 20:53:01,887 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 [] [2025-01-09 20:53:06,348 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 []