./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.14.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/combinations/Problem05_label49+token_ring.14.cil.c -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 38a1f42f3cb7a9f66fd0bd1b473ab60f2efbe0fc9c998d9f18da86c331297566 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:20:06,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:20:06,447 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:20:06,456 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:20:06,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:20:06,488 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:20:06,490 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:20:06,490 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:20:06,490 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:20:06,491 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:20:06,491 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:20:06,491 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:20:06,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:20:06,492 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:20:06,492 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:20:06,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:20:06,493 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:20:06,493 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:20:06,493 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:20:06,493 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:20:06,493 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:20:06,494 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:20:06,494 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:20:06,494 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:20:06,494 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:20:06,494 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:20:06,494 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:20:06,494 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:20:06,494 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:20:06,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:20:06,495 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:20:06,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:20:06,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:20:06,495 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:20:06,495 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:20:06,495 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:20:06,495 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:20:06,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:20:06,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:20:06,495 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:20:06,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:20:06,495 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:20:06,495 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:20:06,495 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 -> 38a1f42f3cb7a9f66fd0bd1b473ab60f2efbe0fc9c998d9f18da86c331297566 [2025-02-05 17:20:06,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:20:06,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:20:06,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:20:06,810 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:20:06,811 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:20:06,812 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.14.cil.c [2025-02-05 17:20:08,129 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/daff2a5b1/1a17c1c6c573408394e870f494096719/FLAGd2de1f1cf [2025-02-05 17:20:08,934 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:20:08,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.14.cil.c [2025-02-05 17:20:09,007 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/daff2a5b1/1a17c1c6c573408394e870f494096719/FLAGd2de1f1cf [2025-02-05 17:20:09,030 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/daff2a5b1/1a17c1c6c573408394e870f494096719 [2025-02-05 17:20:09,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:20:09,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:20:09,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:20:09,038 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:20:09,042 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:20:09,044 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:20:09" (1/1) ... [2025-02-05 17:20:09,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56dc9a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:20:09, skipping insertion in model container [2025-02-05 17:20:09,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:20:09" (1/1) ... [2025-02-05 17:20:09,225 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:20:10,688 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/combinations/Problem05_label49+token_ring.14.cil.c[380593,380606] [2025-02-05 17:20:10,732 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/combinations/Problem05_label49+token_ring.14.cil.c[383339,383352] [2025-02-05 17:20:11,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:20:11,058 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:20:11,798 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/combinations/Problem05_label49+token_ring.14.cil.c[380593,380606] [2025-02-05 17:20:11,803 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/combinations/Problem05_label49+token_ring.14.cil.c[383339,383352] [2025-02-05 17:20:11,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:20:11,884 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:20:11,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:20:11 WrapperNode [2025-02-05 17:20:11,885 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:20:11,886 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:20:11,886 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:20:11,886 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:20:11,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:20:11" (1/1) ... [2025-02-05 17:20:11,970 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:20:11" (1/1) ... [2025-02-05 17:20:12,415 INFO L138 Inliner]: procedures = 68, calls = 78, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 13189 [2025-02-05 17:20:12,415 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:20:12,417 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:20:12,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:20:12,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:20:12,426 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:20:11" (1/1) ... [2025-02-05 17:20:12,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:20:11" (1/1) ... [2025-02-05 17:20:12,493 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:20:11" (1/1) ... [2025-02-05 17:20:12,602 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 17:20:12,603 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:20:11" (1/1) ... [2025-02-05 17:20:12,603 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:20:11" (1/1) ... [2025-02-05 17:20:12,914 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:20:11" (1/1) ... [2025-02-05 17:20:12,954 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:20:11" (1/1) ... [2025-02-05 17:20:13,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:20:11" (1/1) ... [2025-02-05 17:20:13,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:20:11" (1/1) ... [2025-02-05 17:20:13,166 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:20:13,168 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:20:13,169 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:20:13,169 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:20:13,170 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:20:11" (1/1) ... [2025-02-05 17:20:13,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:20:13,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:20:13,203 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-02-05 17:20:13,212 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-02-05 17:20:13,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:20:13,232 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:20:13,232 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:20:13,232 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:20:13,232 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:20:13,233 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:20:13,233 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:20:13,233 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-02-05 17:20:13,233 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-02-05 17:20:13,233 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:20:13,233 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:20:13,233 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:20:13,234 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:20:13,234 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:20:13,234 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:20:13,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:20:13,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:20:13,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:20:13,388 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:20:13,390 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:20:21,473 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:20:21,474 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:20:21,474 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:20:21,474 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:20:21,475 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:20:21,475 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:20:21,475 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:20:21,834 INFO L? ?]: Removed 1759 outVars from TransFormulas that were not future-live. [2025-02-05 17:20:21,834 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:20:21,905 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:20:21,906 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:20:21,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:20:21 BoogieIcfgContainer [2025-02-05 17:20:21,906 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:20:21,909 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:20:21,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:20:21,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:20:21,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:20:09" (1/3) ... [2025-02-05 17:20:21,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37af8d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:20:21, skipping insertion in model container [2025-02-05 17:20:21,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:20:11" (2/3) ... [2025-02-05 17:20:21,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37af8d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:20:21, skipping insertion in model container [2025-02-05 17:20:21,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:20:21" (3/3) ... [2025-02-05 17:20:21,917 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.14.cil.c [2025-02-05 17:20:21,931 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:20:21,935 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label49+token_ring.14.cil.c that has 8 procedures, 2597 locations, 1 initial locations, 16 loop locations, and 2 error locations. [2025-02-05 17:20:22,056 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:20:22,068 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;@713b8c25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:20:22,069 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:20:22,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 2597 states, 2559 states have (on average 1.8284486127393513) internal successors, (4679), 2564 states have internal predecessors, (4679), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-05 17:20:22,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:20:22,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:20:22,101 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:20:22,102 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:20:22,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:20:22,109 INFO L85 PathProgramCache]: Analyzing trace with hash 505805513, now seen corresponding path program 1 times [2025-02-05 17:20:22,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:20:22,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693500438] [2025-02-05 17:20:22,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:20:22,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:20:22,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:20:22,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:20:22,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:20:22,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:20:22,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:20:22,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:20:22,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693500438] [2025-02-05 17:20:22,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693500438] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:20:22,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:20:22,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:20:22,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794281010] [2025-02-05 17:20:22,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:20:22,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:20:22,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:20:22,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:20:22,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:20:22,958 INFO L87 Difference]: Start difference. First operand has 2597 states, 2559 states have (on average 1.8284486127393513) internal successors, (4679), 2564 states have internal predecessors, (4679), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:23,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:20:23,976 INFO L93 Difference]: Finished difference Result 5612 states and 10147 transitions. [2025-02-05 17:20:23,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:20:23,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-02-05 17:20:23,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:20:24,014 INFO L225 Difference]: With dead ends: 5612 [2025-02-05 17:20:24,015 INFO L226 Difference]: Without dead ends: 2965 [2025-02-05 17:20:24,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:20:24,034 INFO L435 NwaCegarLoop]: 4523 mSDtfsCounter, 5212 mSDsluCounter, 9336 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5232 SdHoareTripleChecker+Valid, 13859 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:20:24,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5232 Valid, 13859 Invalid, 697 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:20:24,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2025-02-05 17:20:24,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2934. [2025-02-05 17:20:24,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2934 states, 2870 states have (on average 1.7843205574912893) internal successors, (5121), 2874 states have internal predecessors, (5121), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (48), 47 states have call predecessors, (48), 47 states have call successors, (48) [2025-02-05 17:20:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 5218 transitions. [2025-02-05 17:20:24,238 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 5218 transitions. Word has length 179 [2025-02-05 17:20:24,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:20:24,240 INFO L471 AbstractCegarLoop]: Abstraction has 2934 states and 5218 transitions. [2025-02-05 17:20:24,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:24,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 5218 transitions. [2025-02-05 17:20:24,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:20:24,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:20:24,247 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:20:24,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:20:24,248 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:20:24,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:20:24,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1960419271, now seen corresponding path program 1 times [2025-02-05 17:20:24,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:20:24,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867593041] [2025-02-05 17:20:24,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:20:24,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:20:24,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:20:24,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:20:24,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:20:24,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:20:24,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:20:24,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:20:24,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867593041] [2025-02-05 17:20:24,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867593041] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:20:24,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:20:24,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:20:24,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107593709] [2025-02-05 17:20:24,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:20:24,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:20:24,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:20:24,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:20:24,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:20:24,543 INFO L87 Difference]: Start difference. First operand 2934 states and 5218 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:25,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:20:25,017 INFO L93 Difference]: Finished difference Result 3805 states and 6597 transitions. [2025-02-05 17:20:25,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:20:25,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-02-05 17:20:25,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:20:25,035 INFO L225 Difference]: With dead ends: 3805 [2025-02-05 17:20:25,035 INFO L226 Difference]: Without dead ends: 3012 [2025-02-05 17:20:25,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:20:25,041 INFO L435 NwaCegarLoop]: 4442 mSDtfsCounter, 4806 mSDsluCounter, 8725 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4826 SdHoareTripleChecker+Valid, 13167 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:20:25,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4826 Valid, 13167 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:20:25,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3012 states. [2025-02-05 17:20:25,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3012 to 2934. [2025-02-05 17:20:25,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2934 states, 2870 states have (on average 1.7836236933797909) internal successors, (5119), 2874 states have internal predecessors, (5119), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (48), 47 states have call predecessors, (48), 47 states have call successors, (48) [2025-02-05 17:20:25,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 5216 transitions. [2025-02-05 17:20:25,144 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 5216 transitions. Word has length 179 [2025-02-05 17:20:25,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:20:25,144 INFO L471 AbstractCegarLoop]: Abstraction has 2934 states and 5216 transitions. [2025-02-05 17:20:25,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:25,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 5216 transitions. [2025-02-05 17:20:25,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:20:25,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:20:25,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:20:25,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:20:25,210 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:20:25,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:20:25,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1075683464, now seen corresponding path program 1 times [2025-02-05 17:20:25,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:20:25,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420529470] [2025-02-05 17:20:25,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:20:25,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:20:25,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:20:25,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:20:25,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:20:25,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:20:25,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:20:25,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:20:25,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420529470] [2025-02-05 17:20:25,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420529470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:20:25,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:20:25,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:20:25,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143882261] [2025-02-05 17:20:25,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:20:25,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:20:25,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:20:25,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:20:25,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:20:25,492 INFO L87 Difference]: Start difference. First operand 2934 states and 5216 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:26,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:20:26,437 INFO L93 Difference]: Finished difference Result 4235 states and 7264 transitions. [2025-02-05 17:20:26,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:20:26,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-02-05 17:20:26,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:20:26,462 INFO L225 Difference]: With dead ends: 4235 [2025-02-05 17:20:26,463 INFO L226 Difference]: Without dead ends: 3442 [2025-02-05 17:20:26,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:20:26,470 INFO L435 NwaCegarLoop]: 4536 mSDtfsCounter, 5176 mSDsluCounter, 13787 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5196 SdHoareTripleChecker+Valid, 18323 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:20:26,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5196 Valid, 18323 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:20:26,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2025-02-05 17:20:26,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3311. [2025-02-05 17:20:26,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3311 states, 3219 states have (on average 1.7552034793414104) internal successors, (5650), 3224 states have internal predecessors, (5650), 70 states have call successors, (70), 19 states have call predecessors, (70), 20 states have return successors, (72), 69 states have call predecessors, (72), 68 states have call successors, (72) [2025-02-05 17:20:26,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3311 states to 3311 states and 5792 transitions. [2025-02-05 17:20:26,595 INFO L78 Accepts]: Start accepts. Automaton has 3311 states and 5792 transitions. Word has length 179 [2025-02-05 17:20:26,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:20:26,596 INFO L471 AbstractCegarLoop]: Abstraction has 3311 states and 5792 transitions. [2025-02-05 17:20:26,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:26,597 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 5792 transitions. [2025-02-05 17:20:26,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:20:26,599 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:20:26,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:20:26,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:20:26,600 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:20:26,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:20:26,600 INFO L85 PathProgramCache]: Analyzing trace with hash 770048935, now seen corresponding path program 1 times [2025-02-05 17:20:26,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:20:26,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673279839] [2025-02-05 17:20:26,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:20:26,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:20:26,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:20:26,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:20:26,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:20:26,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:20:26,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:20:26,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:20:26,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673279839] [2025-02-05 17:20:26,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673279839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:20:26,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:20:26,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:20:26,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541066428] [2025-02-05 17:20:26,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:20:26,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:20:26,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:20:26,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:20:26,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:20:26,834 INFO L87 Difference]: Start difference. First operand 3311 states and 5792 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:28,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:20:28,005 INFO L93 Difference]: Finished difference Result 5433 states and 9125 transitions. [2025-02-05 17:20:28,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:20:28,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-02-05 17:20:28,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:20:28,028 INFO L225 Difference]: With dead ends: 5433 [2025-02-05 17:20:28,029 INFO L226 Difference]: Without dead ends: 4263 [2025-02-05 17:20:28,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:20:28,037 INFO L435 NwaCegarLoop]: 4794 mSDtfsCounter, 5141 mSDsluCounter, 14460 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5161 SdHoareTripleChecker+Valid, 19254 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 17:20:28,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5161 Valid, 19254 Invalid, 1131 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 17:20:28,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4263 states. [2025-02-05 17:20:28,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4263 to 4112. [2025-02-05 17:20:28,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4112 states, 3962 states have (on average 1.716052498738011) internal successors, (6799), 3971 states have internal predecessors, (6799), 112 states have call successors, (112), 31 states have call predecessors, (112), 36 states have return successors, (126), 113 states have call predecessors, (126), 110 states have call successors, (126) [2025-02-05 17:20:28,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4112 states to 4112 states and 7037 transitions. [2025-02-05 17:20:28,182 INFO L78 Accepts]: Start accepts. Automaton has 4112 states and 7037 transitions. Word has length 179 [2025-02-05 17:20:28,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:20:28,183 INFO L471 AbstractCegarLoop]: Abstraction has 4112 states and 7037 transitions. [2025-02-05 17:20:28,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:28,183 INFO L276 IsEmpty]: Start isEmpty. Operand 4112 states and 7037 transitions. [2025-02-05 17:20:28,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:20:28,191 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:20:28,191 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:20:28,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:20:28,191 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:20:28,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:20:28,192 INFO L85 PathProgramCache]: Analyzing trace with hash 67453096, now seen corresponding path program 1 times [2025-02-05 17:20:28,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:20:28,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453677916] [2025-02-05 17:20:28,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:20:28,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:20:28,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:20:28,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:20:28,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:20:28,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:20:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:20:28,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:20:28,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453677916] [2025-02-05 17:20:28,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453677916] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:20:28,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:20:28,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:20:28,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191618796] [2025-02-05 17:20:28,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:20:28,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:20:28,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:20:28,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:20:28,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:20:28,391 INFO L87 Difference]: Start difference. First operand 4112 states and 7037 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:29,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:20:29,368 INFO L93 Difference]: Finished difference Result 8012 states and 13216 transitions. [2025-02-05 17:20:29,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:20:29,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-02-05 17:20:29,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:20:29,399 INFO L225 Difference]: With dead ends: 8012 [2025-02-05 17:20:29,399 INFO L226 Difference]: Without dead ends: 6041 [2025-02-05 17:20:29,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:20:29,407 INFO L435 NwaCegarLoop]: 4791 mSDtfsCounter, 5136 mSDsluCounter, 14451 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5156 SdHoareTripleChecker+Valid, 19242 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:20:29,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5156 Valid, 19242 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:20:29,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2025-02-05 17:20:29,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 5849. [2025-02-05 17:20:29,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5849 states, 5577 states have (on average 1.675990675990676) internal successors, (9347), 5600 states have internal predecessors, (9347), 196 states have call successors, (196), 55 states have call predecessors, (196), 74 states have return successors, (258), 201 states have call predecessors, (258), 194 states have call successors, (258) [2025-02-05 17:20:29,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5849 states to 5849 states and 9801 transitions. [2025-02-05 17:20:29,656 INFO L78 Accepts]: Start accepts. Automaton has 5849 states and 9801 transitions. Word has length 179 [2025-02-05 17:20:29,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:20:29,657 INFO L471 AbstractCegarLoop]: Abstraction has 5849 states and 9801 transitions. [2025-02-05 17:20:29,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:29,658 INFO L276 IsEmpty]: Start isEmpty. Operand 5849 states and 9801 transitions. [2025-02-05 17:20:29,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:20:29,662 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:20:29,663 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:20:29,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:20:29,663 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:20:29,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:20:29,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1014620039, now seen corresponding path program 1 times [2025-02-05 17:20:29,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:20:29,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732516269] [2025-02-05 17:20:29,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:20:29,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:20:29,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:20:29,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:20:29,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:20:29,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:20:29,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:20:29,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:20:29,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732516269] [2025-02-05 17:20:29,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732516269] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:20:29,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:20:29,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:20:29,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530267059] [2025-02-05 17:20:29,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:20:29,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:20:29,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:20:29,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:20:29,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:20:29,856 INFO L87 Difference]: Start difference. First operand 5849 states and 9801 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:30,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:20:30,942 INFO L93 Difference]: Finished difference Result 13691 states and 22482 transitions. [2025-02-05 17:20:30,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:20:30,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-02-05 17:20:30,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:20:30,999 INFO L225 Difference]: With dead ends: 13691 [2025-02-05 17:20:30,999 INFO L226 Difference]: Without dead ends: 9983 [2025-02-05 17:20:31,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:20:31,016 INFO L435 NwaCegarLoop]: 4788 mSDtfsCounter, 5131 mSDsluCounter, 14442 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5151 SdHoareTripleChecker+Valid, 19230 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:20:31,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5151 Valid, 19230 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:20:31,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9983 states. [2025-02-05 17:20:31,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9983 to 9710. [2025-02-05 17:20:31,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9710 states, 9176 states have (on average 1.652027027027027) internal successors, (15159), 9245 states have internal predecessors, (15159), 364 states have call successors, (364), 103 states have call predecessors, (364), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-02-05 17:20:31,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9710 states to 9710 states and 16141 transitions. [2025-02-05 17:20:31,393 INFO L78 Accepts]: Start accepts. Automaton has 9710 states and 16141 transitions. Word has length 179 [2025-02-05 17:20:31,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:20:31,395 INFO L471 AbstractCegarLoop]: Abstraction has 9710 states and 16141 transitions. [2025-02-05 17:20:31,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:31,396 INFO L276 IsEmpty]: Start isEmpty. Operand 9710 states and 16141 transitions. [2025-02-05 17:20:31,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:20:31,403 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:20:31,403 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:20:31,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:20:31,404 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:20:31,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:20:31,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1737910472, now seen corresponding path program 1 times [2025-02-05 17:20:31,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:20:31,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243977559] [2025-02-05 17:20:31,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:20:31,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:20:31,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:20:31,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:20:31,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:20:31,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:20:31,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:20:31,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:20:31,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243977559] [2025-02-05 17:20:31,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243977559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:20:31,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:20:31,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:20:31,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601243406] [2025-02-05 17:20:31,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:20:31,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:20:31,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:20:31,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:20:31,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:20:31,672 INFO L87 Difference]: Start difference. First operand 9710 states and 16141 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:33,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:20:33,207 INFO L93 Difference]: Finished difference Result 26538 states and 44244 transitions. [2025-02-05 17:20:33,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:20:33,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-02-05 17:20:33,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:20:33,309 INFO L225 Difference]: With dead ends: 26538 [2025-02-05 17:20:33,310 INFO L226 Difference]: Without dead ends: 18969 [2025-02-05 17:20:33,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:20:33,408 INFO L435 NwaCegarLoop]: 4785 mSDtfsCounter, 5126 mSDsluCounter, 14433 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5146 SdHoareTripleChecker+Valid, 19218 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:20:33,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5146 Valid, 19218 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 17:20:33,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18969 states. [2025-02-05 17:20:34,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18969 to 18539. [2025-02-05 17:20:34,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18539 states, 17427 states have (on average 1.6541573420554312) internal successors, (28827), 17642 states have internal predecessors, (28827), 700 states have call successors, (700), 199 states have call predecessors, (700), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-02-05 17:20:34,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18539 states to 18539 states and 31249 transitions. [2025-02-05 17:20:34,190 INFO L78 Accepts]: Start accepts. Automaton has 18539 states and 31249 transitions. Word has length 179 [2025-02-05 17:20:34,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:20:34,190 INFO L471 AbstractCegarLoop]: Abstraction has 18539 states and 31249 transitions. [2025-02-05 17:20:34,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:34,191 INFO L276 IsEmpty]: Start isEmpty. Operand 18539 states and 31249 transitions. [2025-02-05 17:20:34,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:20:34,201 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:20:34,201 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:20:34,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:20:34,202 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:20:34,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:20:34,202 INFO L85 PathProgramCache]: Analyzing trace with hash -871156889, now seen corresponding path program 1 times [2025-02-05 17:20:34,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:20:34,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751641441] [2025-02-05 17:20:34,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:20:34,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:20:34,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:20:34,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:20:34,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:20:34,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:20:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:20:34,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:20:34,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751641441] [2025-02-05 17:20:34,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751641441] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:20:34,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:20:34,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:20:34,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519807987] [2025-02-05 17:20:34,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:20:34,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:20:34,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:20:34,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:20:34,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:20:34,350 INFO L87 Difference]: Start difference. First operand 18539 states and 31249 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:35,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:20:35,569 INFO L93 Difference]: Finished difference Result 39837 states and 68662 transitions. [2025-02-05 17:20:35,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:20:35,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-02-05 17:20:35,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:20:35,772 INFO L225 Difference]: With dead ends: 39837 [2025-02-05 17:20:35,772 INFO L226 Difference]: Without dead ends: 23439 [2025-02-05 17:20:35,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:20:35,829 INFO L435 NwaCegarLoop]: 4429 mSDtfsCounter, 4798 mSDsluCounter, 8700 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4818 SdHoareTripleChecker+Valid, 13129 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:20:35,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4818 Valid, 13129 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:20:35,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23439 states. [2025-02-05 17:20:36,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23439 to 18539. [2025-02-05 17:20:36,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18539 states, 17427 states have (on average 1.6522637286968498) internal successors, (28794), 17642 states have internal predecessors, (28794), 700 states have call successors, (700), 199 states have call predecessors, (700), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-02-05 17:20:36,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18539 states to 18539 states and 31216 transitions. [2025-02-05 17:20:36,577 INFO L78 Accepts]: Start accepts. Automaton has 18539 states and 31216 transitions. Word has length 179 [2025-02-05 17:20:36,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:20:36,577 INFO L471 AbstractCegarLoop]: Abstraction has 18539 states and 31216 transitions. [2025-02-05 17:20:36,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:36,577 INFO L276 IsEmpty]: Start isEmpty. Operand 18539 states and 31216 transitions. [2025-02-05 17:20:36,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:20:36,588 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:20:36,588 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:20:36,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:20:36,588 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:20:36,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:20:36,589 INFO L85 PathProgramCache]: Analyzing trace with hash -678225688, now seen corresponding path program 1 times [2025-02-05 17:20:36,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:20:36,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171219000] [2025-02-05 17:20:36,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:20:36,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:20:36,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:20:36,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:20:36,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:20:36,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:20:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:20:36,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:20:36,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171219000] [2025-02-05 17:20:36,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171219000] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:20:36,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:20:36,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:20:36,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107405696] [2025-02-05 17:20:36,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:20:36,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:20:36,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:20:36,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:20:36,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:20:36,745 INFO L87 Difference]: Start difference. First operand 18539 states and 31216 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:38,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:20:38,254 INFO L93 Difference]: Finished difference Result 39592 states and 68106 transitions. [2025-02-05 17:20:38,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:20:38,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-02-05 17:20:38,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:20:38,371 INFO L225 Difference]: With dead ends: 39592 [2025-02-05 17:20:38,371 INFO L226 Difference]: Without dead ends: 23194 [2025-02-05 17:20:38,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:20:38,431 INFO L435 NwaCegarLoop]: 4426 mSDtfsCounter, 4795 mSDsluCounter, 8695 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4815 SdHoareTripleChecker+Valid, 13121 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:20:38,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4815 Valid, 13121 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:20:38,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23194 states. [2025-02-05 17:20:39,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23194 to 18539. [2025-02-05 17:20:39,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18539 states, 17427 states have (on average 1.6503701153382682) internal successors, (28761), 17642 states have internal predecessors, (28761), 700 states have call successors, (700), 199 states have call predecessors, (700), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-02-05 17:20:39,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18539 states to 18539 states and 31183 transitions. [2025-02-05 17:20:39,252 INFO L78 Accepts]: Start accepts. Automaton has 18539 states and 31183 transitions. Word has length 179 [2025-02-05 17:20:39,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:20:39,253 INFO L471 AbstractCegarLoop]: Abstraction has 18539 states and 31183 transitions. [2025-02-05 17:20:39,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:39,253 INFO L276 IsEmpty]: Start isEmpty. Operand 18539 states and 31183 transitions. [2025-02-05 17:20:39,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:20:39,262 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:20:39,262 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:20:39,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:20:39,262 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:20:39,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:20:39,266 INFO L85 PathProgramCache]: Analyzing trace with hash -810549433, now seen corresponding path program 1 times [2025-02-05 17:20:39,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:20:39,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664194804] [2025-02-05 17:20:39,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:20:39,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:20:39,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:20:39,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:20:39,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:20:39,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:20:39,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:20:39,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:20:39,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664194804] [2025-02-05 17:20:39,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664194804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:20:39,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:20:39,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:20:39,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659433713] [2025-02-05 17:20:39,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:20:39,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:20:39,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:20:39,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:20:39,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:20:39,434 INFO L87 Difference]: Start difference. First operand 18539 states and 31183 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:40,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:20:40,967 INFO L93 Difference]: Finished difference Result 55929 states and 96212 transitions. [2025-02-05 17:20:40,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:20:40,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-02-05 17:20:40,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:20:41,217 INFO L225 Difference]: With dead ends: 55929 [2025-02-05 17:20:41,217 INFO L226 Difference]: Without dead ends: 39531 [2025-02-05 17:20:41,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:20:41,250 INFO L435 NwaCegarLoop]: 4772 mSDtfsCounter, 5105 mSDsluCounter, 14396 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5125 SdHoareTripleChecker+Valid, 19168 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:20:41,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5125 Valid, 19168 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:20:41,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39531 states. [2025-02-05 17:20:42,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39531 to 38870. [2025-02-05 17:20:42,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38870 states, 36440 states have (on average 1.670609220636663) internal successors, (60877), 37109 states have internal predecessors, (60877), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-02-05 17:20:42,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38870 states to 38870 states and 67715 transitions. [2025-02-05 17:20:42,923 INFO L78 Accepts]: Start accepts. Automaton has 38870 states and 67715 transitions. Word has length 179 [2025-02-05 17:20:42,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:20:42,930 INFO L471 AbstractCegarLoop]: Abstraction has 38870 states and 67715 transitions. [2025-02-05 17:20:42,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:42,930 INFO L276 IsEmpty]: Start isEmpty. Operand 38870 states and 67715 transitions. [2025-02-05 17:20:42,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:20:42,964 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:20:42,964 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:20:42,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:20:42,969 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:20:42,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:20:42,970 INFO L85 PathProgramCache]: Analyzing trace with hash 155013384, now seen corresponding path program 1 times [2025-02-05 17:20:42,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:20:42,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388790672] [2025-02-05 17:20:42,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:20:42,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:20:43,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:20:43,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:20:43,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:20:43,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:20:43,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:20:43,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:20:43,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388790672] [2025-02-05 17:20:43,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388790672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:20:43,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:20:43,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:20:43,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402832521] [2025-02-05 17:20:43,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:20:43,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:20:43,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:20:43,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:20:43,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:20:43,228 INFO L87 Difference]: Start difference. First operand 38870 states and 67715 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:45,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:20:45,237 INFO L93 Difference]: Finished difference Result 88026 states and 158326 transitions. [2025-02-05 17:20:45,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:20:45,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-02-05 17:20:45,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:20:45,506 INFO L225 Difference]: With dead ends: 88026 [2025-02-05 17:20:45,506 INFO L226 Difference]: Without dead ends: 51297 [2025-02-05 17:20:45,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:20:45,625 INFO L435 NwaCegarLoop]: 4388 mSDtfsCounter, 4822 mSDsluCounter, 8653 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4842 SdHoareTripleChecker+Valid, 13041 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:20:45,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4842 Valid, 13041 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:20:45,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51297 states. [2025-02-05 17:20:47,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51297 to 38870. [2025-02-05 17:20:47,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38870 states, 36440 states have (on average 1.6688254665203073) internal successors, (60812), 37109 states have internal predecessors, (60812), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-02-05 17:20:47,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38870 states to 38870 states and 67650 transitions. [2025-02-05 17:20:47,634 INFO L78 Accepts]: Start accepts. Automaton has 38870 states and 67650 transitions. Word has length 179 [2025-02-05 17:20:47,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:20:47,636 INFO L471 AbstractCegarLoop]: Abstraction has 38870 states and 67650 transitions. [2025-02-05 17:20:47,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:47,636 INFO L276 IsEmpty]: Start isEmpty. Operand 38870 states and 67650 transitions. [2025-02-05 17:20:47,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:20:47,652 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:20:47,652 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:20:47,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:20:47,653 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:20:47,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:20:47,653 INFO L85 PathProgramCache]: Analyzing trace with hash -506576089, now seen corresponding path program 1 times [2025-02-05 17:20:47,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:20:47,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044827839] [2025-02-05 17:20:47,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:20:47,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:20:47,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:20:47,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:20:47,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:20:47,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:20:47,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:20:47,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:20:47,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044827839] [2025-02-05 17:20:47,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044827839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:20:47,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:20:47,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:20:47,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96781541] [2025-02-05 17:20:47,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:20:47,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:20:47,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:20:47,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:20:47,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:20:47,784 INFO L87 Difference]: Start difference. First operand 38870 states and 67650 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:49,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:20:49,986 INFO L93 Difference]: Finished difference Result 87295 states and 156734 transitions. [2025-02-05 17:20:49,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:20:49,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-02-05 17:20:49,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:20:50,225 INFO L225 Difference]: With dead ends: 87295 [2025-02-05 17:20:50,225 INFO L226 Difference]: Without dead ends: 50566 [2025-02-05 17:20:50,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:20:50,326 INFO L435 NwaCegarLoop]: 4418 mSDtfsCounter, 4788 mSDsluCounter, 8681 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4808 SdHoareTripleChecker+Valid, 13099 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:20:50,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4808 Valid, 13099 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:20:50,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50566 states. [2025-02-05 17:20:52,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50566 to 38870. [2025-02-05 17:20:52,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38870 states, 36440 states have (on average 1.6670417124039516) internal successors, (60747), 37109 states have internal predecessors, (60747), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-02-05 17:20:52,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38870 states to 38870 states and 67585 transitions. [2025-02-05 17:20:52,427 INFO L78 Accepts]: Start accepts. Automaton has 38870 states and 67585 transitions. Word has length 179 [2025-02-05 17:20:52,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:20:52,428 INFO L471 AbstractCegarLoop]: Abstraction has 38870 states and 67585 transitions. [2025-02-05 17:20:52,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:52,428 INFO L276 IsEmpty]: Start isEmpty. Operand 38870 states and 67585 transitions. [2025-02-05 17:20:52,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:20:52,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:20:52,444 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:20:52,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:20:52,445 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:20:52,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:20:52,445 INFO L85 PathProgramCache]: Analyzing trace with hash 441913640, now seen corresponding path program 1 times [2025-02-05 17:20:52,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:20:52,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869190921] [2025-02-05 17:20:52,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:20:52,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:20:52,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:20:52,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:20:52,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:20:52,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:20:52,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:20:52,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:20:52,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869190921] [2025-02-05 17:20:52,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869190921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:20:52,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:20:52,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:20:52,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941741463] [2025-02-05 17:20:52,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:20:52,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:20:52,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:20:52,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:20:52,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:20:52,597 INFO L87 Difference]: Start difference. First operand 38870 states and 67585 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:54,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:20:54,520 INFO L93 Difference]: Finished difference Result 86564 states and 155142 transitions. [2025-02-05 17:20:54,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:20:54,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-02-05 17:20:54,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:20:54,738 INFO L225 Difference]: With dead ends: 86564 [2025-02-05 17:20:54,739 INFO L226 Difference]: Without dead ends: 49835 [2025-02-05 17:20:54,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:20:54,832 INFO L435 NwaCegarLoop]: 4415 mSDtfsCounter, 4785 mSDsluCounter, 8676 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4805 SdHoareTripleChecker+Valid, 13091 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:20:54,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4805 Valid, 13091 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:20:54,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49835 states. [2025-02-05 17:20:56,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49835 to 38870. [2025-02-05 17:20:56,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38870 states, 36440 states have (on average 1.6652579582875962) internal successors, (60682), 37109 states have internal predecessors, (60682), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-02-05 17:20:56,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38870 states to 38870 states and 67520 transitions. [2025-02-05 17:20:56,366 INFO L78 Accepts]: Start accepts. Automaton has 38870 states and 67520 transitions. Word has length 179 [2025-02-05 17:20:56,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:20:56,366 INFO L471 AbstractCegarLoop]: Abstraction has 38870 states and 67520 transitions. [2025-02-05 17:20:56,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:56,366 INFO L276 IsEmpty]: Start isEmpty. Operand 38870 states and 67520 transitions. [2025-02-05 17:20:56,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:20:56,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:20:56,381 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:20:56,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:20:56,381 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:20:56,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:20:56,381 INFO L85 PathProgramCache]: Analyzing trace with hash 611057415, now seen corresponding path program 1 times [2025-02-05 17:20:56,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:20:56,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371357506] [2025-02-05 17:20:56,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:20:56,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:20:56,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:20:56,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:20:56,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:20:56,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:20:56,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:20:56,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:20:56,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371357506] [2025-02-05 17:20:56,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371357506] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:20:56,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:20:56,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:20:56,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768550900] [2025-02-05 17:20:56,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:20:56,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:20:56,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:20:56,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:20:56,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:20:56,556 INFO L87 Difference]: Start difference. First operand 38870 states and 67520 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:59,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:20:59,918 INFO L93 Difference]: Finished difference Result 128758 states and 230926 transitions. [2025-02-05 17:20:59,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:20:59,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-02-05 17:20:59,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:21:00,222 INFO L225 Difference]: With dead ends: 128758 [2025-02-05 17:21:00,222 INFO L226 Difference]: Without dead ends: 92029 [2025-02-05 17:21:00,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:21:00,324 INFO L435 NwaCegarLoop]: 4752 mSDtfsCounter, 5450 mSDsluCounter, 14334 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5483 SdHoareTripleChecker+Valid, 19086 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:21:00,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5483 Valid, 19086 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:21:00,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92029 states. [2025-02-05 17:21:03,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92029 to 85172. [2025-02-05 17:21:04,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85172 states, 79684 states have (on average 1.6912805582049093) internal successors, (134768), 81747 states have internal predecessors, (134768), 2652 states have call successors, (2652), 775 states have call predecessors, (2652), 2834 states have return successors, (19034), 2777 states have call predecessors, (19034), 2650 states have call successors, (19034) [2025-02-05 17:21:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85172 states to 85172 states and 156454 transitions. [2025-02-05 17:21:04,656 INFO L78 Accepts]: Start accepts. Automaton has 85172 states and 156454 transitions. Word has length 179 [2025-02-05 17:21:04,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:21:04,656 INFO L471 AbstractCegarLoop]: Abstraction has 85172 states and 156454 transitions. [2025-02-05 17:21:04,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:21:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 85172 states and 156454 transitions. [2025-02-05 17:21:04,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:21:04,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:21:04,671 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:21:04,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:21:04,671 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:21:04,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:21:04,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1323148984, now seen corresponding path program 1 times [2025-02-05 17:21:04,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:21:04,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345958326] [2025-02-05 17:21:04,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:21:04,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:21:04,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:21:04,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:21:04,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:21:04,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:21:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:21:04,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:21:04,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345958326] [2025-02-05 17:21:04,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345958326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:21:04,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:21:04,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:21:04,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057171543] [2025-02-05 17:21:04,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:21:04,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:21:04,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:21:04,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:21:04,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:21:04,771 INFO L87 Difference]: Start difference. First operand 85172 states and 156454 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)