./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-52.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f936db2b47677a90e81718d3591b9d45243b1a66e00c73ec4ccd3f4a235b10d9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:18:01,184 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:18:01,236 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 11:18:01,240 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:18:01,240 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:18:01,254 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:18:01,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:18:01,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:18:01,255 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:18:01,255 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:18:01,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:18:01,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:18:01,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:18:01,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:18:01,256 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:18:01,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:18:01,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:18:01,256 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:18:01,256 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:18:01,257 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:18:01,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:18:01,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:18:01,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:18:01,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:18:01,257 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:18:01,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:18:01,257 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:18:01,257 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:18:01,257 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:18:01,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:18:01,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:18:01,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:18:01,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:18:01,258 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:18:01,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:18:01,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:18:01,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:18:01,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:18:01,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:18:01,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:18:01,258 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:18:01,258 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:18:01,258 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:18:01,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:18:01,258 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:18:01,258 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:18:01,258 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:18:01,258 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:18:01,258 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 -> f936db2b47677a90e81718d3591b9d45243b1a66e00c73ec4ccd3f4a235b10d9 [2025-01-09 11:18:01,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:18:01,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:18:01,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:18:01,525 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:18:01,526 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:18:01,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-52.i [2025-01-09 11:18:02,705 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34b7b27e6/bc900197384447af9959ba9048871dd3/FLAG17caec8fd [2025-01-09 11:18:02,961 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:18:02,961 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-52.i [2025-01-09 11:18:02,973 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34b7b27e6/bc900197384447af9959ba9048871dd3/FLAG17caec8fd [2025-01-09 11:18:02,992 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34b7b27e6/bc900197384447af9959ba9048871dd3 [2025-01-09 11:18:02,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:18:02,995 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:18:02,996 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:18:02,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:18:03,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:18:03,000 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:18:02" (1/1) ... [2025-01-09 11:18:03,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43a133c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:18:03, skipping insertion in model container [2025-01-09 11:18:03,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:18:02" (1/1) ... [2025-01-09 11:18:03,018 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:18:03,120 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-52.i[919,932] [2025-01-09 11:18:03,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:18:03,196 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:18:03,205 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-52.i[919,932] [2025-01-09 11:18:03,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:18:03,254 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:18:03,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:18:03 WrapperNode [2025-01-09 11:18:03,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:18:03,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:18:03,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:18:03,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:18:03,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:18:03" (1/1) ... [2025-01-09 11:18:03,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:18:03" (1/1) ... [2025-01-09 11:18:03,299 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 244 [2025-01-09 11:18:03,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:18:03,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:18:03,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:18:03,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:18:03,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:18:03" (1/1) ... [2025-01-09 11:18:03,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:18:03" (1/1) ... [2025-01-09 11:18:03,319 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:18:03" (1/1) ... [2025-01-09 11:18:03,332 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 11:18:03,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:18:03" (1/1) ... [2025-01-09 11:18:03,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:18:03" (1/1) ... [2025-01-09 11:18:03,338 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:18:03" (1/1) ... [2025-01-09 11:18:03,339 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:18:03" (1/1) ... [2025-01-09 11:18:03,341 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:18:03" (1/1) ... [2025-01-09 11:18:03,342 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:18:03" (1/1) ... [2025-01-09 11:18:03,343 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:18:03" (1/1) ... [2025-01-09 11:18:03,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:18:03,345 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:18:03,345 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:18:03,345 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:18:03,346 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:18:03" (1/1) ... [2025-01-09 11:18:03,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:18:03,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:18:03,371 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 11:18:03,374 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 11:18:03,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:18:03,388 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:18:03,388 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:18:03,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:18:03,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:18:03,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:18:03,462 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:18:03,463 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:18:03,790 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-01-09 11:18:03,790 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:18:03,800 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:18:03,802 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:18:03,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:18:03 BoogieIcfgContainer [2025-01-09 11:18:03,802 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:18:03,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:18:03,803 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:18:03,807 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:18:03,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:18:02" (1/3) ... [2025-01-09 11:18:03,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c75241a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:18:03, skipping insertion in model container [2025-01-09 11:18:03,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:18:03" (2/3) ... [2025-01-09 11:18:03,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c75241a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:18:03, skipping insertion in model container [2025-01-09 11:18:03,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:18:03" (3/3) ... [2025-01-09 11:18:03,810 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-52.i [2025-01-09 11:18:03,822 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:18:03,823 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-52.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:18:03,866 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:18:03,875 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;@20d133f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:18:03,876 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:18:03,880 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 11:18:03,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-01-09 11:18:03,890 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:18:03,891 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:18:03,891 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:18:03,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:18:03,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1680300795, now seen corresponding path program 1 times [2025-01-09 11:18:03,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:18:03,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882376834] [2025-01-09 11:18:03,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:18:03,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:18:03,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-09 11:18:03,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-09 11:18:03,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:18:03,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:18:04,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-01-09 11:18:04,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:18:04,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882376834] [2025-01-09 11:18:04,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882376834] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:18:04,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531279342] [2025-01-09 11:18:04,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:18:04,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:18:04,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:18:04,175 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:18:04,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 11:18:04,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-09 11:18:04,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-09 11:18:04,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:18:04,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:18:04,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:18:04,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:18:04,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-01-09 11:18:04,348 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:18:04,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531279342] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:18:04,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:18:04,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 11:18:04,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651927815] [2025-01-09 11:18:04,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:18:04,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:18:04,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:18:04,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:18:04,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:18:04,364 INFO L87 Difference]: Start difference. First operand has 104 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-01-09 11:18:04,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:18:04,389 INFO L93 Difference]: Finished difference Result 202 states and 355 transitions. [2025-01-09 11:18:04,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:18:04,390 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 218 [2025-01-09 11:18:04,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:18:04,398 INFO L225 Difference]: With dead ends: 202 [2025-01-09 11:18:04,398 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 11:18:04,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:18:04,402 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:18:04,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:18:04,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 11:18:04,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-01-09 11:18:04,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 11:18:04,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 158 transitions. [2025-01-09 11:18:04,431 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 158 transitions. Word has length 218 [2025-01-09 11:18:04,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:18:04,432 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 158 transitions. [2025-01-09 11:18:04,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-01-09 11:18:04,432 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 158 transitions. [2025-01-09 11:18:04,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-01-09 11:18:04,434 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:18:04,435 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:18:04,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 11:18:04,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 11:18:04,639 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:18:04,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:18:04,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1973070465, now seen corresponding path program 1 times [2025-01-09 11:18:04,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:18:04,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462143340] [2025-01-09 11:18:04,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:18:04,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:18:04,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-09 11:18:04,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-09 11:18:04,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:18:04,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:18:05,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 11:18:05,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:18:05,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462143340] [2025-01-09 11:18:05,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462143340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:18:05,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:18:05,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:18:05,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373302994] [2025-01-09 11:18:05,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:18:05,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:18:05,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:18:05,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:18:05,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:18:05,300 INFO L87 Difference]: Start difference. First operand 101 states and 158 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:18:05,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:18:05,498 INFO L93 Difference]: Finished difference Result 267 states and 419 transitions. [2025-01-09 11:18:05,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:18:05,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 218 [2025-01-09 11:18:05,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:18:05,501 INFO L225 Difference]: With dead ends: 267 [2025-01-09 11:18:05,501 INFO L226 Difference]: Without dead ends: 169 [2025-01-09 11:18:05,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 11:18:05,503 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 100 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:18:05,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 599 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:18:05,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-01-09 11:18:05,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2025-01-09 11:18:05,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 113 states have (on average 1.424778761061947) internal successors, (161), 114 states have internal predecessors, (161), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 11:18:05,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 261 transitions. [2025-01-09 11:18:05,526 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 261 transitions. Word has length 218 [2025-01-09 11:18:05,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:18:05,528 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 261 transitions. [2025-01-09 11:18:05,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:18:05,528 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 261 transitions. [2025-01-09 11:18:05,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-01-09 11:18:05,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:18:05,534 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:18:05,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:18:05,534 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:18:05,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:18:05,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1899195005, now seen corresponding path program 1 times [2025-01-09 11:18:05,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:18:05,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002813412] [2025-01-09 11:18:05,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:18:05,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:18:05,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-09 11:18:05,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-09 11:18:05,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:18:05,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:18:05,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 11:18:05,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:18:05,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002813412] [2025-01-09 11:18:05,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002813412] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:18:05,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:18:05,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:18:05,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905916830] [2025-01-09 11:18:05,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:18:05,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:18:05,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:18:05,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:18:05,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:18:05,849 INFO L87 Difference]: Start difference. First operand 166 states and 261 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:18:05,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:18:05,894 INFO L93 Difference]: Finished difference Result 456 states and 719 transitions. [2025-01-09 11:18:05,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:18:05,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 218 [2025-01-09 11:18:05,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:18:05,901 INFO L225 Difference]: With dead ends: 456 [2025-01-09 11:18:05,903 INFO L226 Difference]: Without dead ends: 293 [2025-01-09 11:18:05,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:18:05,904 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 100 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:18:05,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 353 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:18:05,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-01-09 11:18:05,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2025-01-09 11:18:05,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 201 states have (on average 1.4378109452736318) internal successors, (289), 204 states have internal predecessors, (289), 84 states have call successors, (84), 4 states have call predecessors, (84), 4 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 11:18:05,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 457 transitions. [2025-01-09 11:18:05,950 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 457 transitions. Word has length 218 [2025-01-09 11:18:05,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:18:05,950 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 457 transitions. [2025-01-09 11:18:05,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:18:05,951 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 457 transitions. [2025-01-09 11:18:05,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 11:18:05,953 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:18:05,953 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:18:05,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:18:05,953 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:18:05,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:18:05,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1640631926, now seen corresponding path program 1 times [2025-01-09 11:18:05,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:18:05,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188078343] [2025-01-09 11:18:05,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:18:05,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:18:05,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 11:18:06,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 11:18:06,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:18:06,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:18:10,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 11:18:10,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:18:10,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188078343] [2025-01-09 11:18:10,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188078343] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:18:10,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:18:10,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 11:18:10,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442057909] [2025-01-09 11:18:10,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:18:10,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 11:18:10,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:18:10,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 11:18:10,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-01-09 11:18:10,088 INFO L87 Difference]: Start difference. First operand 290 states and 457 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 5 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 4 states have call predecessors, (34), 5 states have call successors, (34) [2025-01-09 11:18:10,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:18:10,878 INFO L93 Difference]: Finished difference Result 1086 states and 1701 transitions. [2025-01-09 11:18:10,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 11:18:10,879 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 5 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 4 states have call predecessors, (34), 5 states have call successors, (34) Word has length 219 [2025-01-09 11:18:10,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:18:10,883 INFO L225 Difference]: With dead ends: 1086 [2025-01-09 11:18:10,884 INFO L226 Difference]: Without dead ends: 799 [2025-01-09 11:18:10,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2025-01-09 11:18:10,885 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 629 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:18:10,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 1039 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 11:18:10,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-01-09 11:18:10,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 585. [2025-01-09 11:18:10,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 431 states have (on average 1.4408352668213458) internal successors, (621), 438 states have internal predecessors, (621), 142 states have call successors, (142), 11 states have call predecessors, (142), 11 states have return successors, (142), 135 states have call predecessors, (142), 142 states have call successors, (142) [2025-01-09 11:18:10,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 905 transitions. [2025-01-09 11:18:10,938 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 905 transitions. Word has length 219 [2025-01-09 11:18:10,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:18:10,938 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 905 transitions. [2025-01-09 11:18:10,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 5 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 4 states have call predecessors, (34), 5 states have call successors, (34) [2025-01-09 11:18:10,938 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 905 transitions. [2025-01-09 11:18:10,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 11:18:10,940 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:18:10,940 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:18:10,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 11:18:10,941 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:18:10,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:18:10,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1065987468, now seen corresponding path program 1 times [2025-01-09 11:18:10,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:18:10,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921534078] [2025-01-09 11:18:10,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:18:10,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:18:10,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 11:18:10,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 11:18:10,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:18:10,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:18:11,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 11:18:11,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:18:11,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921534078] [2025-01-09 11:18:11,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921534078] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:18:11,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:18:11,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:18:11,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110624331] [2025-01-09 11:18:11,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:18:11,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:18:11,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:18:11,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:18:11,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:18:11,341 INFO L87 Difference]: Start difference. First operand 585 states and 905 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:18:11,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:18:11,463 INFO L93 Difference]: Finished difference Result 1138 states and 1734 transitions. [2025-01-09 11:18:11,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:18:11,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-01-09 11:18:11,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:18:11,468 INFO L225 Difference]: With dead ends: 1138 [2025-01-09 11:18:11,468 INFO L226 Difference]: Without dead ends: 759 [2025-01-09 11:18:11,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:18:11,470 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 146 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:18:11,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 433 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:18:11,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2025-01-09 11:18:11,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 465. [2025-01-09 11:18:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 335 states have (on average 1.4059701492537313) internal successors, (471), 338 states have internal predecessors, (471), 118 states have call successors, (118), 11 states have call predecessors, (118), 11 states have return successors, (118), 115 states have call predecessors, (118), 118 states have call successors, (118) [2025-01-09 11:18:11,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 707 transitions. [2025-01-09 11:18:11,502 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 707 transitions. Word has length 219 [2025-01-09 11:18:11,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:18:11,502 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 707 transitions. [2025-01-09 11:18:11,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 11:18:11,503 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 707 transitions. [2025-01-09 11:18:11,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 11:18:11,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:18:11,505 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:18:11,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 11:18:11,505 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:18:11,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:18:11,505 INFO L85 PathProgramCache]: Analyzing trace with hash -195563382, now seen corresponding path program 1 times [2025-01-09 11:18:11,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:18:11,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534423444] [2025-01-09 11:18:11,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:18:11,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:18:11,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 11:18:11,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 11:18:11,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:18:11,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat