./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-52.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fb963e37b33825ce0294e2e8f217c8677b17169f1936b98a544da3476a4e00cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:44:06,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:44:06,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:44:06,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:44:06,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:44:06,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:44:06,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:44:06,499 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:44:06,499 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:44:06,499 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:44:06,500 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:44:06,500 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:44:06,501 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:44:06,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:44:06,501 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:44:06,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:44:06,501 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:44:06,501 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:44:06,502 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:44:06,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:44:06,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:44:06,502 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:44:06,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:44:06,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:44:06,502 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:44:06,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:44:06,502 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:44:06,503 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:44:06,503 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:44:06,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:44:06,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:44:06,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:44:06,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:44:06,503 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:44:06,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:44:06,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:44:06,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:44:06,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:44:06,504 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:44:06,504 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:44:06,504 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:44:06,504 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:44:06,505 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:44:06,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:44:06,505 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:44:06,505 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:44:06,505 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:44:06,505 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:44:06,505 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 -> fb963e37b33825ce0294e2e8f217c8677b17169f1936b98a544da3476a4e00cd [2025-01-09 09:44:06,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:44:06,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:44:06,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:44:06,797 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:44:06,797 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:44:06,798 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-250_file-52.i [2025-01-09 09:44:08,084 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ae86e58a/49aeb2c35b3d4754a646d399134cdc3a/FLAG2382e842d [2025-01-09 09:44:08,449 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:44:08,449 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-52.i [2025-01-09 09:44:08,462 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ae86e58a/49aeb2c35b3d4754a646d399134cdc3a/FLAG2382e842d [2025-01-09 09:44:08,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ae86e58a/49aeb2c35b3d4754a646d399134cdc3a [2025-01-09 09:44:08,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:44:08,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:44:08,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:44:08,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:44:08,491 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:44:08,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:44:08" (1/1) ... [2025-01-09 09:44:08,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c50773d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:08, skipping insertion in model container [2025-01-09 09:44:08,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:44:08" (1/1) ... [2025-01-09 09:44:08,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:44:08,659 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-250_file-52.i[916,929] [2025-01-09 09:44:08,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:44:08,794 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:44:08,806 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-250_file-52.i[916,929] [2025-01-09 09:44:08,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:44:08,905 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:44:08,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:08 WrapperNode [2025-01-09 09:44:08,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:44:08,908 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:44:08,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:44:08,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:44:08,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:08" (1/1) ... [2025-01-09 09:44:08,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:08" (1/1) ... [2025-01-09 09:44:08,980 INFO L138 Inliner]: procedures = 26, calls = 86, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 530 [2025-01-09 09:44:08,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:44:08,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:44:08,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:44:08,981 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:44:08,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:08" (1/1) ... [2025-01-09 09:44:08,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:08" (1/1) ... [2025-01-09 09:44:08,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:08" (1/1) ... [2025-01-09 09:44:09,025 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 09:44:09,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:08" (1/1) ... [2025-01-09 09:44:09,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:08" (1/1) ... [2025-01-09 09:44:09,039 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:08" (1/1) ... [2025-01-09 09:44:09,041 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:08" (1/1) ... [2025-01-09 09:44:09,045 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:08" (1/1) ... [2025-01-09 09:44:09,049 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:08" (1/1) ... [2025-01-09 09:44:09,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:08" (1/1) ... [2025-01-09 09:44:09,062 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:44:09,063 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:44:09,064 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:44:09,064 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:44:09,065 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:08" (1/1) ... [2025-01-09 09:44:09,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:44:09,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:44:09,098 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 09:44:09,103 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 09:44:09,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:44:09,125 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:44:09,125 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:44:09,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:44:09,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:44:09,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:44:09,263 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:44:09,265 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:44:10,100 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-01-09 09:44:10,100 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:44:10,116 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:44:10,117 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:44:10,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:44:10 BoogieIcfgContainer [2025-01-09 09:44:10,117 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:44:10,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:44:10,119 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:44:10,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:44:10,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:44:08" (1/3) ... [2025-01-09 09:44:10,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af4495f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:44:10, skipping insertion in model container [2025-01-09 09:44:10,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:08" (2/3) ... [2025-01-09 09:44:10,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af4495f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:44:10, skipping insertion in model container [2025-01-09 09:44:10,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:44:10" (3/3) ... [2025-01-09 09:44:10,127 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-52.i [2025-01-09 09:44:10,141 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:44:10,145 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-52.i that has 2 procedures, 220 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:44:10,212 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:44:10,223 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;@507be08e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:44:10,223 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:44:10,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 220 states, 144 states have (on average 1.5347222222222223) internal successors, (221), 145 states have internal predecessors, (221), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-01-09 09:44:10,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-01-09 09:44:10,253 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:10,255 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:44:10,255 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:10,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:10,261 INFO L85 PathProgramCache]: Analyzing trace with hash -71098738, now seen corresponding path program 1 times [2025-01-09 09:44:10,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:10,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972649346] [2025-01-09 09:44:10,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:10,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:10,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-01-09 09:44:10,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-01-09 09:44:10,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:10,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2025-01-09 09:44:10,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:10,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972649346] [2025-01-09 09:44:10,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972649346] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:44:10,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84234988] [2025-01-09 09:44:10,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:10,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:44:10,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:44:10,839 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 09:44:10,841 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 09:44:10,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-01-09 09:44:11,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-01-09 09:44:11,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:11,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:11,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:44:11,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:44:11,242 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2025-01-09 09:44:11,242 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:44:11,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84234988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:11,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:44:11,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:44:11,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55451978] [2025-01-09 09:44:11,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:11,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:44:11,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:11,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:44:11,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:44:11,274 INFO L87 Difference]: Start difference. First operand has 220 states, 144 states have (on average 1.5347222222222223) internal successors, (221), 145 states have internal predecessors, (221), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) Second operand has 2 states, 2 states have (on average 49.5) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) [2025-01-09 09:44:11,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:11,349 INFO L93 Difference]: Finished difference Result 434 states and 802 transitions. [2025-01-09 09:44:11,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:44:11,352 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 49.5) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) Word has length 459 [2025-01-09 09:44:11,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:11,359 INFO L225 Difference]: With dead ends: 434 [2025-01-09 09:44:11,359 INFO L226 Difference]: Without dead ends: 217 [2025-01-09 09:44:11,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 460 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 09:44:11,370 INFO L435 NwaCegarLoop]: 361 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, 361 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 09:44:11,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:44:11,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-01-09 09:44:11,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-01-09 09:44:11,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 142 states have (on average 1.5140845070422535) internal successors, (215), 142 states have internal predecessors, (215), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-01-09 09:44:11,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 361 transitions. [2025-01-09 09:44:11,425 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 361 transitions. Word has length 459 [2025-01-09 09:44:11,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:11,426 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 361 transitions. [2025-01-09 09:44:11,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 49.5) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) [2025-01-09 09:44:11,427 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 361 transitions. [2025-01-09 09:44:11,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-01-09 09:44:11,436 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:11,436 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:44:11,446 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 09:44:11,637 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 09:44:11,637 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:11,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:11,638 INFO L85 PathProgramCache]: Analyzing trace with hash 869969484, now seen corresponding path program 1 times [2025-01-09 09:44:11,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:11,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834279701] [2025-01-09 09:44:11,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:11,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:11,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-01-09 09:44:11,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-01-09 09:44:11,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:11,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:12,375 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 09:44:12,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:12,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834279701] [2025-01-09 09:44:12,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834279701] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:12,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:44:12,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:44:12,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29977917] [2025-01-09 09:44:12,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:12,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:44:12,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:12,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:44:12,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:44:12,381 INFO L87 Difference]: Start difference. First operand 217 states and 361 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:44:12,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:12,503 INFO L93 Difference]: Finished difference Result 645 states and 1077 transitions. [2025-01-09 09:44:12,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:44:12,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 459 [2025-01-09 09:44:12,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:12,514 INFO L225 Difference]: With dead ends: 645 [2025-01-09 09:44:12,515 INFO L226 Difference]: Without dead ends: 431 [2025-01-09 09:44:12,517 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 09:44:12,517 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 220 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:12,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 759 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:44:12,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-01-09 09:44:12,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 428. [2025-01-09 09:44:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 279 states have (on average 1.5125448028673836) internal successors, (422), 279 states have internal predecessors, (422), 146 states have call successors, (146), 2 states have call predecessors, (146), 2 states have return successors, (146), 146 states have call predecessors, (146), 146 states have call successors, (146) [2025-01-09 09:44:12,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 714 transitions. [2025-01-09 09:44:12,620 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 714 transitions. Word has length 459 [2025-01-09 09:44:12,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:12,622 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 714 transitions. [2025-01-09 09:44:12,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:44:12,623 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 714 transitions. [2025-01-09 09:44:12,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-01-09 09:44:12,650 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:12,651 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:44:12,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:44:12,651 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:12,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:12,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1271958906, now seen corresponding path program 1 times [2025-01-09 09:44:12,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:12,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647405061] [2025-01-09 09:44:12,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:12,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:12,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-01-09 09:44:12,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-01-09 09:44:12,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:12,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 09:44:13,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:13,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647405061] [2025-01-09 09:44:13,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647405061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:13,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:44:13,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:44:13,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334215521] [2025-01-09 09:44:13,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:13,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:44:13,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:13,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:44:13,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:44:13,187 INFO L87 Difference]: Start difference. First operand 428 states and 714 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:44:13,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:13,993 INFO L93 Difference]: Finished difference Result 1522 states and 2546 transitions. [2025-01-09 09:44:13,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:44:13,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 460 [2025-01-09 09:44:13,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:14,007 INFO L225 Difference]: With dead ends: 1522 [2025-01-09 09:44:14,007 INFO L226 Difference]: Without dead ends: 1097 [2025-01-09 09:44:14,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:44:14,012 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 522 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:14,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1209 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 09:44:14,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2025-01-09 09:44:14,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1088. [2025-01-09 09:44:14,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 743 states have (on average 1.5437415881561238) internal successors, (1147), 745 states have internal predecessors, (1147), 338 states have call successors, (338), 6 states have call predecessors, (338), 6 states have return successors, (338), 336 states have call predecessors, (338), 338 states have call successors, (338) [2025-01-09 09:44:14,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1823 transitions. [2025-01-09 09:44:14,180 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1823 transitions. Word has length 460 [2025-01-09 09:44:14,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:14,182 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1823 transitions. [2025-01-09 09:44:14,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:44:14,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1823 transitions. [2025-01-09 09:44:14,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-01-09 09:44:14,193 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:14,194 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:44:14,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:44:14,194 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:14,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:14,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1371824750, now seen corresponding path program 1 times [2025-01-09 09:44:14,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:14,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128974422] [2025-01-09 09:44:14,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:14,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:14,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-01-09 09:44:14,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-01-09 09:44:14,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:14,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:14,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 09:44:14,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:14,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128974422] [2025-01-09 09:44:14,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128974422] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:14,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:44:14,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:44:14,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373281538] [2025-01-09 09:44:14,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:14,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:44:14,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:14,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:44:14,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:44:14,503 INFO L87 Difference]: Start difference. First operand 1088 states and 1823 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:44:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:14,820 INFO L93 Difference]: Finished difference Result 2293 states and 3838 transitions. [2025-01-09 09:44:14,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:44:14,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 460 [2025-01-09 09:44:14,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:14,835 INFO L225 Difference]: With dead ends: 2293 [2025-01-09 09:44:14,835 INFO L226 Difference]: Without dead ends: 1208 [2025-01-09 09:44:14,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:44:14,844 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 406 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:14,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1331 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:44:14,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2025-01-09 09:44:14,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1200. [2025-01-09 09:44:14,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 831 states have (on average 1.5475330926594464) internal successors, (1286), 834 states have internal predecessors, (1286), 361 states have call successors, (361), 7 states have call predecessors, (361), 7 states have return successors, (361), 358 states have call predecessors, (361), 361 states have call successors, (361) [2025-01-09 09:44:14,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 2008 transitions. [2025-01-09 09:44:14,992 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 2008 transitions. Word has length 460 [2025-01-09 09:44:14,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:14,993 INFO L471 AbstractCegarLoop]: Abstraction has 1200 states and 2008 transitions. [2025-01-09 09:44:14,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:44:14,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 2008 transitions. [2025-01-09 09:44:14,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-01-09 09:44:14,997 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:14,997 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:44:14,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:44:14,998 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:14,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:14,999 INFO L85 PathProgramCache]: Analyzing trace with hash -339793439, now seen corresponding path program 1 times [2025-01-09 09:44:14,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:14,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605282196] [2025-01-09 09:44:14,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:14,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:15,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-01-09 09:44:15,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-01-09 09:44:15,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:15,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:15,356 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 09:44:15,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:15,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605282196] [2025-01-09 09:44:15,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605282196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:15,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:44:15,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:44:15,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195544445] [2025-01-09 09:44:15,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:15,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:44:15,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:15,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:44:15,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:44:15,359 INFO L87 Difference]: Start difference. First operand 1200 states and 2008 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:44:15,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:15,525 INFO L93 Difference]: Finished difference Result 3216 states and 5393 transitions. [2025-01-09 09:44:15,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:44:15,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 461 [2025-01-09 09:44:15,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:15,541 INFO L225 Difference]: With dead ends: 3216 [2025-01-09 09:44:15,542 INFO L226 Difference]: Without dead ends: 2019 [2025-01-09 09:44:15,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 09:44:15,548 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 205 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:15,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 752 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:44:15,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2025-01-09 09:44:15,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 2010. [2025-01-09 09:44:15,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2010 states, 1508 states have (on average 1.5875331564986737) internal successors, (2394), 1518 states have internal predecessors, (2394), 487 states have call successors, (487), 14 states have call predecessors, (487), 14 states have return successors, (487), 477 states have call predecessors, (487), 487 states have call successors, (487) [2025-01-09 09:44:15,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 3368 transitions. [2025-01-09 09:44:15,705 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 3368 transitions. Word has length 461 [2025-01-09 09:44:15,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:15,707 INFO L471 AbstractCegarLoop]: Abstraction has 2010 states and 3368 transitions. [2025-01-09 09:44:15,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:44:15,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 3368 transitions. [2025-01-09 09:44:15,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-01-09 09:44:15,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:15,716 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:44:15,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:44:15,717 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:15,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:15,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1989532867, now seen corresponding path program 1 times [2025-01-09 09:44:15,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:15,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778001270] [2025-01-09 09:44:15,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:15,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:15,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-01-09 09:44:15,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-01-09 09:44:15,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:15,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:16,390 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 09:44:16,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:16,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778001270] [2025-01-09 09:44:16,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778001270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:16,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:44:16,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:44:16,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433780493] [2025-01-09 09:44:16,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:16,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:44:16,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:16,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:44:16,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:44:16,392 INFO L87 Difference]: Start difference. First operand 2010 states and 3368 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:44:16,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:16,955 INFO L93 Difference]: Finished difference Result 8842 states and 14702 transitions. [2025-01-09 09:44:16,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:44:16,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 462 [2025-01-09 09:44:16,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:17,008 INFO L225 Difference]: With dead ends: 8842 [2025-01-09 09:44:17,009 INFO L226 Difference]: Without dead ends: 6835 [2025-01-09 09:44:17,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:44:17,019 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 735 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:17,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 1320 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:44:17,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6835 states. [2025-01-09 09:44:17,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6835 to 6821. [2025-01-09 09:44:17,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6821 states, 5152 states have (on average 1.561723602484472) internal successors, (8046), 5200 states have internal predecessors, (8046), 1612 states have call successors, (1612), 56 states have call predecessors, (1612), 56 states have return successors, (1612), 1564 states have call predecessors, (1612), 1612 states have call successors, (1612) [2025-01-09 09:44:17,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6821 states to 6821 states and 11270 transitions. [2025-01-09 09:44:17,603 INFO L78 Accepts]: Start accepts. Automaton has 6821 states and 11270 transitions. Word has length 462 [2025-01-09 09:44:17,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:17,604 INFO L471 AbstractCegarLoop]: Abstraction has 6821 states and 11270 transitions. [2025-01-09 09:44:17,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:44:17,605 INFO L276 IsEmpty]: Start isEmpty. Operand 6821 states and 11270 transitions. [2025-01-09 09:44:17,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-01-09 09:44:17,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:17,612 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:44:17,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:44:17,613 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:17,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:17,613 INFO L85 PathProgramCache]: Analyzing trace with hash 616490687, now seen corresponding path program 1 times [2025-01-09 09:44:17,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:17,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034541760] [2025-01-09 09:44:17,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:17,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:17,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-01-09 09:44:17,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-01-09 09:44:17,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:17,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:29,049 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 09:44:29,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:29,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034541760] [2025-01-09 09:44:29,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034541760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:29,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:44:29,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 09:44:29,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635450522] [2025-01-09 09:44:29,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:29,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 09:44:29,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:29,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 09:44:29,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-01-09 09:44:29,055 INFO L87 Difference]: Start difference. First operand 6821 states and 11270 transitions. Second operand has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 states have internal predecessors, (100), 5 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 4 states have call predecessors, (73), 5 states have call successors, (73) [2025-01-09 09:44:33,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:33,212 INFO L93 Difference]: Finished difference Result 18140 states and 29559 transitions. [2025-01-09 09:44:33,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 09:44:33,214 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 states have internal predecessors, (100), 5 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 4 states have call predecessors, (73), 5 states have call successors, (73) Word has length 462 [2025-01-09 09:44:33,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:33,289 INFO L225 Difference]: With dead ends: 18140 [2025-01-09 09:44:33,292 INFO L226 Difference]: Without dead ends: 11322 [2025-01-09 09:44:33,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=322, Invalid=938, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 09:44:33,316 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 1075 mSDsluCounter, 2756 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 594 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 3092 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 594 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:33,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 3092 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [594 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 09:44:33,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11322 states. [2025-01-09 09:44:33,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11322 to 9216. [2025-01-09 09:44:33,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9216 states, 7473 states have (on average 1.5804897631473305) internal successors, (11811), 7521 states have internal predecessors, (11811), 1685 states have call successors, (1685), 57 states have call predecessors, (1685), 57 states have return successors, (1685), 1637 states have call predecessors, (1685), 1685 states have call successors, (1685) [2025-01-09 09:44:34,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 15181 transitions. [2025-01-09 09:44:34,026 INFO L78 Accepts]: Start accepts. Automaton has 9216 states and 15181 transitions. Word has length 462 [2025-01-09 09:44:34,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:34,027 INFO L471 AbstractCegarLoop]: Abstraction has 9216 states and 15181 transitions. [2025-01-09 09:44:34,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 states have internal predecessors, (100), 5 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 4 states have call predecessors, (73), 5 states have call successors, (73) [2025-01-09 09:44:34,032 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states and 15181 transitions. [2025-01-09 09:44:34,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-01-09 09:44:34,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:34,042 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:44:34,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:44:34,042 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:34,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:34,043 INFO L85 PathProgramCache]: Analyzing trace with hash 874656125, now seen corresponding path program 1 times [2025-01-09 09:44:34,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:34,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187465868] [2025-01-09 09:44:34,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:34,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:34,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-01-09 09:44:34,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-01-09 09:44:34,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:34,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:34,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 09:44:34,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:34,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187465868] [2025-01-09 09:44:34,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187465868] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:34,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:44:34,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:44:34,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861270011] [2025-01-09 09:44:34,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:34,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:44:34,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:34,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:44:34,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:44:34,484 INFO L87 Difference]: Start difference. First operand 9216 states and 15181 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:44:35,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:35,200 INFO L93 Difference]: Finished difference Result 23468 states and 38667 transitions. [2025-01-09 09:44:35,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:44:35,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 462 [2025-01-09 09:44:35,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:35,282 INFO L225 Difference]: With dead ends: 23468 [2025-01-09 09:44:35,283 INFO L226 Difference]: Without dead ends: 16650 [2025-01-09 09:44:35,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:44:35,312 INFO L435 NwaCegarLoop]: 692 mSDtfsCounter, 377 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:35,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1572 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:44:35,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16650 states. [2025-01-09 09:44:36,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16650 to 9384. [2025-01-09 09:44:36,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9384 states, 7641 states have (on average 1.5695589582515377) internal successors, (11993), 7689 states have internal predecessors, (11993), 1685 states have call successors, (1685), 57 states have call predecessors, (1685), 57 states have return successors, (1685), 1637 states have call predecessors, (1685), 1685 states have call successors, (1685) [2025-01-09 09:44:36,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9384 states to 9384 states and 15363 transitions. [2025-01-09 09:44:36,301 INFO L78 Accepts]: Start accepts. Automaton has 9384 states and 15363 transitions. Word has length 462 [2025-01-09 09:44:36,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:36,303 INFO L471 AbstractCegarLoop]: Abstraction has 9384 states and 15363 transitions. [2025-01-09 09:44:36,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:44:36,304 INFO L276 IsEmpty]: Start isEmpty. Operand 9384 states and 15363 transitions. [2025-01-09 09:44:36,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-01-09 09:44:36,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:36,313 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:44:36,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:44:36,314 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:36,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:36,314 INFO L85 PathProgramCache]: Analyzing trace with hash -698071617, now seen corresponding path program 1 times [2025-01-09 09:44:36,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:36,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662227814] [2025-01-09 09:44:36,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:36,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:36,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-01-09 09:44:36,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-01-09 09:44:36,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:36,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:45,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 09:44:45,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:45,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662227814] [2025-01-09 09:44:45,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662227814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:45,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:44:45,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 09:44:45,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486935831] [2025-01-09 09:44:45,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:45,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 09:44:45,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:45,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 09:44:45,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-01-09 09:44:45,260 INFO L87 Difference]: Start difference. First operand 9384 states and 15363 transitions. Second operand has 17 states, 17 states have (on average 5.882352941176471) internal successors, (100), 17 states have internal predecessors, (100), 4 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 3 states have call predecessors, (73), 4 states have call successors, (73) [2025-01-09 09:44:47,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:47,887 INFO L93 Difference]: Finished difference Result 18856 states and 30512 transitions. [2025-01-09 09:44:47,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 09:44:47,888 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.882352941176471) internal successors, (100), 17 states have internal predecessors, (100), 4 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 3 states have call predecessors, (73), 4 states have call successors, (73) Word has length 462 [2025-01-09 09:44:47,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:47,941 INFO L225 Difference]: With dead ends: 18856 [2025-01-09 09:44:47,941 INFO L226 Difference]: Without dead ends: 11870 [2025-01-09 09:44:47,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2025-01-09 09:44:47,970 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 1132 mSDsluCounter, 2148 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 2500 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 658 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:47,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1132 Valid, 2500 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [658 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 09:44:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11870 states. [2025-01-09 09:44:48,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11870 to 9552. [2025-01-09 09:44:48,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9552 states, 7809 states have (on average 1.562684082468946) internal successors, (12203), 7857 states have internal predecessors, (12203), 1685 states have call successors, (1685), 57 states have call predecessors, (1685), 57 states have return successors, (1685), 1637 states have call predecessors, (1685), 1685 states have call successors, (1685) [2025-01-09 09:44:48,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9552 states to 9552 states and 15573 transitions. [2025-01-09 09:44:48,638 INFO L78 Accepts]: Start accepts. Automaton has 9552 states and 15573 transitions. Word has length 462 [2025-01-09 09:44:48,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:48,639 INFO L471 AbstractCegarLoop]: Abstraction has 9552 states and 15573 transitions. [2025-01-09 09:44:48,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.882352941176471) internal successors, (100), 17 states have internal predecessors, (100), 4 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 3 states have call predecessors, (73), 4 states have call successors, (73) [2025-01-09 09:44:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 9552 states and 15573 transitions. [2025-01-09 09:44:48,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-01-09 09:44:48,648 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:48,649 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:44:48,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:44:48,649 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:48,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:48,650 INFO L85 PathProgramCache]: Analyzing trace with hash -439906179, now seen corresponding path program 1 times [2025-01-09 09:44:48,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:48,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277908953] [2025-01-09 09:44:48,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:48,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:48,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-01-09 09:44:48,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-01-09 09:44:48,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:48,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:49,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 09:44:49,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:49,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277908953] [2025-01-09 09:44:49,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277908953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:49,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:44:49,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:44:49,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397977221] [2025-01-09 09:44:49,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:49,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:44:49,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:49,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:44:49,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:44:49,370 INFO L87 Difference]: Start difference. First operand 9552 states and 15573 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:44:49,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:49,820 INFO L93 Difference]: Finished difference Result 18728 states and 29910 transitions. [2025-01-09 09:44:49,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:44:49,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 462 [2025-01-09 09:44:49,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:49,874 INFO L225 Difference]: With dead ends: 18728 [2025-01-09 09:44:49,875 INFO L226 Difference]: Without dead ends: 11574 [2025-01-09 09:44:49,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:44:49,904 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 77 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:49,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1030 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:44:49,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11574 states. [2025-01-09 09:44:50,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11574 to 10312. [2025-01-09 09:44:50,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10312 states, 8512 states have (on average 1.5293703007518797) internal successors, (13018), 8560 states have internal predecessors, (13018), 1685 states have call successors, (1685), 114 states have call predecessors, (1685), 114 states have return successors, (1685), 1637 states have call predecessors, (1685), 1685 states have call successors, (1685) [2025-01-09 09:44:50,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10312 states to 10312 states and 16388 transitions. [2025-01-09 09:44:50,678 INFO L78 Accepts]: Start accepts. Automaton has 10312 states and 16388 transitions. Word has length 462 [2025-01-09 09:44:50,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:50,679 INFO L471 AbstractCegarLoop]: Abstraction has 10312 states and 16388 transitions. [2025-01-09 09:44:50,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:44:50,680 INFO L276 IsEmpty]: Start isEmpty. Operand 10312 states and 16388 transitions. [2025-01-09 09:44:50,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-01-09 09:44:50,689 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:50,689 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:44:50,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 09:44:50,690 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:50,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:50,690 INFO L85 PathProgramCache]: Analyzing trace with hash -663372991, now seen corresponding path program 1 times [2025-01-09 09:44:50,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:50,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025005828] [2025-01-09 09:44:50,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:50,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:50,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-01-09 09:44:50,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-01-09 09:44:50,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:50,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:50,953 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 09:44:50,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:50,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025005828] [2025-01-09 09:44:50,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025005828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:50,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:44:50,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:44:50,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783286913] [2025-01-09 09:44:50,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:50,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:44:50,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:50,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:44:50,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:44:50,956 INFO L87 Difference]: Start difference. First operand 10312 states and 16388 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:44:51,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:51,562 INFO L93 Difference]: Finished difference Result 17802 states and 28327 transitions. [2025-01-09 09:44:51,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:44:51,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 462 [2025-01-09 09:44:51,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:51,613 INFO L225 Difference]: With dead ends: 17802 [2025-01-09 09:44:51,613 INFO L226 Difference]: Without dead ends: 10144 [2025-01-09 09:44:51,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:44:51,635 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 343 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:51,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 555 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:44:51,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10144 states. [2025-01-09 09:44:52,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10144 to 10144. [2025-01-09 09:44:52,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10144 states, 8344 states have (on average 1.5148609779482263) internal successors, (12640), 8392 states have internal predecessors, (12640), 1685 states have call successors, (1685), 114 states have call predecessors, (1685), 114 states have return successors, (1685), 1637 states have call predecessors, (1685), 1685 states have call successors, (1685) [2025-01-09 09:44:52,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10144 states to 10144 states and 16010 transitions. [2025-01-09 09:44:52,118 INFO L78 Accepts]: Start accepts. Automaton has 10144 states and 16010 transitions. Word has length 462 [2025-01-09 09:44:52,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:52,119 INFO L471 AbstractCegarLoop]: Abstraction has 10144 states and 16010 transitions. [2025-01-09 09:44:52,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:44:52,119 INFO L276 IsEmpty]: Start isEmpty. Operand 10144 states and 16010 transitions. [2025-01-09 09:44:52,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-01-09 09:44:52,128 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:52,128 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:44:52,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 09:44:52,129 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:52,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:52,129 INFO L85 PathProgramCache]: Analyzing trace with hash -705043420, now seen corresponding path program 1 times [2025-01-09 09:44:52,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:52,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015433096] [2025-01-09 09:44:52,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:52,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:52,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-01-09 09:44:52,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-01-09 09:44:52,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:52,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:57,648 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 09:44:57,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:57,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015433096] [2025-01-09 09:44:57,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015433096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:57,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:44:57,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 09:44:57,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993216015] [2025-01-09 09:44:57,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:57,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 09:44:57,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:57,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 09:44:57,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:44:57,651 INFO L87 Difference]: Start difference. First operand 10144 states and 16010 transitions. Second operand has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:44:59,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:59,916 INFO L93 Difference]: Finished difference Result 19540 states and 30400 transitions. [2025-01-09 09:44:59,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 09:44:59,917 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 463 [2025-01-09 09:44:59,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:59,967 INFO L225 Difference]: With dead ends: 19540 [2025-01-09 09:44:59,967 INFO L226 Difference]: Without dead ends: 12050 [2025-01-09 09:44:59,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=278, Invalid=714, Unknown=0, NotChecked=0, Total=992 [2025-01-09 09:44:59,988 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 421 mSDsluCounter, 1446 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:59,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1788 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 09:44:59,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12050 states. [2025-01-09 09:45:00,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12050 to 10396. [2025-01-09 09:45:00,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10396 states, 8596 states have (on average 1.506281991624011) internal successors, (12948), 8644 states have internal predecessors, (12948), 1685 states have call successors, (1685), 114 states have call predecessors, (1685), 114 states have return successors, (1685), 1637 states have call predecessors, (1685), 1685 states have call successors, (1685) [2025-01-09 09:45:00,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10396 states to 10396 states and 16318 transitions. [2025-01-09 09:45:00,501 INFO L78 Accepts]: Start accepts. Automaton has 10396 states and 16318 transitions. Word has length 463 [2025-01-09 09:45:00,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:00,502 INFO L471 AbstractCegarLoop]: Abstraction has 10396 states and 16318 transitions. [2025-01-09 09:45:00,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:45:00,503 INFO L276 IsEmpty]: Start isEmpty. Operand 10396 states and 16318 transitions. [2025-01-09 09:45:00,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-01-09 09:45:00,511 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:00,511 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:45:00,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 09:45:00,511 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:00,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:00,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1004653286, now seen corresponding path program 1 times [2025-01-09 09:45:00,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:00,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008762721] [2025-01-09 09:45:00,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:00,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:00,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-01-09 09:45:00,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-01-09 09:45:00,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:00,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:08,890 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 09:45:08,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:08,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008762721] [2025-01-09 09:45:08,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008762721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:08,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:08,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 09:45:08,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172649971] [2025-01-09 09:45:08,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:08,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 09:45:08,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:08,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 09:45:08,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-01-09 09:45:08,893 INFO L87 Difference]: Start difference. First operand 10396 states and 16318 transitions. Second operand has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 3 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 3 states have call predecessors, (73), 3 states have call successors, (73)