./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.13.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.13.cil-2.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 29f58006f2dcb74445f74971d42059f9136b4de9a536aa3c519655ea459ca984 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:24:24,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:24:24,863 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:24:24,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:24:24,871 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:24:24,894 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:24:24,895 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:24:24,895 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:24:24,895 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:24:24,896 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:24:24,896 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:24:24,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:24:24,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:24:24,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:24:24,897 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:24:24,897 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:24:24,897 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:24:24,897 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:24:24,897 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:24:24,898 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:24:24,898 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:24:24,898 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:24:24,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:24:24,898 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:24:24,898 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:24:24,898 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:24:24,898 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:24:24,898 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:24:24,899 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:24:24,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:24:24,899 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:24:24,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:24:24,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:24:24,899 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:24:24,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:24:24,899 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:24:24,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:24:24,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:24:24,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:24:24,900 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:24:24,900 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:24:24,900 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:24:24,900 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:24:24,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:24:24,900 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:24:24,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:24:24,901 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:24:24,901 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:24:24,901 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 -> 29f58006f2dcb74445f74971d42059f9136b4de9a536aa3c519655ea459ca984 [2025-01-09 05:24:25,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:24:25,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:24:25,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:24:25,126 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:24:25,126 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:24:25,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.13.cil-2.c [2025-01-09 05:24:26,270 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/225183930/5ca481a54b6e4298801e16b9036d40b8/FLAGf6f95cc9a [2025-01-09 05:24:27,039 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:24:27,040 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.13.cil-2.c [2025-01-09 05:24:27,093 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/225183930/5ca481a54b6e4298801e16b9036d40b8/FLAGf6f95cc9a [2025-01-09 05:24:27,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/225183930/5ca481a54b6e4298801e16b9036d40b8 [2025-01-09 05:24:27,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:24:27,377 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:24:27,382 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:24:27,382 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:24:27,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:24:27,387 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:24:27" (1/1) ... [2025-01-09 05:24:27,388 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef3eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:27, skipping insertion in model container [2025-01-09 05:24:27,388 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:24:27" (1/1) ... [2025-01-09 05:24:27,510 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:24:29,011 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_label46+token_ring.13.cil-2.c[382357,382370] [2025-01-09 05:24:29,034 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_label46+token_ring.13.cil-2.c[383339,383352] [2025-01-09 05:24:29,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:24:29,241 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:24:29,852 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_label46+token_ring.13.cil-2.c[382357,382370] [2025-01-09 05:24:29,857 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_label46+token_ring.13.cil-2.c[383339,383352] [2025-01-09 05:24:29,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:24:29,954 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:24:29,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:29 WrapperNode [2025-01-09 05:24:29,956 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:24:29,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:24:29,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:24:29,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:24:29,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:29" (1/1) ... [2025-01-09 05:24:30,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:29" (1/1) ... [2025-01-09 05:24:30,282 INFO L138 Inliner]: procedures = 70, calls = 80, calls flagged for inlining = 48, calls inlined = 48, statements flattened = 13242 [2025-01-09 05:24:30,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:24:30,284 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:24:30,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:24:30,284 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:24:30,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:29" (1/1) ... [2025-01-09 05:24:30,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:29" (1/1) ... [2025-01-09 05:24:30,424 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:29" (1/1) ... [2025-01-09 05:24:30,530 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-01-09 05:24:30,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:29" (1/1) ... [2025-01-09 05:24:30,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:29" (1/1) ... [2025-01-09 05:24:30,675 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:29" (1/1) ... [2025-01-09 05:24:30,690 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:29" (1/1) ... [2025-01-09 05:24:30,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:29" (1/1) ... [2025-01-09 05:24:30,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:29" (1/1) ... [2025-01-09 05:24:30,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:29" (1/1) ... [2025-01-09 05:24:30,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:24:30,821 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:24:30,821 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:24:30,821 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:24:30,822 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:29" (1/1) ... [2025-01-09 05:24:30,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:24:30,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:24:30,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 05:24:30,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 05:24:30,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:24:30,932 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:24:30,932 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:24:30,932 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:24:30,932 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:24:30,932 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:24:30,932 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:24:30,932 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:24:30,932 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:24:30,933 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:24:30,933 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:24:30,933 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:24:30,933 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:24:30,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:24:30,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:24:30,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:24:31,028 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:24:31,030 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:24:37,735 INFO L? ?]: Removed 1761 outVars from TransFormulas that were not future-live. [2025-01-09 05:24:37,735 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:24:37,806 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:24:37,806 INFO L312 CfgBuilder]: Removed 17 assume(true) statements. [2025-01-09 05:24:37,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:24:37 BoogieIcfgContainer [2025-01-09 05:24:37,807 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:24:37,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:24:37,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:24:37,817 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:24:37,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:24:27" (1/3) ... [2025-01-09 05:24:37,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d509121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:24:37, skipping insertion in model container [2025-01-09 05:24:37,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:29" (2/3) ... [2025-01-09 05:24:37,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d509121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:24:37, skipping insertion in model container [2025-01-09 05:24:37,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:24:37" (3/3) ... [2025-01-09 05:24:37,819 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.13.cil-2.c [2025-01-09 05:24:37,831 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:24:37,836 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label46+token_ring.13.cil-2.c that has 7 procedures, 2588 locations, 1 initial locations, 17 loop locations, and 2 error locations. [2025-01-09 05:24:37,933 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:24:37,944 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;@5dfd88bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:24:37,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:24:37,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 2588 states, 2553 states have (on average 1.8350959655307482) internal successors, (4685), 2555 states have internal predecessors, (4685), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 05:24:37,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 05:24:37,975 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:37,976 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:37,976 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:37,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:37,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1325703449, now seen corresponding path program 1 times [2025-01-09 05:24:37,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:37,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114907720] [2025-01-09 05:24:37,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:37,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:38,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:24:38,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:24:38,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:38,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:38,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:24:38,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:38,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114907720] [2025-01-09 05:24:38,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114907720] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:38,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:38,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:24:38,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571808207] [2025-01-09 05:24:38,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:38,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:24:38,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:38,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:24:38,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:24:38,373 INFO L87 Difference]: Start difference. First operand has 2588 states, 2553 states have (on average 1.8350959655307482) internal successors, (4685), 2555 states have internal predecessors, (4685), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:38,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:38,626 INFO L93 Difference]: Finished difference Result 5167 states and 9461 transitions. [2025-01-09 05:24:38,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:24:38,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 187 [2025-01-09 05:24:38,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:38,655 INFO L225 Difference]: With dead ends: 5167 [2025-01-09 05:24:38,655 INFO L226 Difference]: Without dead ends: 2521 [2025-01-09 05:24:38,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:24:38,670 INFO L435 NwaCegarLoop]: 4659 mSDtfsCounter, 629 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 8681 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:38,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 8681 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:24:38,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2521 states. [2025-01-09 05:24:38,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2521 to 2521. [2025-01-09 05:24:38,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2521 states, 2486 states have (on average 1.8250201126307322) internal successors, (4537), 2488 states have internal predecessors, (4537), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 05:24:38,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 4591 transitions. [2025-01-09 05:24:38,791 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 4591 transitions. Word has length 187 [2025-01-09 05:24:38,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:38,793 INFO L471 AbstractCegarLoop]: Abstraction has 2521 states and 4591 transitions. [2025-01-09 05:24:38,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:38,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 4591 transitions. [2025-01-09 05:24:38,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 05:24:38,799 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:38,800 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:38,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:24:38,800 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:38,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:38,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1306162327, now seen corresponding path program 1 times [2025-01-09 05:24:38,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:38,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208052325] [2025-01-09 05:24:38,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:38,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:38,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:24:38,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:24:38,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:38,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:38,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:24:38,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:38,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208052325] [2025-01-09 05:24:38,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208052325] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:38,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:38,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:24:38,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117882325] [2025-01-09 05:24:38,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:38,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:24:38,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:38,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:24:38,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:24:38,988 INFO L87 Difference]: Start difference. First operand 2521 states and 4591 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:39,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:39,039 INFO L93 Difference]: Finished difference Result 2903 states and 5193 transitions. [2025-01-09 05:24:39,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:24:39,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 187 [2025-01-09 05:24:39,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:39,048 INFO L225 Difference]: With dead ends: 2903 [2025-01-09 05:24:39,048 INFO L226 Difference]: Without dead ends: 2521 [2025-01-09 05:24:39,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:24:39,051 INFO L435 NwaCegarLoop]: 4589 mSDtfsCounter, 615 mSDsluCounter, 3958 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 8547 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:39,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 8547 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:24:39,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2521 states. [2025-01-09 05:24:39,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2521 to 2521. [2025-01-09 05:24:39,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2521 states, 2486 states have (on average 1.82461786001609) internal successors, (4536), 2488 states have internal predecessors, (4536), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 05:24:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 4590 transitions. [2025-01-09 05:24:39,096 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 4590 transitions. Word has length 187 [2025-01-09 05:24:39,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:39,096 INFO L471 AbstractCegarLoop]: Abstraction has 2521 states and 4590 transitions. [2025-01-09 05:24:39,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:39,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 4590 transitions. [2025-01-09 05:24:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 05:24:39,099 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:39,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:39,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:24:39,099 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:39,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:39,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1581079019, now seen corresponding path program 1 times [2025-01-09 05:24:39,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:39,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715486506] [2025-01-09 05:24:39,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:39,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:39,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:24:39,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:24:39,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:39,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:24:39,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:39,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715486506] [2025-01-09 05:24:39,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715486506] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:39,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:39,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:24:39,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350159757] [2025-01-09 05:24:39,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:39,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:24:39,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:39,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:24:39,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:24:39,291 INFO L87 Difference]: Start difference. First operand 2521 states and 4590 transitions. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 4 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:40,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:40,007 INFO L93 Difference]: Finished difference Result 3331 states and 5890 transitions. [2025-01-09 05:24:40,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:24:40,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 4 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 187 [2025-01-09 05:24:40,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:40,019 INFO L225 Difference]: With dead ends: 3331 [2025-01-09 05:24:40,019 INFO L226 Difference]: Without dead ends: 2952 [2025-01-09 05:24:40,022 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-01-09 05:24:40,022 INFO L435 NwaCegarLoop]: 4448 mSDtfsCounter, 5190 mSDsluCounter, 9170 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5211 SdHoareTripleChecker+Valid, 13618 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:40,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5211 Valid, 13618 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:24:40,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2025-01-09 05:24:40,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 2921. [2025-01-09 05:24:40,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2921 states, 2857 states have (on average 1.7959397969898494) internal successors, (5131), 2860 states have internal predecessors, (5131), 49 states have call successors, (49), 12 states have call predecessors, (49), 13 states have return successors, (50), 49 states have call predecessors, (50), 49 states have call successors, (50) [2025-01-09 05:24:40,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2921 states to 2921 states and 5230 transitions. [2025-01-09 05:24:40,088 INFO L78 Accepts]: Start accepts. Automaton has 2921 states and 5230 transitions. Word has length 187 [2025-01-09 05:24:40,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:40,089 INFO L471 AbstractCegarLoop]: Abstraction has 2921 states and 5230 transitions. [2025-01-09 05:24:40,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 4 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:40,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2921 states and 5230 transitions. [2025-01-09 05:24:40,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 05:24:40,091 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:40,091 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:40,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:24:40,091 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:40,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:40,091 INFO L85 PathProgramCache]: Analyzing trace with hash -189035879, now seen corresponding path program 1 times [2025-01-09 05:24:40,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:40,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088695239] [2025-01-09 05:24:40,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:40,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:40,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:24:40,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:24:40,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:40,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:40,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:24:40,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:40,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088695239] [2025-01-09 05:24:40,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088695239] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:40,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:40,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:40,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877452654] [2025-01-09 05:24:40,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:40,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:40,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:40,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:40,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:40,454 INFO L87 Difference]: Start difference. First operand 2921 states and 5230 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:41,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:41,295 INFO L93 Difference]: Finished difference Result 4214 states and 7327 transitions. [2025-01-09 05:24:41,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:41,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 187 [2025-01-09 05:24:41,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:41,308 INFO L225 Difference]: With dead ends: 4214 [2025-01-09 05:24:41,308 INFO L226 Difference]: Without dead ends: 3435 [2025-01-09 05:24:41,311 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-01-09 05:24:41,312 INFO L435 NwaCegarLoop]: 4786 mSDtfsCounter, 5202 mSDsluCounter, 14421 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5223 SdHoareTripleChecker+Valid, 19207 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:41,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5223 Valid, 19207 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:24:41,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2025-01-09 05:24:41,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3292. [2025-01-09 05:24:41,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3292 states, 3199 states have (on average 1.771803688652704) internal successors, (5668), 3203 states have internal predecessors, (5668), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (75), 72 states have call predecessors, (75), 71 states have call successors, (75) [2025-01-09 05:24:41,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3292 states to 3292 states and 5814 transitions. [2025-01-09 05:24:41,395 INFO L78 Accepts]: Start accepts. Automaton has 3292 states and 5814 transitions. Word has length 187 [2025-01-09 05:24:41,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:41,395 INFO L471 AbstractCegarLoop]: Abstraction has 3292 states and 5814 transitions. [2025-01-09 05:24:41,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:41,396 INFO L276 IsEmpty]: Start isEmpty. Operand 3292 states and 5814 transitions. [2025-01-09 05:24:41,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 05:24:41,398 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:41,398 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:41,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:24:41,398 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:41,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:41,399 INFO L85 PathProgramCache]: Analyzing trace with hash 381235927, now seen corresponding path program 1 times [2025-01-09 05:24:41,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:41,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948837316] [2025-01-09 05:24:41,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:41,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:41,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:24:41,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:24:41,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:41,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:41,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:24:41,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:41,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948837316] [2025-01-09 05:24:41,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948837316] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:41,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:41,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:41,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296999824] [2025-01-09 05:24:41,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:41,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:41,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:41,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:41,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:41,610 INFO L87 Difference]: Start difference. First operand 3292 states and 5814 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:42,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:42,373 INFO L93 Difference]: Finished difference Result 5395 states and 9214 transitions. [2025-01-09 05:24:42,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:42,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 187 [2025-01-09 05:24:42,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:42,391 INFO L225 Difference]: With dead ends: 5395 [2025-01-09 05:24:42,391 INFO L226 Difference]: Without dead ends: 4245 [2025-01-09 05:24:42,395 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-01-09 05:24:42,396 INFO L435 NwaCegarLoop]: 4778 mSDtfsCounter, 5194 mSDsluCounter, 14399 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5215 SdHoareTripleChecker+Valid, 19177 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:42,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5215 Valid, 19177 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:24:42,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4245 states. [2025-01-09 05:24:42,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4245 to 4084. [2025-01-09 05:24:42,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4084 states, 3931 states have (on average 1.7387433223098447) internal successors, (6835), 3939 states have internal predecessors, (6835), 115 states have call successors, (115), 30 states have call predecessors, (115), 36 states have return successors, (131), 118 states have call predecessors, (131), 115 states have call successors, (131) [2025-01-09 05:24:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4084 states to 4084 states and 7081 transitions. [2025-01-09 05:24:42,585 INFO L78 Accepts]: Start accepts. Automaton has 4084 states and 7081 transitions. Word has length 187 [2025-01-09 05:24:42,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:42,585 INFO L471 AbstractCegarLoop]: Abstraction has 4084 states and 7081 transitions. [2025-01-09 05:24:42,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:42,585 INFO L276 IsEmpty]: Start isEmpty. Operand 4084 states and 7081 transitions. [2025-01-09 05:24:42,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 05:24:42,588 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:42,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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:42,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:24:42,588 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:42,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:42,589 INFO L85 PathProgramCache]: Analyzing trace with hash -404761963, now seen corresponding path program 1 times [2025-01-09 05:24:42,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:42,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773619598] [2025-01-09 05:24:42,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:42,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:42,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:24:42,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:24:42,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:42,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:42,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:24:42,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:42,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773619598] [2025-01-09 05:24:42,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773619598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:42,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:42,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:42,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588539731] [2025-01-09 05:24:42,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:42,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:42,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:42,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:42,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:42,743 INFO L87 Difference]: Start difference. First operand 4084 states and 7081 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:43,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:43,494 INFO L93 Difference]: Finished difference Result 7963 states and 13403 transitions. [2025-01-09 05:24:43,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:43,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 187 [2025-01-09 05:24:43,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:43,516 INFO L225 Difference]: With dead ends: 7963 [2025-01-09 05:24:43,517 INFO L226 Difference]: Without dead ends: 6021 [2025-01-09 05:24:43,523 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-01-09 05:24:43,524 INFO L435 NwaCegarLoop]: 4775 mSDtfsCounter, 5189 mSDsluCounter, 14390 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5210 SdHoareTripleChecker+Valid, 19165 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:43,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5210 Valid, 19165 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:24:43,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6021 states. [2025-01-09 05:24:43,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6021 to 5815. [2025-01-09 05:24:43,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5815 states, 5536 states have (on average 1.7057442196531791) internal successors, (9443), 5558 states have internal predecessors, (9443), 203 states have call successors, (203), 54 states have call predecessors, (203), 74 states have return successors, (267), 210 states have call predecessors, (267), 203 states have call successors, (267) [2025-01-09 05:24:43,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5815 states to 5815 states and 9913 transitions. [2025-01-09 05:24:43,700 INFO L78 Accepts]: Start accepts. Automaton has 5815 states and 9913 transitions. Word has length 187 [2025-01-09 05:24:43,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:43,701 INFO L471 AbstractCegarLoop]: Abstraction has 5815 states and 9913 transitions. [2025-01-09 05:24:43,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:43,701 INFO L276 IsEmpty]: Start isEmpty. Operand 5815 states and 9913 transitions. [2025-01-09 05:24:43,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 05:24:43,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:43,704 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:43,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:24:43,705 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:43,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:43,705 INFO L85 PathProgramCache]: Analyzing trace with hash 262619927, now seen corresponding path program 1 times [2025-01-09 05:24:43,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:43,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625754109] [2025-01-09 05:24:43,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:43,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:43,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:24:43,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:24:43,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:43,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:43,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:24:43,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:43,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625754109] [2025-01-09 05:24:43,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625754109] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:43,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:43,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:43,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525955632] [2025-01-09 05:24:43,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:43,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:43,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:43,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:43,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:43,853 INFO L87 Difference]: Start difference. First operand 5815 states and 9913 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:44,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:44,720 INFO L93 Difference]: Finished difference Result 13668 states and 22961 transitions. [2025-01-09 05:24:44,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:44,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 187 [2025-01-09 05:24:44,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:44,767 INFO L225 Difference]: With dead ends: 13668 [2025-01-09 05:24:44,767 INFO L226 Difference]: Without dead ends: 9995 [2025-01-09 05:24:44,777 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-01-09 05:24:44,778 INFO L435 NwaCegarLoop]: 4772 mSDtfsCounter, 5184 mSDsluCounter, 14381 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5205 SdHoareTripleChecker+Valid, 19153 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:44,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5205 Valid, 19153 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:24:44,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9995 states. [2025-01-09 05:24:45,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9995 to 9700. [2025-01-09 05:24:45,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9700 states, 9151 states have (on average 1.688012239099552) internal successors, (15447), 9219 states have internal predecessors, (15447), 379 states have call successors, (379), 102 states have call predecessors, (379), 168 states have return successors, (635), 394 states have call predecessors, (635), 379 states have call successors, (635) [2025-01-09 05:24:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9700 states to 9700 states and 16461 transitions. [2025-01-09 05:24:45,060 INFO L78 Accepts]: Start accepts. Automaton has 9700 states and 16461 transitions. Word has length 187 [2025-01-09 05:24:45,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:45,061 INFO L471 AbstractCegarLoop]: Abstraction has 9700 states and 16461 transitions. [2025-01-09 05:24:45,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:45,061 INFO L276 IsEmpty]: Start isEmpty. Operand 9700 states and 16461 transitions. [2025-01-09 05:24:45,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 05:24:45,067 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:45,067 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:45,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:24:45,067 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:45,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:45,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1932608939, now seen corresponding path program 1 times [2025-01-09 05:24:45,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:45,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230258483] [2025-01-09 05:24:45,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:45,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:45,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:24:45,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:24:45,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:45,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:45,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:24:45,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:45,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230258483] [2025-01-09 05:24:45,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230258483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:45,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:45,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:45,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893344125] [2025-01-09 05:24:45,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:45,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:45,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:45,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:45,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:45,208 INFO L87 Difference]: Start difference. First operand 9700 states and 16461 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:46,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:46,511 INFO L93 Difference]: Finished difference Result 26711 states and 45595 transitions. [2025-01-09 05:24:46,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:46,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 187 [2025-01-09 05:24:46,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:46,573 INFO L225 Difference]: With dead ends: 26711 [2025-01-09 05:24:46,574 INFO L226 Difference]: Without dead ends: 19153 [2025-01-09 05:24:46,603 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-01-09 05:24:46,603 INFO L435 NwaCegarLoop]: 4486 mSDtfsCounter, 5219 mSDsluCounter, 13696 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5240 SdHoareTripleChecker+Valid, 18182 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:46,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5240 Valid, 18182 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 05:24:46,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19153 states. [2025-01-09 05:24:47,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19153 to 18685. [2025-01-09 05:24:47,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18685 states, 17542 states have (on average 1.6939345570630486) internal successors, (29715), 17756 states have internal predecessors, (29715), 731 states have call successors, (731), 198 states have call predecessors, (731), 410 states have return successors, (1755), 762 states have call predecessors, (1755), 731 states have call successors, (1755) [2025-01-09 05:24:47,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18685 states to 18685 states and 32201 transitions. [2025-01-09 05:24:47,234 INFO L78 Accepts]: Start accepts. Automaton has 18685 states and 32201 transitions. Word has length 187 [2025-01-09 05:24:47,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:47,235 INFO L471 AbstractCegarLoop]: Abstraction has 18685 states and 32201 transitions. [2025-01-09 05:24:47,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:47,235 INFO L276 IsEmpty]: Start isEmpty. Operand 18685 states and 32201 transitions. [2025-01-09 05:24:47,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 05:24:47,243 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:47,243 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:47,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:24:47,244 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:47,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:47,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1587780777, now seen corresponding path program 1 times [2025-01-09 05:24:47,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:47,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418961351] [2025-01-09 05:24:47,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:47,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:47,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:24:47,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:24:47,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:47,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:47,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:24:47,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:47,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418961351] [2025-01-09 05:24:47,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418961351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:47,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:47,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:24:47,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616980048] [2025-01-09 05:24:47,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:47,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:24:47,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:47,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:24:47,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:24:47,389 INFO L87 Difference]: Start difference. First operand 18685 states and 32201 transitions. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:48,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:48,287 INFO L93 Difference]: Finished difference Result 40618 states and 71546 transitions. [2025-01-09 05:24:48,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:24:48,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 187 [2025-01-09 05:24:48,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:48,350 INFO L225 Difference]: With dead ends: 40618 [2025-01-09 05:24:48,350 INFO L226 Difference]: Without dead ends: 24075 [2025-01-09 05:24:48,385 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-01-09 05:24:48,388 INFO L435 NwaCegarLoop]: 4425 mSDtfsCounter, 4820 mSDsluCounter, 8685 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4841 SdHoareTripleChecker+Valid, 13110 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:48,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4841 Valid, 13110 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:24:48,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24075 states. [2025-01-09 05:24:48,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24075 to 18685. [2025-01-09 05:24:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18685 states, 17542 states have (on average 1.6920533576559116) internal successors, (29682), 17756 states have internal predecessors, (29682), 731 states have call successors, (731), 198 states have call predecessors, (731), 410 states have return successors, (1755), 762 states have call predecessors, (1755), 731 states have call successors, (1755) [2025-01-09 05:24:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18685 states to 18685 states and 32168 transitions. [2025-01-09 05:24:49,041 INFO L78 Accepts]: Start accepts. Automaton has 18685 states and 32168 transitions. Word has length 187 [2025-01-09 05:24:49,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:49,041 INFO L471 AbstractCegarLoop]: Abstraction has 18685 states and 32168 transitions. [2025-01-09 05:24:49,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:49,042 INFO L276 IsEmpty]: Start isEmpty. Operand 18685 states and 32168 transitions. [2025-01-09 05:24:49,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 05:24:49,049 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:49,049 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:49,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:24:49,049 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:49,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:49,050 INFO L85 PathProgramCache]: Analyzing trace with hash -606825963, now seen corresponding path program 1 times [2025-01-09 05:24:49,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:49,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425677822] [2025-01-09 05:24:49,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:49,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:49,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:24:49,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:24:49,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:49,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:49,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:24:49,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:49,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425677822] [2025-01-09 05:24:49,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425677822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:49,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:49,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:49,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162364055] [2025-01-09 05:24:49,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:49,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:49,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:49,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:49,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:49,191 INFO L87 Difference]: Start difference. First operand 18685 states and 32168 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:50,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:50,888 INFO L93 Difference]: Finished difference Result 57204 states and 100826 transitions. [2025-01-09 05:24:50,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:50,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 187 [2025-01-09 05:24:50,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:50,989 INFO L225 Difference]: With dead ends: 57204 [2025-01-09 05:24:50,990 INFO L226 Difference]: Without dead ends: 40661 [2025-01-09 05:24:51,015 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-01-09 05:24:51,016 INFO L435 NwaCegarLoop]: 4761 mSDtfsCounter, 5166 mSDsluCounter, 14349 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5187 SdHoareTripleChecker+Valid, 19110 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:51,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5187 Valid, 19110 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 05:24:51,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40661 states. [2025-01-09 05:24:52,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40661 to 39895. [2025-01-09 05:24:52,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39895 states, 37402 states have (on average 1.715523234051655) internal successors, (64164), 38070 states have internal predecessors, (64164), 1435 states have call successors, (1435), 390 states have call predecessors, (1435), 1056 states have return successors, (5531), 1498 states have call predecessors, (5531), 1435 states have call successors, (5531) [2025-01-09 05:24:52,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39895 states to 39895 states and 71130 transitions. [2025-01-09 05:24:52,489 INFO L78 Accepts]: Start accepts. Automaton has 39895 states and 71130 transitions. Word has length 187 [2025-01-09 05:24:52,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:52,491 INFO L471 AbstractCegarLoop]: Abstraction has 39895 states and 71130 transitions. [2025-01-09 05:24:52,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:52,492 INFO L276 IsEmpty]: Start isEmpty. Operand 39895 states and 71130 transitions. [2025-01-09 05:24:52,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 05:24:52,508 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:52,508 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:52,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:24:52,508 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:52,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:52,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1918669719, now seen corresponding path program 1 times [2025-01-09 05:24:52,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:52,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987804904] [2025-01-09 05:24:52,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:52,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:52,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:24:52,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:24:52,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:52,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:24:52,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:52,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987804904] [2025-01-09 05:24:52,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987804904] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:52,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:52,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:52,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383210336] [2025-01-09 05:24:52,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:52,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:52,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:52,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:52,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:52,674 INFO L87 Difference]: Start difference. First operand 39895 states and 71130 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:55,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:55,798 INFO L93 Difference]: Finished difference Result 130916 states and 242530 transitions. [2025-01-09 05:24:55,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:55,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 187 [2025-01-09 05:24:55,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:56,181 INFO L225 Difference]: With dead ends: 130916 [2025-01-09 05:24:56,181 INFO L226 Difference]: Without dead ends: 93163 [2025-01-09 05:24:56,275 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-01-09 05:24:56,278 INFO L435 NwaCegarLoop]: 4758 mSDtfsCounter, 5161 mSDsluCounter, 14340 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5182 SdHoareTripleChecker+Valid, 19098 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:56,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5182 Valid, 19098 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 05:24:56,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93163 states. [2025-01-09 05:24:58,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93163 to 91792. [2025-01-09 05:24:59,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91792 states, 86113 states have (on average 1.7487719624214695) internal successors, (150592), 88175 states have internal predecessors, (150592), 2843 states have call successors, (2843), 774 states have call predecessors, (2843), 2834 states have return successors, (19227), 2970 states have call predecessors, (19227), 2843 states have call successors, (19227) [2025-01-09 05:24:59,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91792 states to 91792 states and 172662 transitions. [2025-01-09 05:24:59,568 INFO L78 Accepts]: Start accepts. Automaton has 91792 states and 172662 transitions. Word has length 187 [2025-01-09 05:24:59,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:59,572 INFO L471 AbstractCegarLoop]: Abstraction has 91792 states and 172662 transitions. [2025-01-09 05:24:59,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:59,573 INFO L276 IsEmpty]: Start isEmpty. Operand 91792 states and 172662 transitions. [2025-01-09 05:24:59,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 05:24:59,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:59,624 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:59,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:24:59,625 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:59,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:59,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1307400661, now seen corresponding path program 1 times [2025-01-09 05:24:59,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:59,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333345762] [2025-01-09 05:24:59,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:59,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:59,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:24:59,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:24:59,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:59,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:59,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:24:59,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:59,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333345762] [2025-01-09 05:24:59,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333345762] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:59,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:59,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:24:59,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069913712] [2025-01-09 05:24:59,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:59,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:24:59,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:59,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:24:59,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:24:59,760 INFO L87 Difference]: Start difference. First operand 91792 states and 172662 transitions. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:03,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:03,804 INFO L93 Difference]: Finished difference Result 220844 states and 430212 transitions. [2025-01-09 05:25:03,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:25:03,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 187 [2025-01-09 05:25:03,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:04,633 INFO L225 Difference]: With dead ends: 220844 [2025-01-09 05:25:04,633 INFO L226 Difference]: Without dead ends: 131194 [2025-01-09 05:25:04,926 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-01-09 05:25:04,927 INFO L435 NwaCegarLoop]: 4416 mSDtfsCounter, 4814 mSDsluCounter, 8668 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4835 SdHoareTripleChecker+Valid, 13084 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:04,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4835 Valid, 13084 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:25:05,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131194 states. [2025-01-09 05:25:09,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131194 to 91792. [2025-01-09 05:25:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91792 states, 86113 states have (on average 1.7472739307653897) internal successors, (150463), 88175 states have internal predecessors, (150463), 2843 states have call successors, (2843), 774 states have call predecessors, (2843), 2834 states have return successors, (19227), 2970 states have call predecessors, (19227), 2843 states have call successors, (19227) [2025-01-09 05:25:10,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91792 states to 91792 states and 172533 transitions. [2025-01-09 05:25:10,394 INFO L78 Accepts]: Start accepts. Automaton has 91792 states and 172533 transitions. Word has length 187 [2025-01-09 05:25:10,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:10,395 INFO L471 AbstractCegarLoop]: Abstraction has 91792 states and 172533 transitions. [2025-01-09 05:25:10,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:10,395 INFO L276 IsEmpty]: Start isEmpty. Operand 91792 states and 172533 transitions. [2025-01-09 05:25:10,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 05:25:10,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:10,417 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:25:10,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:25:10,418 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:10,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:10,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1093232749, now seen corresponding path program 1 times [2025-01-09 05:25:10,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:10,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295606437] [2025-01-09 05:25:10,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:10,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:10,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:25:10,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:25:10,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:10,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:10,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:25:10,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:10,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295606437] [2025-01-09 05:25:10,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295606437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:10,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:10,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:25:10,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898234061] [2025-01-09 05:25:10,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:10,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:25:10,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:10,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:25:10,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:10,573 INFO L87 Difference]: Start difference. First operand 91792 states and 172533 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)