./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.04.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.04.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 1de07d37d630bd073064bf436fb9512b72ab982b0eaf3fcb1582f689c57482fa --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:17:56,678 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:17:56,734 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:17:56,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:17:56,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:17:56,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:17:56,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:17:56,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:17:56,760 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:17:56,760 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:17:56,760 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:17:56,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:17:56,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:17:56,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:17:56,760 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:17:56,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:17:56,760 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:17:56,761 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:17:56,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:17:56,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:17:56,761 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:17:56,761 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:17:56,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:17:56,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:17:56,761 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:17:56,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:17:56,761 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:17:56,761 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:17:56,761 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:17:56,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:17:56,761 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:17:56,761 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:17:56,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:17:56,761 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:17:56,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:17:56,761 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:17:56,761 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:17:56,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:17:56,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:17:56,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:17:56,762 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:17:56,762 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:17:56,762 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:17:56,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:17:56,762 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:17:56,762 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:17:56,762 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:17:56,762 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:17:56,763 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 -> 1de07d37d630bd073064bf436fb9512b72ab982b0eaf3fcb1582f689c57482fa [2025-01-09 04:17:57,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:17:57,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:17:57,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:17:57,128 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:17:57,128 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:17:57,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.04.cil.c [2025-01-09 04:17:58,395 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66d991a17/1291fa279fbc4062bf22d5c709664fec/FLAG6c28052da [2025-01-09 04:17:58,690 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:17:58,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.04.cil.c [2025-01-09 04:17:58,708 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66d991a17/1291fa279fbc4062bf22d5c709664fec/FLAG6c28052da [2025-01-09 04:17:58,726 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66d991a17/1291fa279fbc4062bf22d5c709664fec [2025-01-09 04:17:58,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:17:58,731 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:17:58,732 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:17:58,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:17:58,737 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:17:58,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:17:58" (1/1) ... [2025-01-09 04:17:58,739 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c834e46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:58, skipping insertion in model container [2025-01-09 04:17:58,739 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:17:58" (1/1) ... [2025-01-09 04:17:58,768 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:17:58,885 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.04.cil.c[706,719] [2025-01-09 04:17:58,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:17:58,975 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:17:58,982 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.04.cil.c[706,719] [2025-01-09 04:17:59,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:17:59,040 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:17:59,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:59 WrapperNode [2025-01-09 04:17:59,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:17:59,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:17:59,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:17:59,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:17:59,047 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:17:59" (1/1) ... [2025-01-09 04:17:59,054 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:17:59" (1/1) ... [2025-01-09 04:17:59,074 INFO L138 Inliner]: procedures = 36, calls = 42, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 363 [2025-01-09 04:17:59,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:17:59,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:17:59,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:17:59,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:17:59,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:59" (1/1) ... [2025-01-09 04:17:59,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:59" (1/1) ... [2025-01-09 04:17:59,086 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:59" (1/1) ... [2025-01-09 04:17:59,096 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:17:59,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:59" (1/1) ... [2025-01-09 04:17:59,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:59" (1/1) ... [2025-01-09 04:17:59,101 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:59" (1/1) ... [2025-01-09 04:17:59,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:59" (1/1) ... [2025-01-09 04:17:59,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:59" (1/1) ... [2025-01-09 04:17:59,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:59" (1/1) ... [2025-01-09 04:17:59,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:59" (1/1) ... [2025-01-09 04:17:59,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:17:59,111 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:17:59,112 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:17:59,112 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:17:59,112 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:59" (1/1) ... [2025-01-09 04:17:59,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:17:59,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:17:59,137 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:17:59,141 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:17:59,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:17:59,159 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 04:17:59,159 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 04:17:59,159 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 04:17:59,159 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 04:17:59,159 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 04:17:59,159 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 04:17:59,159 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 04:17:59,159 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 04:17:59,159 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 04:17:59,159 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 04:17:59,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:17:59,159 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 04:17:59,159 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 04:17:59,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:17:59,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:17:59,235 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:17:59,241 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:17:59,604 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2025-01-09 04:17:59,604 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:17:59,624 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:17:59,624 INFO L312 CfgBuilder]: Removed 8 assume(true) statements. [2025-01-09 04:17:59,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:17:59 BoogieIcfgContainer [2025-01-09 04:17:59,625 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:17:59,631 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:17:59,631 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:17:59,635 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:17:59,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:17:58" (1/3) ... [2025-01-09 04:17:59,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67adb4c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:17:59, skipping insertion in model container [2025-01-09 04:17:59,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:59" (2/3) ... [2025-01-09 04:17:59,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67adb4c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:17:59, skipping insertion in model container [2025-01-09 04:17:59,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:17:59" (3/3) ... [2025-01-09 04:17:59,637 INFO L128 eAbstractionObserver]: Analyzing ICFG transmitter.04.cil.c [2025-01-09 04:17:59,649 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:17:59,651 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG transmitter.04.cil.c that has 7 procedures, 175 locations, 1 initial locations, 8 loop locations, and 1 error locations. [2025-01-09 04:17:59,700 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:17:59,712 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;@683b7aa4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:17:59,713 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:17:59,717 INFO L276 IsEmpty]: Start isEmpty. Operand has 175 states, 151 states have (on average 1.5562913907284768) internal successors, (235), 152 states have internal predecessors, (235), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 04:17:59,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:17:59,725 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:59,726 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] [2025-01-09 04:17:59,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:59,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:59,731 INFO L85 PathProgramCache]: Analyzing trace with hash 328959619, now seen corresponding path program 1 times [2025-01-09 04:17:59,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:59,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472965487] [2025-01-09 04:17:59,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:59,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:59,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:17:59,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:17:59,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:59,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:00,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:00,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:00,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472965487] [2025-01-09 04:18:00,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472965487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:00,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:00,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:18:00,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667109864] [2025-01-09 04:18:00,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:00,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:18:00,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:00,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:18:00,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:18:00,249 INFO L87 Difference]: Start difference. First operand has 175 states, 151 states have (on average 1.5562913907284768) internal successors, (235), 152 states have internal predecessors, (235), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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:00,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:00,698 INFO L93 Difference]: Finished difference Result 513 states and 804 transitions. [2025-01-09 04:18:00,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:18:00,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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 89 [2025-01-09 04:18:00,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:00,724 INFO L225 Difference]: With dead ends: 513 [2025-01-09 04:18:00,724 INFO L226 Difference]: Without dead ends: 342 [2025-01-09 04:18:00,729 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:00,731 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 452 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:00,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 696 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:18:00,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-01-09 04:18:00,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 329. [2025-01-09 04:18:00,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 286 states have (on average 1.520979020979021) internal successors, (435), 288 states have internal predecessors, (435), 29 states have call successors, (29), 12 states have call predecessors, (29), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2025-01-09 04:18:00,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 494 transitions. [2025-01-09 04:18:00,792 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 494 transitions. Word has length 89 [2025-01-09 04:18:00,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:00,793 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 494 transitions. [2025-01-09 04:18:00,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 494 transitions. [2025-01-09 04:18:00,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:18:00,795 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:00,795 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] [2025-01-09 04:18:00,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:18:00,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:00,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:00,796 INFO L85 PathProgramCache]: Analyzing trace with hash -389545054, now seen corresponding path program 1 times [2025-01-09 04:18:00,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:00,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601699601] [2025-01-09 04:18:00,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:00,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:00,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:18:00,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:18:00,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:00,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:00,978 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:00,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:00,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601699601] [2025-01-09 04:18:00,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601699601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:00,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:00,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:00,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792870310] [2025-01-09 04:18:00,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:00,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:00,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:00,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:00,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:00,981 INFO L87 Difference]: Start difference. First operand 329 states and 494 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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:01,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:01,792 INFO L93 Difference]: Finished difference Result 879 states and 1330 transitions. [2025-01-09 04:18:01,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:01,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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 89 [2025-01-09 04:18:01,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:01,797 INFO L225 Difference]: With dead ends: 879 [2025-01-09 04:18:01,797 INFO L226 Difference]: Without dead ends: 562 [2025-01-09 04:18:01,802 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:01,802 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 486 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:01,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 1255 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:18:01,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-01-09 04:18:01,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 478. [2025-01-09 04:18:01,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 416 states have (on average 1.5120192307692308) internal successors, (629), 419 states have internal predecessors, (629), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (45), 42 states have call predecessors, (45), 41 states have call successors, (45) [2025-01-09 04:18:01,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 715 transitions. [2025-01-09 04:18:01,863 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 715 transitions. Word has length 89 [2025-01-09 04:18:01,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:01,863 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 715 transitions. [2025-01-09 04:18:01,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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:01,864 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 715 transitions. [2025-01-09 04:18:01,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:18:01,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:01,869 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] [2025-01-09 04:18:01,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:18:01,870 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:01,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:01,870 INFO L85 PathProgramCache]: Analyzing trace with hash 497677792, now seen corresponding path program 1 times [2025-01-09 04:18:01,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:01,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284823166] [2025-01-09 04:18:01,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:01,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:01,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:18:01,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:18:01,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:01,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:02,065 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:02,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:02,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284823166] [2025-01-09 04:18:02,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284823166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:02,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:02,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:02,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990300349] [2025-01-09 04:18:02,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:02,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:02,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:02,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:02,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:02,067 INFO L87 Difference]: Start difference. First operand 478 states and 715 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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:02,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:02,621 INFO L93 Difference]: Finished difference Result 1345 states and 2030 transitions. [2025-01-09 04:18:02,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:02,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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 89 [2025-01-09 04:18:02,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:02,626 INFO L225 Difference]: With dead ends: 1345 [2025-01-09 04:18:02,626 INFO L226 Difference]: Without dead ends: 879 [2025-01-09 04:18:02,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:18:02,627 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 481 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:02,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 1239 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:18:02,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-01-09 04:18:02,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 791. [2025-01-09 04:18:02,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 689 states have (on average 1.509433962264151) internal successors, (1040), 696 states have internal predecessors, (1040), 65 states have call successors, (65), 30 states have call predecessors, (65), 36 states have return successors, (81), 68 states have call predecessors, (81), 65 states have call successors, (81) [2025-01-09 04:18:02,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1186 transitions. [2025-01-09 04:18:02,691 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1186 transitions. Word has length 89 [2025-01-09 04:18:02,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:02,691 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 1186 transitions. [2025-01-09 04:18:02,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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:02,691 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1186 transitions. [2025-01-09 04:18:02,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:18:02,693 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:02,693 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] [2025-01-09 04:18:02,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:18:02,693 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:02,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:02,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1413364766, now seen corresponding path program 1 times [2025-01-09 04:18:02,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:02,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818781608] [2025-01-09 04:18:02,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:02,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:02,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:18:02,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:18:02,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:02,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:02,793 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:02,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:02,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818781608] [2025-01-09 04:18:02,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818781608] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:02,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:02,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:02,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677339549] [2025-01-09 04:18:02,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:02,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:02,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:02,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:02,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:02,795 INFO L87 Difference]: Start difference. First operand 791 states and 1186 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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:03,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:03,290 INFO L93 Difference]: Finished difference Result 2332 states and 3543 transitions. [2025-01-09 04:18:03,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:03,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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 89 [2025-01-09 04:18:03,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:03,298 INFO L225 Difference]: With dead ends: 2332 [2025-01-09 04:18:03,298 INFO L226 Difference]: Without dead ends: 1553 [2025-01-09 04:18:03,301 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:03,301 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 494 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:03,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 864 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:18:03,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2025-01-09 04:18:03,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 1456. [2025-01-09 04:18:03,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1268 states have (on average 1.5141955835962144) internal successors, (1920), 1289 states have internal predecessors, (1920), 113 states have call successors, (113), 54 states have call predecessors, (113), 74 states have return successors, (177), 120 states have call predecessors, (177), 113 states have call successors, (177) [2025-01-09 04:18:03,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 2210 transitions. [2025-01-09 04:18:03,390 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 2210 transitions. Word has length 89 [2025-01-09 04:18:03,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:03,390 INFO L471 AbstractCegarLoop]: Abstraction has 1456 states and 2210 transitions. [2025-01-09 04:18:03,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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:03,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 2210 transitions. [2025-01-09 04:18:03,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:18:03,393 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:03,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] [2025-01-09 04:18:03,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:18:03,393 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:03,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:03,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1336463968, now seen corresponding path program 1 times [2025-01-09 04:18:03,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:03,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668962933] [2025-01-09 04:18:03,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:03,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:03,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:18:03,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:18:03,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:03,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:03,507 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:03,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:03,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668962933] [2025-01-09 04:18:03,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668962933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:03,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:03,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:03,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404306693] [2025-01-09 04:18:03,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:03,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:03,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:03,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:03,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:03,509 INFO L87 Difference]: Start difference. First operand 1456 states and 2210 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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:04,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:04,036 INFO L93 Difference]: Finished difference Result 4443 states and 6885 transitions. [2025-01-09 04:18:04,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:04,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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 89 [2025-01-09 04:18:04,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:04,050 INFO L225 Difference]: With dead ends: 4443 [2025-01-09 04:18:04,051 INFO L226 Difference]: Without dead ends: 2999 [2025-01-09 04:18:04,055 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:04,056 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 471 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:04,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 1215 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:18:04,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2025-01-09 04:18:04,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 2885. [2025-01-09 04:18:04,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2885 states, 2507 states have (on average 1.523733546071001) internal successors, (3820), 2574 states have internal predecessors, (3820), 209 states have call successors, (209), 102 states have call predecessors, (209), 168 states have return successors, (465), 224 states have call predecessors, (465), 209 states have call successors, (465) [2025-01-09 04:18:04,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2885 states to 2885 states and 4494 transitions. [2025-01-09 04:18:04,231 INFO L78 Accepts]: Start accepts. Automaton has 2885 states and 4494 transitions. Word has length 89 [2025-01-09 04:18:04,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:04,234 INFO L471 AbstractCegarLoop]: Abstraction has 2885 states and 4494 transitions. [2025-01-09 04:18:04,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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:04,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2885 states and 4494 transitions. [2025-01-09 04:18:04,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:18:04,241 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:04,241 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] [2025-01-09 04:18:04,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:18:04,241 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:04,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:04,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1991152674, now seen corresponding path program 1 times [2025-01-09 04:18:04,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:04,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042019934] [2025-01-09 04:18:04,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:04,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:04,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:18:04,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:18:04,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:04,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:04,373 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:04,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:04,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042019934] [2025-01-09 04:18:04,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042019934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:04,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:04,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:04,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666323806] [2025-01-09 04:18:04,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:04,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:04,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:04,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:04,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:04,374 INFO L87 Difference]: Start difference. First operand 2885 states and 4494 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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:05,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:05,035 INFO L93 Difference]: Finished difference Result 9418 states and 15104 transitions. [2025-01-09 04:18:05,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:05,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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 89 [2025-01-09 04:18:05,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:05,067 INFO L225 Difference]: With dead ends: 9418 [2025-01-09 04:18:05,067 INFO L226 Difference]: Without dead ends: 6545 [2025-01-09 04:18:05,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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:05,078 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 499 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:05,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1186 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:18:05,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6545 states. [2025-01-09 04:18:05,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6545 to 5938. [2025-01-09 04:18:05,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5938 states, 5142 states have (on average 1.5371450797355115) internal successors, (7904), 5355 states have internal predecessors, (7904), 385 states have call successors, (385), 198 states have call predecessors, (385), 410 states have return successors, (1409), 416 states have call predecessors, (1409), 385 states have call successors, (1409) [2025-01-09 04:18:05,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5938 states to 5938 states and 9698 transitions. [2025-01-09 04:18:05,459 INFO L78 Accepts]: Start accepts. Automaton has 5938 states and 9698 transitions. Word has length 89 [2025-01-09 04:18:05,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:05,460 INFO L471 AbstractCegarLoop]: Abstraction has 5938 states and 9698 transitions. [2025-01-09 04:18:05,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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:05,460 INFO L276 IsEmpty]: Start isEmpty. Operand 5938 states and 9698 transitions. [2025-01-09 04:18:05,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:18:05,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:05,466 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] [2025-01-09 04:18:05,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:18:05,467 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:05,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:05,467 INFO L85 PathProgramCache]: Analyzing trace with hash -395356832, now seen corresponding path program 1 times [2025-01-09 04:18:05,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:05,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352667332] [2025-01-09 04:18:05,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:05,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:05,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:18:05,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:18:05,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:05,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:05,546 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:05,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:05,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352667332] [2025-01-09 04:18:05,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352667332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:05,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:05,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:05,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891374697] [2025-01-09 04:18:05,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:05,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:05,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:05,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:05,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:05,548 INFO L87 Difference]: Start difference. First operand 5938 states and 9698 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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:06,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:06,335 INFO L93 Difference]: Finished difference Result 19381 states and 33246 transitions. [2025-01-09 04:18:06,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:06,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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 89 [2025-01-09 04:18:06,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:06,402 INFO L225 Difference]: With dead ends: 19381 [2025-01-09 04:18:06,402 INFO L226 Difference]: Without dead ends: 13455 [2025-01-09 04:18:06,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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:06,421 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 535 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:06,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1174 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:18:06,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13455 states. [2025-01-09 04:18:07,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13455 to 12563. [2025-01-09 04:18:07,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12563 states, 10785 states have (on average 1.5458507185906352) internal successors, (16672), 11452 states have internal predecessors, (16672), 721 states have call successors, (721), 390 states have call predecessors, (721), 1056 states have return successors, (4817), 784 states have call predecessors, (4817), 721 states have call successors, (4817) [2025-01-09 04:18:07,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12563 states to 12563 states and 22210 transitions. [2025-01-09 04:18:07,219 INFO L78 Accepts]: Start accepts. Automaton has 12563 states and 22210 transitions. Word has length 89 [2025-01-09 04:18:07,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:07,219 INFO L471 AbstractCegarLoop]: Abstraction has 12563 states and 22210 transitions. [2025-01-09 04:18:07,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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:07,220 INFO L276 IsEmpty]: Start isEmpty. Operand 12563 states and 22210 transitions. [2025-01-09 04:18:07,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:18:07,231 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:07,231 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] [2025-01-09 04:18:07,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:18:07,231 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:07,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:07,232 INFO L85 PathProgramCache]: Analyzing trace with hash -887983006, now seen corresponding path program 1 times [2025-01-09 04:18:07,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:07,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025481552] [2025-01-09 04:18:07,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:07,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:07,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:18:07,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:18:07,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:07,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:07,316 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:07,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:07,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025481552] [2025-01-09 04:18:07,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025481552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:07,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:07,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:07,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009910015] [2025-01-09 04:18:07,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:07,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:07,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:07,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:07,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:07,318 INFO L87 Difference]: Start difference. First operand 12563 states and 22210 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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:08,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:08,779 INFO L93 Difference]: Finished difference Result 39448 states and 75964 transitions. [2025-01-09 04:18:08,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:08,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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 89 [2025-01-09 04:18:08,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:08,936 INFO L225 Difference]: With dead ends: 39448 [2025-01-09 04:18:08,936 INFO L226 Difference]: Without dead ends: 26897 [2025-01-09 04:18:08,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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:08,989 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 456 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:08,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1148 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:18:09,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26897 states. [2025-01-09 04:18:10,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26897 to 26203. [2025-01-09 04:18:10,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26203 states, 22007 states have (on average 1.5279683736992775) internal successors, (33626), 24068 states have internal predecessors, (33626), 1361 states have call successors, (1361), 774 states have call predecessors, (1361), 2834 states have return successors, (17745), 1488 states have call predecessors, (17745), 1361 states have call successors, (17745) [2025-01-09 04:18:11,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26203 states to 26203 states and 52732 transitions. [2025-01-09 04:18:11,041 INFO L78 Accepts]: Start accepts. Automaton has 26203 states and 52732 transitions. Word has length 89 [2025-01-09 04:18:11,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:11,041 INFO L471 AbstractCegarLoop]: Abstraction has 26203 states and 52732 transitions. [2025-01-09 04:18:11,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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:11,042 INFO L276 IsEmpty]: Start isEmpty. Operand 26203 states and 52732 transitions. [2025-01-09 04:18:11,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:18:11,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:11,068 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] [2025-01-09 04:18:11,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:18:11,069 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:11,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:11,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2104136732, now seen corresponding path program 1 times [2025-01-09 04:18:11,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:11,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322164046] [2025-01-09 04:18:11,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:11,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:11,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:18:11,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:18:11,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:11,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:11,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:11,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:11,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322164046] [2025-01-09 04:18:11,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322164046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:11,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:11,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:18:11,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733768615] [2025-01-09 04:18:11,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:11,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:18:11,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:11,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:18:11,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:18:11,150 INFO L87 Difference]: Start difference. First operand 26203 states and 52732 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (5), 1 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:12,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:12,248 INFO L93 Difference]: Finished difference Result 52396 states and 106031 transitions. [2025-01-09 04:18:12,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:18:12,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (5), 1 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 89 [2025-01-09 04:18:12,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:12,529 INFO L225 Difference]: With dead ends: 52396 [2025-01-09 04:18:12,530 INFO L226 Difference]: Without dead ends: 26206 [2025-01-09 04:18:12,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:18:12,588 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 0 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:12,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1002 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:18:12,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26206 states. [2025-01-09 04:18:13,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26206 to 26206. [2025-01-09 04:18:13,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26206 states, 22010 states have (on average 1.5220808723307588) internal successors, (33501), 24071 states have internal predecessors, (33501), 1361 states have call successors, (1361), 774 states have call predecessors, (1361), 2834 states have return successors, (17745), 1488 states have call predecessors, (17745), 1361 states have call successors, (17745) [2025-01-09 04:18:13,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26206 states to 26206 states and 52607 transitions. [2025-01-09 04:18:14,013 INFO L78 Accepts]: Start accepts. Automaton has 26206 states and 52607 transitions. Word has length 89 [2025-01-09 04:18:14,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:14,014 INFO L471 AbstractCegarLoop]: Abstraction has 26206 states and 52607 transitions. [2025-01-09 04:18:14,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (5), 1 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:14,014 INFO L276 IsEmpty]: Start isEmpty. Operand 26206 states and 52607 transitions. [2025-01-09 04:18:14,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:18:14,035 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:14,035 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] [2025-01-09 04:18:14,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:18:14,036 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:14,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:14,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1670407646, now seen corresponding path program 1 times [2025-01-09 04:18:14,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:14,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105032954] [2025-01-09 04:18:14,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:14,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:14,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:18:14,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:18:14,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:14,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:14,091 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:14,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:14,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105032954] [2025-01-09 04:18:14,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105032954] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:14,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:14,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:18:14,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864758789] [2025-01-09 04:18:14,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:14,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:18:14,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:14,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:18:14,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:18:14,093 INFO L87 Difference]: Start difference. First operand 26206 states and 52607 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (5), 1 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:15,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:15,313 INFO L93 Difference]: Finished difference Result 52786 states and 106293 transitions. [2025-01-09 04:18:15,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:18:15,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (5), 1 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 89 [2025-01-09 04:18:15,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:15,455 INFO L225 Difference]: With dead ends: 52786 [2025-01-09 04:18:15,455 INFO L226 Difference]: Without dead ends: 26593 [2025-01-09 04:18:15,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:18:15,514 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 0 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:15,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1002 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:18:15,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26593 states. [2025-01-09 04:18:16,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26593 to 26593. [2025-01-09 04:18:16,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26593 states, 22397 states have (on average 1.5130597847926062) internal successors, (33888), 24458 states have internal predecessors, (33888), 1361 states have call successors, (1361), 774 states have call predecessors, (1361), 2834 states have return successors, (17745), 1488 states have call predecessors, (17745), 1361 states have call successors, (17745) [2025-01-09 04:18:17,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26593 states to 26593 states and 52994 transitions. [2025-01-09 04:18:17,169 INFO L78 Accepts]: Start accepts. Automaton has 26593 states and 52994 transitions. Word has length 89 [2025-01-09 04:18:17,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:17,170 INFO L471 AbstractCegarLoop]: Abstraction has 26593 states and 52994 transitions. [2025-01-09 04:18:17,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (5), 1 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,170 INFO L276 IsEmpty]: Start isEmpty. Operand 26593 states and 52994 transitions. [2025-01-09 04:18:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:18:17,193 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:17,193 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] [2025-01-09 04:18:17,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:18:17,194 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:17,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:17,194 INFO L85 PathProgramCache]: Analyzing trace with hash -132067616, now seen corresponding path program 1 times [2025-01-09 04:18:17,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:17,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148616799] [2025-01-09 04:18:17,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:17,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:17,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:18:17,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:18:17,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:17,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:17,252 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,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:17,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148616799] [2025-01-09 04:18:17,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148616799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:17,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:17,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:18:17,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208906270] [2025-01-09 04:18:17,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:17,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:18:17,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:17,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:18:17,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:18:17,256 INFO L87 Difference]: Start difference. First operand 26593 states and 52994 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (5), 1 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,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:19,128 INFO L93 Difference]: Finished difference Result 79059 states and 158299 transitions. [2025-01-09 04:18:19,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:18:19,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (5), 1 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 89 [2025-01-09 04:18:19,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:19,438 INFO L225 Difference]: With dead ends: 79059 [2025-01-09 04:18:19,438 INFO L226 Difference]: Without dead ends: 52479 [2025-01-09 04:18:19,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:18:19,538 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 445 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:19,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 875 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:18:19,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52479 states. [2025-01-09 04:18:22,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52479 to 52347. [2025-01-09 04:18:22,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52347 states, 44121 states have (on average 1.5090773101244306) internal successors, (66582), 48242 states have internal predecessors, (66582), 2573 states have call successors, (2573), 1532 states have call predecessors, (2573), 5652 states have return successors, (35214), 2700 states have call predecessors, (35214), 2573 states have call successors, (35214) [2025-01-09 04:18:23,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52347 states to 52347 states and 104369 transitions. [2025-01-09 04:18:23,057 INFO L78 Accepts]: Start accepts. Automaton has 52347 states and 104369 transitions. Word has length 89 [2025-01-09 04:18:23,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:23,057 INFO L471 AbstractCegarLoop]: Abstraction has 52347 states and 104369 transitions. [2025-01-09 04:18:23,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (5), 1 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,058 INFO L276 IsEmpty]: Start isEmpty. Operand 52347 states and 104369 transitions. [2025-01-09 04:18:23,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:18:23,075 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:23,076 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] [2025-01-09 04:18:23,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:18:23,076 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:23,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:23,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1862404673, now seen corresponding path program 1 times [2025-01-09 04:18:23,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:23,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666184078] [2025-01-09 04:18:23,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:23,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:23,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:18:23,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:18:23,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:23,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:23,136 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:23,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:23,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666184078] [2025-01-09 04:18:23,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666184078] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:23,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:23,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:18:23,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934273107] [2025-01-09 04:18:23,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:23,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:18:23,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:23,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:18:23,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:18:23,138 INFO L87 Difference]: Start difference. First operand 52347 states and 104369 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (5), 1 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,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:25,071 INFO L93 Difference]: Finished difference Result 105068 states and 210255 transitions. [2025-01-09 04:18:25,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:18:25,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (5), 1 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 89 [2025-01-09 04:18:25,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:25,328 INFO L225 Difference]: With dead ends: 105068 [2025-01-09 04:18:25,328 INFO L226 Difference]: Without dead ends: 52734 [2025-01-09 04:18:25,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:18:25,469 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 0 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:25,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1002 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:18:25,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52734 states. [2025-01-09 04:18:28,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52734 to 52734. [2025-01-09 04:18:28,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52734 states, 44508 states have (on average 1.5017524939336748) internal successors, (66840), 48629 states have internal predecessors, (66840), 2573 states have call successors, (2573), 1532 states have call predecessors, (2573), 5652 states have return successors, (35214), 2700 states have call predecessors, (35214), 2573 states have call successors, (35214) [2025-01-09 04:18:29,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52734 states to 52734 states and 104627 transitions. [2025-01-09 04:18:29,259 INFO L78 Accepts]: Start accepts. Automaton has 52734 states and 104627 transitions. Word has length 89 [2025-01-09 04:18:29,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:29,260 INFO L471 AbstractCegarLoop]: Abstraction has 52734 states and 104627 transitions. [2025-01-09 04:18:29,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (5), 1 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:29,260 INFO L276 IsEmpty]: Start isEmpty. Operand 52734 states and 104627 transitions. [2025-01-09 04:18:29,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:18:29,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:29,279 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] [2025-01-09 04:18:29,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:18:29,279 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:29,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:29,280 INFO L85 PathProgramCache]: Analyzing trace with hash 65868029, now seen corresponding path program 1 times [2025-01-09 04:18:29,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:29,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500685848] [2025-01-09 04:18:29,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:29,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:29,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:18:29,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:18:29,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:29,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:29,320 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:29,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:29,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500685848] [2025-01-09 04:18:29,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500685848] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:29,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:29,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:18:29,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456898102] [2025-01-09 04:18:29,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:29,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:18:29,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:29,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:18:29,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:18:29,321 INFO L87 Difference]: Start difference. First operand 52734 states and 104627 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)