./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-66.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_fillercodesize_ps-cn-50_file-66.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 ab3009c5075b0ebd92692dd619a86557cce84a8d711f4e9b6310d42ccb6a6f85 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:17:53,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:17:53,970 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:17:53,975 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:17:53,977 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:17:54,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:17:54,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:17:54,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:17:54,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:17:54,002 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:17:54,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:17:54,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:17:54,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:17:54,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:17:54,003 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:17:54,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:17:54,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:17:54,004 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:17:54,004 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:17:54,004 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:17:54,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:17:54,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:17:54,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:17:54,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:17:54,004 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:17:54,005 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:17:54,005 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:17:54,005 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:17:54,005 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:17:54,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:17:54,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:17:54,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:17:54,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:17:54,005 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:17:54,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:17:54,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:17:54,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:17:54,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:17:54,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:17:54,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:17:54,006 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:17:54,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:17:54,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:17:54,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:17:54,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:17:54,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:17:54,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:17:54,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:17:54,007 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 -> ab3009c5075b0ebd92692dd619a86557cce84a8d711f4e9b6310d42ccb6a6f85 [2025-01-09 10:17:54,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:17:54,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:17:54,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:17:54,273 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:17:54,273 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:17:54,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-66.i [2025-01-09 10:17:55,737 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8770b99b/2a3bb6aa506043838d919e1e048e4f39/FLAGacc5a3162 [2025-01-09 10:17:56,065 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:17:56,067 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-66.i [2025-01-09 10:17:56,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8770b99b/2a3bb6aa506043838d919e1e048e4f39/FLAGacc5a3162 [2025-01-09 10:17:56,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8770b99b/2a3bb6aa506043838d919e1e048e4f39 [2025-01-09 10:17:56,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:17:56,101 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:17:56,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:17:56,102 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:17:56,107 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:17:56,108 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:17:56" (1/1) ... [2025-01-09 10:17:56,110 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600401e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:56, skipping insertion in model container [2025-01-09 10:17:56,110 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:17:56" (1/1) ... [2025-01-09 10:17:56,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:17:56,257 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_fillercodesize_ps-cn-50_file-66.i[915,928] [2025-01-09 10:17:56,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:17:56,323 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:17:56,335 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_fillercodesize_ps-cn-50_file-66.i[915,928] [2025-01-09 10:17:56,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:17:56,407 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:17:56,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:56 WrapperNode [2025-01-09 10:17:56,411 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:17:56,412 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:17:56,412 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:17:56,412 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:17:56,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:56" (1/1) ... [2025-01-09 10:17:56,432 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:56" (1/1) ... [2025-01-09 10:17:56,469 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 250 [2025-01-09 10:17:56,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:17:56,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:17:56,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:17:56,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:17:56,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:56" (1/1) ... [2025-01-09 10:17:56,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:56" (1/1) ... [2025-01-09 10:17:56,491 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:56" (1/1) ... [2025-01-09 10:17:56,512 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 10:17:56,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:56" (1/1) ... [2025-01-09 10:17:56,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:56" (1/1) ... [2025-01-09 10:17:56,520 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:56" (1/1) ... [2025-01-09 10:17:56,522 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:56" (1/1) ... [2025-01-09 10:17:56,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:56" (1/1) ... [2025-01-09 10:17:56,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:56" (1/1) ... [2025-01-09 10:17:56,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:56" (1/1) ... [2025-01-09 10:17:56,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:17:56,531 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:17:56,531 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:17:56,531 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:17:56,532 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:56" (1/1) ... [2025-01-09 10:17:56,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:17:56,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:17:56,568 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 10:17:56,571 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 10:17:56,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:17:56,593 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:17:56,593 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:17:56,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:17:56,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:17:56,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:17:56,684 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:17:56,685 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:17:57,090 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 10:17:57,091 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:17:57,103 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:17:57,104 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:17:57,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:17:57 BoogieIcfgContainer [2025-01-09 10:17:57,104 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:17:57,106 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:17:57,106 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:17:57,109 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:17:57,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:17:56" (1/3) ... [2025-01-09 10:17:57,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d7e1592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:17:57, skipping insertion in model container [2025-01-09 10:17:57,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:56" (2/3) ... [2025-01-09 10:17:57,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d7e1592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:17:57, skipping insertion in model container [2025-01-09 10:17:57,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:17:57" (3/3) ... [2025-01-09 10:17:57,114 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-66.i [2025-01-09 10:17:57,126 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:17:57,130 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-66.i that has 2 procedures, 114 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:17:57,184 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:17:57,193 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;@268bf884, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:17:57,194 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:17:57,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 67 states have (on average 1.4029850746268657) internal successors, (94), 68 states have internal predecessors, (94), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 10:17:57,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 10:17:57,206 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:17:57,207 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:17:57,207 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:17:57,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:17:57,211 INFO L85 PathProgramCache]: Analyzing trace with hash -894946790, now seen corresponding path program 1 times [2025-01-09 10:17:57,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:17:57,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660558057] [2025-01-09 10:17:57,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:17:57,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:17:57,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 10:17:57,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 10:17:57,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:17:57,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:17:57,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2025-01-09 10:17:57,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:17:57,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660558057] [2025-01-09 10:17:57,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660558057] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:17:57,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227940246] [2025-01-09 10:17:57,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:17:57,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:17:57,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:17:57,589 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 10:17:57,618 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 10:17:57,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 10:17:57,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 10:17:57,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:17:57,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:17:57,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:17:57,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:17:57,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2025-01-09 10:17:57,896 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:17:57,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227940246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:17:57,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:17:57,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:17:57,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182693082] [2025-01-09 10:17:57,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:17:57,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:17:57,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:17:57,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:17:57,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:17:57,923 INFO L87 Difference]: Start difference. First operand has 114 states, 67 states have (on average 1.4029850746268657) internal successors, (94), 68 states have internal predecessors, (94), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2025-01-09 10:17:57,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:17:57,960 INFO L93 Difference]: Finished difference Result 222 states and 403 transitions. [2025-01-09 10:17:57,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:17:57,963 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) Word has length 271 [2025-01-09 10:17:57,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:17:57,974 INFO L225 Difference]: With dead ends: 222 [2025-01-09 10:17:57,975 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 10:17:57,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 272 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 10:17:57,981 INFO L435 NwaCegarLoop]: 177 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, 177 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 10:17:57,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:17:57,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 10:17:58,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-01-09 10:17:58,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 65 states have internal predecessors, (89), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 10:17:58,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 177 transitions. [2025-01-09 10:17:58,041 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 177 transitions. Word has length 271 [2025-01-09 10:17:58,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:17:58,043 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 177 transitions. [2025-01-09 10:17:58,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2025-01-09 10:17:58,044 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 177 transitions. [2025-01-09 10:17:58,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 10:17:58,053 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:17:58,053 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:17:58,072 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 10:17:58,254 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 10:17:58,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:17:58,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:17:58,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1923439838, now seen corresponding path program 1 times [2025-01-09 10:17:58,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:17:58,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075111800] [2025-01-09 10:17:58,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:17:58,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:17:58,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 10:17:58,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 10:17:58,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:17:58,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:18:04,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 10:18:04,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:18:04,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075111800] [2025-01-09 10:18:04,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075111800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:18:04,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:18:04,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 10:18:04,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144496240] [2025-01-09 10:18:04,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:18:04,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 10:18:04,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:18:04,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 10:18:04,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:18:04,524 INFO L87 Difference]: Start difference. First operand 111 states and 177 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:18:05,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:18:05,385 INFO L93 Difference]: Finished difference Result 340 states and 515 transitions. [2025-01-09 10:18:05,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 10:18:05,387 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 271 [2025-01-09 10:18:05,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:18:05,389 INFO L225 Difference]: With dead ends: 340 [2025-01-09 10:18:05,389 INFO L226 Difference]: Without dead ends: 232 [2025-01-09 10:18:05,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-01-09 10:18:05,393 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 208 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:18:05,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1219 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:18:05,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-01-09 10:18:05,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 156. [2025-01-09 10:18:05,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 105 states have (on average 1.4) internal successors, (147), 106 states have internal predecessors, (147), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 10:18:05,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 243 transitions. [2025-01-09 10:18:05,436 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 243 transitions. Word has length 271 [2025-01-09 10:18:05,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:18:05,437 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 243 transitions. [2025-01-09 10:18:05,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:18:05,437 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 243 transitions. [2025-01-09 10:18:05,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 10:18:05,442 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:18:05,442 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:18:05,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:18:05,443 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:18:05,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:18:05,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1925286880, now seen corresponding path program 1 times [2025-01-09 10:18:05,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:18:05,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554698516] [2025-01-09 10:18:05,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:18:05,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:18:05,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 10:18:05,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 10:18:05,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:18:05,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:18:34,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 10:18:34,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:18:34,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554698516] [2025-01-09 10:18:34,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554698516] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:18:34,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:18:34,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 10:18:34,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28041974] [2025-01-09 10:18:34,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:18:34,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 10:18:34,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:18:34,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 10:18:34,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:18:34,633 INFO L87 Difference]: Start difference. First operand 156 states and 243 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:18:38,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:18:38,287 INFO L93 Difference]: Finished difference Result 213 states and 311 transitions. [2025-01-09 10:18:38,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 10:18:38,290 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 271 [2025-01-09 10:18:38,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:18:38,296 INFO L225 Difference]: With dead ends: 213 [2025-01-09 10:18:38,296 INFO L226 Difference]: Without dead ends: 211 [2025-01-09 10:18:38,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2025-01-09 10:18:38,297 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 138 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:18:38,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1299 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 10:18:38,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-01-09 10:18:38,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 159. [2025-01-09 10:18:38,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 108 states have (on average 1.3981481481481481) internal successors, (151), 109 states have internal predecessors, (151), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 10:18:38,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 247 transitions. [2025-01-09 10:18:38,321 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 247 transitions. Word has length 271 [2025-01-09 10:18:38,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:18:38,322 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 247 transitions. [2025-01-09 10:18:38,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:18:38,323 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 247 transitions. [2025-01-09 10:18:38,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 10:18:38,326 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:18:38,327 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:18:38,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:18:38,327 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:18:38,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:18:38,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1691469088, now seen corresponding path program 1 times [2025-01-09 10:18:38,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:18:38,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451390263] [2025-01-09 10:18:38,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:18:38,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:18:38,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 10:18:38,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 10:18:38,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:18:38,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:18:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 10:18:41,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:18:41,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451390263] [2025-01-09 10:18:41,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451390263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:18:41,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:18:41,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 10:18:41,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549952694] [2025-01-09 10:18:41,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:18:41,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 10:18:41,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:18:41,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 10:18:41,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:18:41,824 INFO L87 Difference]: Start difference. First operand 159 states and 247 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:18:42,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:18:42,702 INFO L93 Difference]: Finished difference Result 239 states and 341 transitions. [2025-01-09 10:18:42,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 10:18:42,702 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 271 [2025-01-09 10:18:42,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:18:42,705 INFO L225 Difference]: With dead ends: 239 [2025-01-09 10:18:42,705 INFO L226 Difference]: Without dead ends: 237 [2025-01-09 10:18:42,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-01-09 10:18:42,707 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 172 mSDsluCounter, 1230 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:18:42,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1398 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:18:42,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-01-09 10:18:42,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 163. [2025-01-09 10:18:42,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 112 states have (on average 1.4017857142857142) internal successors, (157), 113 states have internal predecessors, (157), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 10:18:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 253 transitions. [2025-01-09 10:18:42,727 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 253 transitions. Word has length 271 [2025-01-09 10:18:42,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:18:42,728 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 253 transitions. [2025-01-09 10:18:42,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:18:42,728 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 253 transitions. [2025-01-09 10:18:42,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 10:18:42,730 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:18:42,730 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:18:42,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:18:42,730 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:18:42,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:18:42,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1689622046, now seen corresponding path program 1 times [2025-01-09 10:18:42,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:18:42,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902928304] [2025-01-09 10:18:42,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:18:42,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:18:42,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 10:18:42,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 10:18:42,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:18:42,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:18:47,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 10:18:47,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:18:47,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902928304] [2025-01-09 10:18:47,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902928304] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:18:47,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:18:47,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 10:18:47,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015940020] [2025-01-09 10:18:47,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:18:47,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 10:18:47,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:18:47,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 10:18:47,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:18:47,536 INFO L87 Difference]: Start difference. First operand 163 states and 253 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:18:48,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:18:48,819 INFO L93 Difference]: Finished difference Result 237 states and 339 transitions. [2025-01-09 10:18:48,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 10:18:48,819 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 271 [2025-01-09 10:18:48,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:18:48,821 INFO L225 Difference]: With dead ends: 237 [2025-01-09 10:18:48,821 INFO L226 Difference]: Without dead ends: 235 [2025-01-09 10:18:48,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-01-09 10:18:48,822 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 178 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 10:18:48,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1172 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 10:18:48,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-01-09 10:18:48,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 161. [2025-01-09 10:18:48,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 110 states have (on average 1.4) internal successors, (154), 111 states have internal predecessors, (154), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 10:18:48,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 250 transitions. [2025-01-09 10:18:48,847 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 250 transitions. Word has length 271 [2025-01-09 10:18:48,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:18:48,847 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 250 transitions. [2025-01-09 10:18:48,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:18:48,848 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 250 transitions. [2025-01-09 10:18:48,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 10:18:48,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:18:48,849 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:18:48,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:18:48,849 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:18:48,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:18:48,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2113362020, now seen corresponding path program 1 times [2025-01-09 10:18:48,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:18:48,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767424895] [2025-01-09 10:18:48,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:18:48,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:18:48,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 10:18:48,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 10:18:48,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:18:48,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:18:48,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 10:18:48,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:18:48,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767424895] [2025-01-09 10:18:48,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767424895] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:18:48,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:18:48,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:18:48,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041550261] [2025-01-09 10:18:48,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:18:48,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:18:48,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:18:48,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:18:48,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:18:48,918 INFO L87 Difference]: Start difference. First operand 161 states and 250 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:18:48,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:18:48,975 INFO L93 Difference]: Finished difference Result 453 states and 709 transitions. [2025-01-09 10:18:48,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:18:48,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 271 [2025-01-09 10:18:48,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:18:48,979 INFO L225 Difference]: With dead ends: 453 [2025-01-09 10:18:48,980 INFO L226 Difference]: Without dead ends: 295 [2025-01-09 10:18:48,980 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 10:18:48,981 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 164 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:18:48,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 495 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:18:48,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-01-09 10:18:49,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2025-01-09 10:18:49,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 192 states have (on average 1.3489583333333333) internal successors, (259), 194 states have internal predecessors, (259), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 94 states have call predecessors, (96), 96 states have call successors, (96) [2025-01-09 10:18:49,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 451 transitions. [2025-01-09 10:18:49,013 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 451 transitions. Word has length 271 [2025-01-09 10:18:49,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:18:49,015 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 451 transitions. [2025-01-09 10:18:49,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:18:49,015 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 451 transitions. [2025-01-09 10:18:49,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 10:18:49,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:18:49,019 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:18:49,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:18:49,019 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:18:49,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:18:49,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1372258650, now seen corresponding path program 1 times [2025-01-09 10:18:49,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:18:49,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730997069] [2025-01-09 10:18:49,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:18:49,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:18:49,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 10:18:49,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 10:18:49,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:18:49,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:18:49,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 10:18:49,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:18:49,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730997069] [2025-01-09 10:18:49,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730997069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:18:49,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:18:49,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:18:49,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095392222] [2025-01-09 10:18:49,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:18:49,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:18:49,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:18:49,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:18:49,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:18:49,124 INFO L87 Difference]: Start difference. First operand 293 states and 451 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:18:49,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:18:49,404 INFO L93 Difference]: Finished difference Result 864 states and 1321 transitions. [2025-01-09 10:18:49,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:18:49,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 271 [2025-01-09 10:18:49,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:18:49,409 INFO L225 Difference]: With dead ends: 864 [2025-01-09 10:18:49,409 INFO L226 Difference]: Without dead ends: 574 [2025-01-09 10:18:49,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:18:49,411 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 114 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:18:49,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 522 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:18:49,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-01-09 10:18:49,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 529. [2025-01-09 10:18:49,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 332 states have (on average 1.3313253012048192) internal successors, (442), 335 states have internal predecessors, (442), 188 states have call successors, (188), 8 states have call predecessors, (188), 8 states have return successors, (188), 185 states have call predecessors, (188), 188 states have call successors, (188) [2025-01-09 10:18:49,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 818 transitions. [2025-01-09 10:18:49,475 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 818 transitions. Word has length 271 [2025-01-09 10:18:49,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:18:49,476 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 818 transitions. [2025-01-09 10:18:49,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:18:49,476 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 818 transitions. [2025-01-09 10:18:49,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 10:18:49,477 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:18:49,478 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:18:49,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:18:49,478 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:18:49,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:18:49,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2052317020, now seen corresponding path program 1 times [2025-01-09 10:18:49,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:18:49,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837657213] [2025-01-09 10:18:49,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:18:49,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:18:49,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 10:18:49,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 10:18:49,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:18:49,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:18:51,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 10:18:51,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:18:51,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837657213] [2025-01-09 10:18:51,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837657213] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:18:51,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:18:51,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 10:18:51,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119976686] [2025-01-09 10:18:51,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:18:51,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 10:18:51,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:18:51,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 10:18:51,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-01-09 10:18:51,523 INFO L87 Difference]: Start difference. First operand 529 states and 818 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:18:52,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:18:52,173 INFO L93 Difference]: Finished difference Result 675 states and 985 transitions. [2025-01-09 10:18:52,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 10:18:52,174 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 271 [2025-01-09 10:18:52,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:18:52,177 INFO L225 Difference]: With dead ends: 675 [2025-01-09 10:18:52,177 INFO L226 Difference]: Without dead ends: 673 [2025-01-09 10:18:52,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-01-09 10:18:52,178 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 309 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:18:52,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 865 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:18:52,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-01-09 10:18:52,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 585. [2025-01-09 10:18:52,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 377 states have (on average 1.312997347480106) internal successors, (495), 382 states have internal predecessors, (495), 196 states have call successors, (196), 11 states have call predecessors, (196), 11 states have return successors, (196), 191 states have call predecessors, (196), 196 states have call successors, (196) [2025-01-09 10:18:52,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 887 transitions. [2025-01-09 10:18:52,222 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 887 transitions. Word has length 271 [2025-01-09 10:18:52,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:18:52,223 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 887 transitions. [2025-01-09 10:18:52,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:18:52,223 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 887 transitions. [2025-01-09 10:18:52,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 10:18:52,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:18:52,224 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:18:52,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:18:52,225 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:18:52,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:18:52,225 INFO L85 PathProgramCache]: Analyzing trace with hash 2054164062, now seen corresponding path program 1 times [2025-01-09 10:18:52,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:18:52,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117191454] [2025-01-09 10:18:52,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:18:52,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:18:52,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 10:18:52,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 10:18:52,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:18:52,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:18:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 10:18:56,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:18:56,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117191454] [2025-01-09 10:18:56,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117191454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:18:56,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:18:56,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 10:18:56,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112863252] [2025-01-09 10:18:56,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:18:56,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 10:18:56,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:18:56,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 10:18:56,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-01-09 10:18:56,261 INFO L87 Difference]: Start difference. First operand 585 states and 887 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:18:57,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:18:57,750 INFO L93 Difference]: Finished difference Result 673 states and 983 transitions. [2025-01-09 10:18:57,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 10:18:57,751 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 271 [2025-01-09 10:18:57,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:18:57,754 INFO L225 Difference]: With dead ends: 673 [2025-01-09 10:18:57,755 INFO L226 Difference]: Without dead ends: 671 [2025-01-09 10:18:57,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:18:57,756 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 293 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 10:18:57,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 995 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 10:18:57,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-01-09 10:18:57,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 585. [2025-01-09 10:18:57,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 377 states have (on average 1.312997347480106) internal successors, (495), 382 states have internal predecessors, (495), 196 states have call successors, (196), 11 states have call predecessors, (196), 11 states have return successors, (196), 191 states have call predecessors, (196), 196 states have call successors, (196) [2025-01-09 10:18:57,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 887 transitions. [2025-01-09 10:18:57,803 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 887 transitions. Word has length 271 [2025-01-09 10:18:57,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:18:57,803 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 887 transitions. [2025-01-09 10:18:57,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:18:57,804 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 887 transitions. [2025-01-09 10:18:57,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 10:18:57,805 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:18:57,805 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:18:57,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:18:57,805 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:18:57,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:18:57,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1336633824, now seen corresponding path program 1 times [2025-01-09 10:18:57,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:18:57,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159842464] [2025-01-09 10:18:57,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:18:57,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:18:57,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 10:18:57,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 10:18:57,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:18:57,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:18:58,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 10:18:58,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:18:58,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159842464] [2025-01-09 10:18:58,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159842464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:18:58,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:18:58,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:18:58,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704055845] [2025-01-09 10:18:58,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:18:58,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:18:58,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:18:58,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:18:58,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:18:58,035 INFO L87 Difference]: Start difference. First operand 585 states and 887 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-01-09 10:18:58,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:18:58,412 INFO L93 Difference]: Finished difference Result 1077 states and 1616 transitions. [2025-01-09 10:18:58,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:18:58,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 271 [2025-01-09 10:18:58,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:18:58,419 INFO L225 Difference]: With dead ends: 1077 [2025-01-09 10:18:58,419 INFO L226 Difference]: Without dead ends: 592 [2025-01-09 10:18:58,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:18:58,421 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 166 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:18:58,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 339 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:18:58,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-01-09 10:18:58,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 583. [2025-01-09 10:18:58,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 369 states have (on average 1.2845528455284554) internal successors, (474), 374 states have internal predecessors, (474), 200 states have call successors, (200), 13 states have call predecessors, (200), 13 states have return successors, (200), 195 states have call predecessors, (200), 200 states have call successors, (200) [2025-01-09 10:18:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 874 transitions. [2025-01-09 10:18:58,489 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 874 transitions. Word has length 271 [2025-01-09 10:18:58,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:18:58,490 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 874 transitions. [2025-01-09 10:18:58,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-01-09 10:18:58,490 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 874 transitions. [2025-01-09 10:18:58,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-01-09 10:18:58,492 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:18:58,492 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:18:58,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:18:58,492 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:18:58,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:18:58,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1447549723, now seen corresponding path program 1 times [2025-01-09 10:18:58,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:18:58,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437006403] [2025-01-09 10:18:58,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:18:58,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:18:58,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-01-09 10:18:58,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-01-09 10:18:58,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:18:58,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:19:01,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 10:19:01,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:19:01,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437006403] [2025-01-09 10:19:01,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437006403] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:19:01,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:19:01,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 10:19:01,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17466476] [2025-01-09 10:19:01,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:19:01,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 10:19:01,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:19:01,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 10:19:01,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:19:01,283 INFO L87 Difference]: Start difference. First operand 583 states and 874 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:19:01,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:19:01,943 INFO L93 Difference]: Finished difference Result 1075 states and 1572 transitions. [2025-01-09 10:19:01,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 10:19:01,944 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 272 [2025-01-09 10:19:01,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:19:01,949 INFO L225 Difference]: With dead ends: 1075 [2025-01-09 10:19:01,949 INFO L226 Difference]: Without dead ends: 782 [2025-01-09 10:19:01,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2025-01-09 10:19:01,951 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 260 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:19:01,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 1079 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:19:01,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2025-01-09 10:19:02,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 602. [2025-01-09 10:19:02,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 390 states have (on average 1.294871794871795) internal successors, (505), 394 states have internal predecessors, (505), 196 states have call successors, (196), 15 states have call predecessors, (196), 15 states have return successors, (196), 192 states have call predecessors, (196), 196 states have call successors, (196) [2025-01-09 10:19:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 897 transitions. [2025-01-09 10:19:02,015 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 897 transitions. Word has length 272 [2025-01-09 10:19:02,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:19:02,015 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 897 transitions. [2025-01-09 10:19:02,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:19:02,016 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 897 transitions. [2025-01-09 10:19:02,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-01-09 10:19:02,017 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:19:02,017 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:19:02,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:19:02,017 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:19:02,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:19:02,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1445702681, now seen corresponding path program 1 times [2025-01-09 10:19:02,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:19:02,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691022182] [2025-01-09 10:19:02,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:19:02,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:19:02,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-01-09 10:19:02,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-01-09 10:19:02,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:19:02,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat