./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.11.cil.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/systemc/transmitter.11.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 940a677bfde7dbbc79e036121bd0ec6fd3518c0f58a02d336e5d42fafb098792 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:18:12,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:18:12,839 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:18:12,843 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:18:12,843 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:18:12,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:18:12,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:18:12,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:18:12,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:18:12,863 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:18:12,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:18:12,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:18:12,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:18:12,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:18:12,863 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:18:12,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:18:12,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:18:12,863 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:18:12,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:18:12,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:18:12,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:18:12,863 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:18:12,864 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:18:12,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:18:12,864 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:18:12,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:18:12,864 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:18:12,864 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:18:12,864 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:18:12,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:18:12,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:18:12,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:18:12,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:18:12,864 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:18:12,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:18:12,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:18:12,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:18:12,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:18:12,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:18:12,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:18:12,866 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:18:12,866 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:18:12,866 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:18:12,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:18:12,866 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:18:12,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:18:12,866 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:18:12,866 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:18:12,866 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 -> 940a677bfde7dbbc79e036121bd0ec6fd3518c0f58a02d336e5d42fafb098792 [2025-01-09 04:18:13,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:18:13,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:18:13,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:18:13,125 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:18:13,125 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:18:13,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.11.cil.c [2025-01-09 04:18:14,280 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/65594bb42/442b3a59763a427d9738703be182feca/FLAGcac4e1070 [2025-01-09 04:18:14,584 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:18:14,585 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.11.cil.c [2025-01-09 04:18:14,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/65594bb42/442b3a59763a427d9738703be182feca/FLAGcac4e1070 [2025-01-09 04:18:14,618 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/65594bb42/442b3a59763a427d9738703be182feca [2025-01-09 04:18:14,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:18:14,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:18:14,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:18:14,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:18:14,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:18:14,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:18:14" (1/1) ... [2025-01-09 04:18:14,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69732950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:14, skipping insertion in model container [2025-01-09 04:18:14,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:18:14" (1/1) ... [2025-01-09 04:18:14,661 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:18:14,780 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/systemc/transmitter.11.cil.c[706,719] [2025-01-09 04:18:14,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:18:14,895 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:18:14,902 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/systemc/transmitter.11.cil.c[706,719] [2025-01-09 04:18:14,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:18:14,964 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:18:14,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:14 WrapperNode [2025-01-09 04:18:14,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:18:14,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:18:14,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:18:14,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:18:14,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:14" (1/1) ... [2025-01-09 04:18:14,982 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:14" (1/1) ... [2025-01-09 04:18:15,007 INFO L138 Inliner]: procedures = 50, calls = 63, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 755 [2025-01-09 04:18:15,007 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:18:15,008 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:18:15,008 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:18:15,008 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:18:15,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:14" (1/1) ... [2025-01-09 04:18:15,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:14" (1/1) ... [2025-01-09 04:18:15,024 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:14" (1/1) ... [2025-01-09 04:18:15,035 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 04:18:15,036 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:14" (1/1) ... [2025-01-09 04:18:15,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:14" (1/1) ... [2025-01-09 04:18:15,046 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:14" (1/1) ... [2025-01-09 04:18:15,048 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:14" (1/1) ... [2025-01-09 04:18:15,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:14" (1/1) ... [2025-01-09 04:18:15,056 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:14" (1/1) ... [2025-01-09 04:18:15,058 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:14" (1/1) ... [2025-01-09 04:18:15,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:18:15,061 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:18:15,061 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:18:15,061 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:18:15,063 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:14" (1/1) ... [2025-01-09 04:18:15,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:18:15,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:18:15,091 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 04:18:15,096 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 04:18:15,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:18:15,114 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 04:18:15,114 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 04:18:15,114 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 04:18:15,114 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 04:18:15,114 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 04:18:15,114 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 04:18:15,114 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 04:18:15,115 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 04:18:15,115 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 04:18:15,115 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 04:18:15,115 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 04:18:15,115 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 04:18:15,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:18:15,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:18:15,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:18:15,221 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:18:15,223 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:18:15,834 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2025-01-09 04:18:15,834 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:18:15,848 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:18:15,849 INFO L312 CfgBuilder]: Removed 15 assume(true) statements. [2025-01-09 04:18:15,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:18:15 BoogieIcfgContainer [2025-01-09 04:18:15,849 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:18:15,851 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:18:15,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:18:15,854 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:18:15,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:18:14" (1/3) ... [2025-01-09 04:18:15,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30157bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:18:15, skipping insertion in model container [2025-01-09 04:18:15,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:14" (2/3) ... [2025-01-09 04:18:15,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30157bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:18:15, skipping insertion in model container [2025-01-09 04:18:15,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:18:15" (3/3) ... [2025-01-09 04:18:15,857 INFO L128 eAbstractionObserver]: Analyzing ICFG transmitter.11.cil.c [2025-01-09 04:18:15,866 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:18:15,868 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG transmitter.11.cil.c that has 7 procedures, 350 locations, 1 initial locations, 15 loop locations, and 1 error locations. [2025-01-09 04:18:15,909 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:18:15,919 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;@72defb0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:18:15,921 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:18:15,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 350 states, 319 states have (on average 1.6144200626959249) internal successors, (515), 320 states have internal predecessors, (515), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 04:18:15,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 04:18:15,938 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:15,939 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] [2025-01-09 04:18:15,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:15,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:15,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1187133265, now seen corresponding path program 1 times [2025-01-09 04:18:15,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:15,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249849556] [2025-01-09 04:18:15,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:15,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:16,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 04:18:16,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 04:18:16,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:16,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:16,271 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 04:18:16,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:16,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249849556] [2025-01-09 04:18:16,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249849556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:16,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:16,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:18:16,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296955857] [2025-01-09 04:18:16,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:16,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:18:16,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:16,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:18:16,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:18:16,297 INFO L87 Difference]: Start difference. First operand has 350 states, 319 states have (on average 1.6144200626959249) internal successors, (515), 320 states have internal predecessors, (515), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 04:18:16,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:16,380 INFO L93 Difference]: Finished difference Result 689 states and 1109 transitions. [2025-01-09 04:18:16,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:18:16,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 173 [2025-01-09 04:18:16,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:16,390 INFO L225 Difference]: With dead ends: 689 [2025-01-09 04:18:16,390 INFO L226 Difference]: Without dead ends: 345 [2025-01-09 04:18:16,396 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 04:18:16,398 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 536 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 544 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 04:18:16,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 544 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:18:16,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-01-09 04:18:16,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-01-09 04:18:16,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 314 states have (on average 1.570063694267516) internal successors, (493), 315 states have internal predecessors, (493), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 04:18:16,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 541 transitions. [2025-01-09 04:18:16,447 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 541 transitions. Word has length 173 [2025-01-09 04:18:16,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:16,450 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 541 transitions. [2025-01-09 04:18:16,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 04:18:16,450 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 541 transitions. [2025-01-09 04:18:16,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 04:18:16,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:16,455 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:16,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:18:16,456 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:16,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:16,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1757405071, now seen corresponding path program 1 times [2025-01-09 04:18:16,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:16,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68560246] [2025-01-09 04:18:16,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:16,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:16,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 04:18:16,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 04:18:16,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:16,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:16,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:16,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:16,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68560246] [2025-01-09 04:18:16,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68560246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:16,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:16,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:18:16,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303048234] [2025-01-09 04:18:16,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:16,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:18:16,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:16,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:18:16,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:18:16,747 INFO L87 Difference]: Start difference. First operand 345 states and 541 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 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 04:18:17,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:17,379 INFO L93 Difference]: Finished difference Result 1039 states and 1659 transitions. [2025-01-09 04:18:17,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:18:17,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 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 173 [2025-01-09 04:18:17,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:17,385 INFO L225 Difference]: With dead ends: 1039 [2025-01-09 04:18:17,385 INFO L226 Difference]: Without dead ends: 713 [2025-01-09 04:18:17,387 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 04:18:17,388 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 1042 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1060 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:17,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1060 Valid, 1612 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:18:17,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-01-09 04:18:17,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 686. [2025-01-09 04:18:17,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 629 states have (on average 1.5802861685214626) internal successors, (994), 631 states have internal predecessors, (994), 43 states have call successors, (43), 12 states have call predecessors, (43), 13 states have return successors, (44), 43 states have call predecessors, (44), 43 states have call successors, (44) [2025-01-09 04:18:17,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1081 transitions. [2025-01-09 04:18:17,456 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1081 transitions. Word has length 173 [2025-01-09 04:18:17,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:17,456 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 1081 transitions. [2025-01-09 04:18:17,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 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 04:18:17,457 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1081 transitions. [2025-01-09 04:18:17,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 04:18:17,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:17,458 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] [2025-01-09 04:18:17,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:18:17,459 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:17,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:17,459 INFO L85 PathProgramCache]: Analyzing trace with hash 623851890, now seen corresponding path program 1 times [2025-01-09 04:18:17,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:17,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255929457] [2025-01-09 04:18:17,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:17,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:17,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 04:18:17,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 04:18:17,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:17,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:17,658 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 04:18:17,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:17,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255929457] [2025-01-09 04:18:17,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255929457] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:17,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:17,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:17,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186901453] [2025-01-09 04:18:17,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:17,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:17,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:17,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:17,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:17,661 INFO L87 Difference]: Start difference. First operand 686 states and 1081 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 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 04:18:18,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:18,575 INFO L93 Difference]: Finished difference Result 1873 states and 2981 transitions. [2025-01-09 04:18:18,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:18,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 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 173 [2025-01-09 04:18:18,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:18,581 INFO L225 Difference]: With dead ends: 1873 [2025-01-09 04:18:18,581 INFO L226 Difference]: Without dead ends: 1206 [2025-01-09 04:18:18,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:18:18,583 INFO L435 NwaCegarLoop]: 712 mSDtfsCounter, 1164 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 2861 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:18,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 2861 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:18:18,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2025-01-09 04:18:18,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1003. [2025-01-09 04:18:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 920 states have (on average 1.5728260869565218) internal successors, (1447), 923 states have internal predecessors, (1447), 62 states have call successors, (62), 18 states have call predecessors, (62), 20 states have return successors, (66), 63 states have call predecessors, (66), 62 states have call successors, (66) [2025-01-09 04:18:18,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1575 transitions. [2025-01-09 04:18:18,626 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1575 transitions. Word has length 173 [2025-01-09 04:18:18,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:18,627 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1575 transitions. [2025-01-09 04:18:18,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 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 04:18:18,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1575 transitions. [2025-01-09 04:18:18,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 04:18:18,631 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:18,631 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] [2025-01-09 04:18:18,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:18:18,631 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:18,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:18,633 INFO L85 PathProgramCache]: Analyzing trace with hash 2070432756, now seen corresponding path program 1 times [2025-01-09 04:18:18,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:18,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055874087] [2025-01-09 04:18:18,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:18,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:18,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 04:18:18,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 04:18:18,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:18,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:18,841 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 04:18:18,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:18,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055874087] [2025-01-09 04:18:18,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055874087] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:18,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:18,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:18,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311745602] [2025-01-09 04:18:18,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:18,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:18,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:18,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:18,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:18,844 INFO L87 Difference]: Start difference. First operand 1003 states and 1575 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 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 04:18:19,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:19,755 INFO L93 Difference]: Finished difference Result 2885 states and 4584 transitions. [2025-01-09 04:18:19,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:19,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 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 173 [2025-01-09 04:18:19,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:19,764 INFO L225 Difference]: With dead ends: 2885 [2025-01-09 04:18:19,764 INFO L226 Difference]: Without dead ends: 1901 [2025-01-09 04:18:19,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:18:19,767 INFO L435 NwaCegarLoop]: 708 mSDtfsCounter, 1159 mSDsluCounter, 2137 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 2845 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:19,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 2845 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:18:19,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2025-01-09 04:18:19,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1680. [2025-01-09 04:18:19,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1680 states, 1543 states have (on average 1.576150356448477) internal successors, (2432), 1550 states have internal predecessors, (2432), 100 states have call successors, (100), 30 states have call predecessors, (100), 36 states have return successors, (116), 103 states have call predecessors, (116), 100 states have call successors, (116) [2025-01-09 04:18:19,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2648 transitions. [2025-01-09 04:18:19,831 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2648 transitions. Word has length 173 [2025-01-09 04:18:19,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:19,831 INFO L471 AbstractCegarLoop]: Abstraction has 1680 states and 2648 transitions. [2025-01-09 04:18:19,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 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 04:18:19,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2648 transitions. [2025-01-09 04:18:19,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 04:18:19,834 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:19,834 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] [2025-01-09 04:18:19,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:18:19,834 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:19,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:19,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1147265330, now seen corresponding path program 1 times [2025-01-09 04:18:19,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:19,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535419803] [2025-01-09 04:18:19,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:19,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:19,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 04:18:19,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 04:18:19,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:19,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:19,973 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 04:18:19,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:19,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535419803] [2025-01-09 04:18:19,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535419803] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:19,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:19,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:19,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174028136] [2025-01-09 04:18:19,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:19,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:19,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:19,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:19,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:19,976 INFO L87 Difference]: Start difference. First operand 1680 states and 2648 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 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 04:18:20,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:20,850 INFO L93 Difference]: Finished difference Result 5076 states and 8127 transitions. [2025-01-09 04:18:20,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:20,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 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 173 [2025-01-09 04:18:20,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:20,866 INFO L225 Difference]: With dead ends: 5076 [2025-01-09 04:18:20,866 INFO L226 Difference]: Without dead ends: 3415 [2025-01-09 04:18:20,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:18:20,871 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 1154 mSDsluCounter, 2128 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1172 SdHoareTripleChecker+Valid, 2833 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:20,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1172 Valid, 2833 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:18:20,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3415 states. [2025-01-09 04:18:20,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3415 to 3157. [2025-01-09 04:18:20,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3157 states, 2906 states have (on average 1.5925671025464556) internal successors, (4628), 2927 states have internal predecessors, (4628), 176 states have call successors, (176), 54 states have call predecessors, (176), 74 states have return successors, (240), 183 states have call predecessors, (240), 176 states have call successors, (240) [2025-01-09 04:18:21,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3157 states to 3157 states and 5044 transitions. [2025-01-09 04:18:21,006 INFO L78 Accepts]: Start accepts. Automaton has 3157 states and 5044 transitions. Word has length 173 [2025-01-09 04:18:21,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:21,006 INFO L471 AbstractCegarLoop]: Abstraction has 3157 states and 5044 transitions. [2025-01-09 04:18:21,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 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 04:18:21,006 INFO L276 IsEmpty]: Start isEmpty. Operand 3157 states and 5044 transitions. [2025-01-09 04:18:21,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 04:18:21,010 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:21,010 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] [2025-01-09 04:18:21,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:18:21,011 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:21,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:21,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1533127732, now seen corresponding path program 1 times [2025-01-09 04:18:21,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:21,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341360978] [2025-01-09 04:18:21,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:21,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:21,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 04:18:21,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 04:18:21,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:21,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:21,171 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 04:18:21,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:21,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341360978] [2025-01-09 04:18:21,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341360978] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:21,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:21,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:21,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732682649] [2025-01-09 04:18:21,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:21,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:21,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:21,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:21,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:21,173 INFO L87 Difference]: Start difference. First operand 3157 states and 5044 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 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 04:18:22,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:22,105 INFO L93 Difference]: Finished difference Result 9931 states and 16201 transitions. [2025-01-09 04:18:22,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:22,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 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 173 [2025-01-09 04:18:22,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:22,137 INFO L225 Difference]: With dead ends: 9931 [2025-01-09 04:18:22,137 INFO L226 Difference]: Without dead ends: 6793 [2025-01-09 04:18:22,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:18:22,148 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 1149 mSDsluCounter, 2119 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 2821 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:22,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 2821 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:18:22,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6793 states. [2025-01-09 04:18:22,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6793 to 6462. [2025-01-09 04:18:22,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6462 states, 5965 states have (on average 1.6201173512154232) internal successors, (9664), 6032 states have internal predecessors, (9664), 328 states have call successors, (328), 102 states have call predecessors, (328), 168 states have return successors, (584), 343 states have call predecessors, (584), 328 states have call successors, (584) [2025-01-09 04:18:22,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6462 states to 6462 states and 10576 transitions. [2025-01-09 04:18:22,383 INFO L78 Accepts]: Start accepts. Automaton has 6462 states and 10576 transitions. Word has length 173 [2025-01-09 04:18:22,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:22,383 INFO L471 AbstractCegarLoop]: Abstraction has 6462 states and 10576 transitions. [2025-01-09 04:18:22,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 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 04:18:22,384 INFO L276 IsEmpty]: Start isEmpty. Operand 6462 states and 10576 transitions. [2025-01-09 04:18:22,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 04:18:22,393 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:22,393 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:22,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:18:22,393 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:22,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:22,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1268480242, now seen corresponding path program 1 times [2025-01-09 04:18:22,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:22,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786359008] [2025-01-09 04:18:22,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:22,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:22,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 04:18:22,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 04:18:22,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:22,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:22,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:22,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:22,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786359008] [2025-01-09 04:18:22,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786359008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:22,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:22,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:22,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494802261] [2025-01-09 04:18:22,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:22,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:22,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:22,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:22,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:22,554 INFO L87 Difference]: Start difference. First operand 6462 states and 10576 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 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 04:18:23,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:23,653 INFO L93 Difference]: Finished difference Result 20986 states and 35291 transitions. [2025-01-09 04:18:23,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:23,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 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 173 [2025-01-09 04:18:23,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:23,724 INFO L225 Difference]: With dead ends: 20986 [2025-01-09 04:18:23,725 INFO L226 Difference]: Without dead ends: 14543 [2025-01-09 04:18:23,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:18:23,771 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 1144 mSDsluCounter, 2110 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 2809 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:23,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 2809 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:18:23,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14543 states. [2025-01-09 04:18:24,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14543 to 14071. [2025-01-09 04:18:24,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14071 states, 13028 states have (on average 1.6552041756217377) internal successors, (21564), 13241 states have internal predecessors, (21564), 632 states have call successors, (632), 198 states have call predecessors, (632), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-01-09 04:18:24,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14071 states to 14071 states and 23852 transitions. [2025-01-09 04:18:24,260 INFO L78 Accepts]: Start accepts. Automaton has 14071 states and 23852 transitions. Word has length 173 [2025-01-09 04:18:24,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:24,260 INFO L471 AbstractCegarLoop]: Abstraction has 14071 states and 23852 transitions. [2025-01-09 04:18:24,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 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 04:18:24,261 INFO L276 IsEmpty]: Start isEmpty. Operand 14071 states and 23852 transitions. [2025-01-09 04:18:24,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 04:18:24,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:24,273 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] [2025-01-09 04:18:24,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:18:24,273 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:24,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:24,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1095361420, now seen corresponding path program 1 times [2025-01-09 04:18:24,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:24,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622147056] [2025-01-09 04:18:24,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:24,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:24,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 04:18:24,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 04:18:24,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:24,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:24,379 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 04:18:24,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:24,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622147056] [2025-01-09 04:18:24,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622147056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:24,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:24,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:18:24,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493403450] [2025-01-09 04:18:24,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:24,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:18:24,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:24,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:18:24,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:18:24,381 INFO L87 Difference]: Start difference. First operand 14071 states and 23852 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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 04:18:25,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:25,129 INFO L93 Difference]: Finished difference Result 32288 states and 56359 transitions. [2025-01-09 04:18:25,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:18:25,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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 173 [2025-01-09 04:18:25,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:25,208 INFO L225 Difference]: With dead ends: 32288 [2025-01-09 04:18:25,209 INFO L226 Difference]: Without dead ends: 18236 [2025-01-09 04:18:25,254 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 04:18:25,254 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 764 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:25,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 974 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:18:25,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18236 states. [2025-01-09 04:18:25,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18236 to 14071. [2025-01-09 04:18:25,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14071 states, 13028 states have (on average 1.6526711697881487) internal successors, (21531), 13241 states have internal predecessors, (21531), 632 states have call successors, (632), 198 states have call predecessors, (632), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-01-09 04:18:25,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14071 states to 14071 states and 23819 transitions. [2025-01-09 04:18:25,894 INFO L78 Accepts]: Start accepts. Automaton has 14071 states and 23819 transitions. Word has length 173 [2025-01-09 04:18:25,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:25,894 INFO L471 AbstractCegarLoop]: Abstraction has 14071 states and 23819 transitions. [2025-01-09 04:18:25,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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 04:18:25,895 INFO L276 IsEmpty]: Start isEmpty. Operand 14071 states and 23819 transitions. [2025-01-09 04:18:25,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 04:18:25,907 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:25,908 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] [2025-01-09 04:18:25,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:18:25,908 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:25,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:25,909 INFO L85 PathProgramCache]: Analyzing trace with hash 801618038, now seen corresponding path program 1 times [2025-01-09 04:18:25,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:25,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108199431] [2025-01-09 04:18:25,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:25,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:25,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 04:18:25,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 04:18:25,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:25,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:26,034 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 04:18:26,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:26,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108199431] [2025-01-09 04:18:26,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108199431] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:26,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:26,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:26,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29766994] [2025-01-09 04:18:26,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:26,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:26,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:26,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:26,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:26,035 INFO L87 Difference]: Start difference. First operand 14071 states and 23819 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 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 04:18:27,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:27,388 INFO L93 Difference]: Finished difference Result 46361 states and 81150 transitions. [2025-01-09 04:18:27,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:27,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 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 173 [2025-01-09 04:18:27,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:27,496 INFO L225 Difference]: With dead ends: 46361 [2025-01-09 04:18:27,496 INFO L226 Difference]: Without dead ends: 32309 [2025-01-09 04:18:27,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:18:27,528 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 1128 mSDsluCounter, 2077 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 2764 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:27,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 2764 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:18:27,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32309 states. [2025-01-09 04:18:28,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32309 to 31638. [2025-01-09 04:18:28,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31638 states, 29341 states have (on average 1.686888654101769) internal successors, (49495), 30008 states have internal predecessors, (49495), 1240 states have call successors, (1240), 390 states have call predecessors, (1240), 1056 states have return successors, (5336), 1303 states have call predecessors, (5336), 1240 states have call successors, (5336) [2025-01-09 04:18:28,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31638 states to 31638 states and 56071 transitions. [2025-01-09 04:18:28,808 INFO L78 Accepts]: Start accepts. Automaton has 31638 states and 56071 transitions. Word has length 173 [2025-01-09 04:18:28,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:28,808 INFO L471 AbstractCegarLoop]: Abstraction has 31638 states and 56071 transitions. [2025-01-09 04:18:28,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 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 04:18:28,808 INFO L276 IsEmpty]: Start isEmpty. Operand 31638 states and 56071 transitions. [2025-01-09 04:18:28,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 04:18:28,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:28,835 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] [2025-01-09 04:18:28,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:18:28,836 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:28,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:28,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1139905588, now seen corresponding path program 1 times [2025-01-09 04:18:28,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:28,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546128495] [2025-01-09 04:18:28,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:28,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:28,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 04:18:28,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 04:18:28,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:28,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:28,982 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 04:18:28,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:28,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546128495] [2025-01-09 04:18:28,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546128495] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:28,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:28,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:28,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704746811] [2025-01-09 04:18:28,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:28,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:28,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:28,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:28,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:28,984 INFO L87 Difference]: Start difference. First operand 31638 states and 56071 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 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 04:18:31,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:31,185 INFO L93 Difference]: Finished difference Result 106554 states and 197544 transitions. [2025-01-09 04:18:31,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:31,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 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 173 [2025-01-09 04:18:31,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:31,495 INFO L225 Difference]: With dead ends: 106554 [2025-01-09 04:18:31,495 INFO L226 Difference]: Without dead ends: 74935 [2025-01-09 04:18:31,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:18:31,597 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 1123 mSDsluCounter, 2068 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 2752 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:31,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1141 Valid, 2752 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:18:31,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74935 states. [2025-01-09 04:18:34,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74935 to 73819. [2025-01-09 04:18:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73819 states, 68528 states have (on average 1.722317884660285) internal successors, (118027), 70589 states have internal predecessors, (118027), 2456 states have call successors, (2456), 774 states have call predecessors, (2456), 2834 states have return successors, (18840), 2583 states have call predecessors, (18840), 2456 states have call successors, (18840) [2025-01-09 04:18:34,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73819 states to 73819 states and 139323 transitions. [2025-01-09 04:18:34,710 INFO L78 Accepts]: Start accepts. Automaton has 73819 states and 139323 transitions. Word has length 173 [2025-01-09 04:18:34,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:34,711 INFO L471 AbstractCegarLoop]: Abstraction has 73819 states and 139323 transitions. [2025-01-09 04:18:34,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 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 04:18:34,711 INFO L276 IsEmpty]: Start isEmpty. Operand 73819 states and 139323 transitions. [2025-01-09 04:18:34,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 04:18:34,752 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:34,752 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] [2025-01-09 04:18:34,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:18:34,752 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:34,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:34,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1566460086, now seen corresponding path program 1 times [2025-01-09 04:18:34,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:34,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209546159] [2025-01-09 04:18:34,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:34,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:34,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 04:18:34,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 04:18:34,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:34,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:34,863 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 04:18:34,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:34,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209546159] [2025-01-09 04:18:34,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209546159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:34,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:34,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:34,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828503500] [2025-01-09 04:18:34,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:34,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:34,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:34,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:34,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:34,865 INFO L87 Difference]: Start difference. First operand 73819 states and 139323 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 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 04:18:39,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:39,616 INFO L93 Difference]: Finished difference Result 253609 states and 508462 transitions. [2025-01-09 04:18:39,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:39,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 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 173 [2025-01-09 04:18:39,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:40,602 INFO L225 Difference]: With dead ends: 253609 [2025-01-09 04:18:40,602 INFO L226 Difference]: Without dead ends: 179809 [2025-01-09 04:18:40,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:18:40,987 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 1118 mSDsluCounter, 2059 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1136 SdHoareTripleChecker+Valid, 2740 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:40,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1136 Valid, 2740 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:18:41,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179809 states. [2025-01-09 04:18:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179809 to 177864. [2025-01-09 04:18:48,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177864 states, 165127 states have (on average 1.7563390602384832) internal successors, (290019), 171434 states have internal predecessors, (290019), 4888 states have call successors, (4888), 1542 states have call predecessors, (4888), 7848 states have return successors, (70424), 5143 states have call predecessors, (70424), 4888 states have call successors, (70424) [2025-01-09 04:18:49,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177864 states to 177864 states and 365331 transitions. [2025-01-09 04:18:49,674 INFO L78 Accepts]: Start accepts. Automaton has 177864 states and 365331 transitions. Word has length 173 [2025-01-09 04:18:49,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:49,675 INFO L471 AbstractCegarLoop]: Abstraction has 177864 states and 365331 transitions. [2025-01-09 04:18:49,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 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 04:18:49,675 INFO L276 IsEmpty]: Start isEmpty. Operand 177864 states and 365331 transitions. [2025-01-09 04:18:49,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 04:18:49,761 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:49,761 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] [2025-01-09 04:18:49,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:18:49,761 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:49,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:49,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1026030580, now seen corresponding path program 1 times [2025-01-09 04:18:49,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:49,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668139756] [2025-01-09 04:18:49,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:49,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:49,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 04:18:49,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 04:18:49,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:49,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:49,860 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 04:18:49,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:49,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668139756] [2025-01-09 04:18:49,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668139756] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:49,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:49,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:18:49,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206591681] [2025-01-09 04:18:49,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:49,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:18:49,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:49,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:18:49,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:18:49,862 INFO L87 Difference]: Start difference. First operand 177864 states and 365331 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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)