./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-34.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 68ec8a45185640c14efe48000e9f98891ce6fe2387f90662afdebba9912124a6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:27:42,771 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:27:42,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 11:27:42,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:27:42,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:27:42,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:27:42,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:27:42,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:27:42,864 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:27:42,864 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:27:42,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:27:42,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:27:42,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:27:42,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:27:42,865 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:27:42,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:27:42,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:27:42,866 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:27:42,866 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:27:42,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:27:42,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:27:42,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:27:42,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:27:42,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:27:42,867 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:27:42,867 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:27:42,867 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:27:42,867 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:27:42,867 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:27:42,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:27:42,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:27:42,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:27:42,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:27:42,868 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:27:42,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:27:42,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:27:42,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:27:42,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:27:42,868 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:27:42,868 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:27:42,868 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:27:42,868 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:27:42,868 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:27:42,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:27:42,869 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:27:42,869 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:27:42,869 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:27:42,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:27:42,869 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 -> 68ec8a45185640c14efe48000e9f98891ce6fe2387f90662afdebba9912124a6 [2025-01-09 11:27:43,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:27:43,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:27:43,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:27:43,098 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:27:43,099 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:27:43,100 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-34.i [2025-01-09 11:27:44,230 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d1b159d2/99728a4e1ffb4217933b40d6750cc05b/FLAGbed566036 [2025-01-09 11:27:44,433 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:27:44,434 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-34.i [2025-01-09 11:27:44,440 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d1b159d2/99728a4e1ffb4217933b40d6750cc05b/FLAGbed566036 [2025-01-09 11:27:44,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d1b159d2/99728a4e1ffb4217933b40d6750cc05b [2025-01-09 11:27:44,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:27:44,795 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:27:44,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:27:44,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:27:44,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:27:44,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:27:44" (1/1) ... [2025-01-09 11:27:44,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fc30995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:44, skipping insertion in model container [2025-01-09 11:27:44,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:27:44" (1/1) ... [2025-01-09 11:27:44,811 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:27:44,906 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-34.i[919,932] [2025-01-09 11:27:44,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:27:44,955 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:27:44,964 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-34.i[919,932] [2025-01-09 11:27:44,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:27:45,003 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:27:45,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:45 WrapperNode [2025-01-09 11:27:45,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:27:45,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:27:45,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:27:45,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:27:45,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:45" (1/1) ... [2025-01-09 11:27:45,016 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:45" (1/1) ... [2025-01-09 11:27:45,050 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 245 [2025-01-09 11:27:45,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:27:45,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:27:45,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:27:45,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:27:45,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:45" (1/1) ... [2025-01-09 11:27:45,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:45" (1/1) ... [2025-01-09 11:27:45,060 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:45" (1/1) ... [2025-01-09 11:27:45,071 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 11:27:45,078 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:45" (1/1) ... [2025-01-09 11:27:45,079 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:45" (1/1) ... [2025-01-09 11:27:45,087 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:45" (1/1) ... [2025-01-09 11:27:45,089 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:45" (1/1) ... [2025-01-09 11:27:45,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:45" (1/1) ... [2025-01-09 11:27:45,098 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:45" (1/1) ... [2025-01-09 11:27:45,099 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:45" (1/1) ... [2025-01-09 11:27:45,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:27:45,103 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:27:45,103 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:27:45,103 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:27:45,104 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:45" (1/1) ... [2025-01-09 11:27:45,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:27:45,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:27:45,135 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 11:27:45,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 11:27:45,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:27:45,152 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:27:45,153 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:27:45,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:27:45,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:27:45,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:27:45,209 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:27:45,210 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:27:45,524 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-01-09 11:27:45,525 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:27:45,531 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:27:45,532 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:27:45,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:27:45 BoogieIcfgContainer [2025-01-09 11:27:45,532 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:27:45,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:27:45,534 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:27:45,537 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:27:45,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:27:44" (1/3) ... [2025-01-09 11:27:45,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9eace5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:27:45, skipping insertion in model container [2025-01-09 11:27:45,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:27:45" (2/3) ... [2025-01-09 11:27:45,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9eace5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:27:45, skipping insertion in model container [2025-01-09 11:27:45,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:27:45" (3/3) ... [2025-01-09 11:27:45,538 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-34.i [2025-01-09 11:27:45,547 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:27:45,549 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-34.i that has 2 procedures, 102 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:27:45,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:27:45,601 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;@5092d2fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:27:45,601 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:27:45,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 73 states have internal predecessors, (107), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 11:27:45,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 11:27:45,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:27:45,614 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:27:45,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:27:45,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:27:45,617 INFO L85 PathProgramCache]: Analyzing trace with hash 89464023, now seen corresponding path program 1 times [2025-01-09 11:27:45,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:27:45,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668663497] [2025-01-09 11:27:45,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:45,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:27:45,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 11:27:45,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 11:27:45,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:45,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:45,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-01-09 11:27:45,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:27:45,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668663497] [2025-01-09 11:27:45,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668663497] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:27:45,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146349885] [2025-01-09 11:27:45,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:45,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:27:45,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:27:45,900 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:27:45,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 11:27:45,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 11:27:46,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 11:27:46,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:46,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:46,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:27:46,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:27:46,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-01-09 11:27:46,040 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:27:46,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146349885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:27:46,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:27:46,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 11:27:46,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157008009] [2025-01-09 11:27:46,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:27:46,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:27:46,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:27:46,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:27:46,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:27:46,061 INFO L87 Difference]: Start difference. First operand has 102 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 73 states have internal predecessors, (107), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 11:27:46,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:27:46,078 INFO L93 Difference]: Finished difference Result 198 states and 344 transitions. [2025-01-09 11:27:46,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:27:46,081 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 179 [2025-01-09 11:27:46,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:27:46,085 INFO L225 Difference]: With dead ends: 198 [2025-01-09 11:27:46,085 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 11:27:46,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:27:46,089 INFO L435 NwaCegarLoop]: 156 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, 156 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:27:46,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:27:46,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 11:27:46,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 11:27:46,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 70 states have (on average 1.457142857142857) internal successors, (102), 70 states have internal predecessors, (102), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 11:27:46,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 156 transitions. [2025-01-09 11:27:46,118 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 156 transitions. Word has length 179 [2025-01-09 11:27:46,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:27:46,118 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 156 transitions. [2025-01-09 11:27:46,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 11:27:46,118 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 156 transitions. [2025-01-09 11:27:46,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 11:27:46,120 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:27:46,120 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:27:46,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 11:27:46,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 11:27:46,321 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:27:46,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:27:46,322 INFO L85 PathProgramCache]: Analyzing trace with hash 632712029, now seen corresponding path program 1 times [2025-01-09 11:27:46,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:27:46,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972240446] [2025-01-09 11:27:46,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:46,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:27:46,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 11:27:46,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 11:27:46,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:46,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:27:46,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:27:46,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972240446] [2025-01-09 11:27:46,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972240446] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:27:46,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:27:46,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:27:46,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286548587] [2025-01-09 11:27:46,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:27:46,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:27:46,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:27:46,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:27:46,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:27:46,798 INFO L87 Difference]: Start difference. First operand 99 states and 156 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:27:46,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:27:46,944 INFO L93 Difference]: Finished difference Result 331 states and 526 transitions. [2025-01-09 11:27:46,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:27:46,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 179 [2025-01-09 11:27:46,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:27:46,946 INFO L225 Difference]: With dead ends: 331 [2025-01-09 11:27:46,946 INFO L226 Difference]: Without dead ends: 235 [2025-01-09 11:27:46,947 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 11:27:46,948 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 170 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:27:46,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 505 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:27:46,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-01-09 11:27:46,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 203. [2025-01-09 11:27:46,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 146 states have (on average 1.4863013698630136) internal successors, (217), 146 states have internal predecessors, (217), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 11:27:46,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 325 transitions. [2025-01-09 11:27:46,978 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 325 transitions. Word has length 179 [2025-01-09 11:27:46,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:27:46,979 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 325 transitions. [2025-01-09 11:27:46,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:27:46,979 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 325 transitions. [2025-01-09 11:27:46,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 11:27:46,981 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:27:46,981 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:27:46,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:27:46,982 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:27:46,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:27:46,982 INFO L85 PathProgramCache]: Analyzing trace with hash 287290012, now seen corresponding path program 1 times [2025-01-09 11:27:46,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:27:46,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30178597] [2025-01-09 11:27:46,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:46,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:27:46,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 11:27:47,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 11:27:47,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:47,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:27:47,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:27:47,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30178597] [2025-01-09 11:27:47,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30178597] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:27:47,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:27:47,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:27:47,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364440867] [2025-01-09 11:27:47,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:27:47,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:27:47,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:27:47,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:27:47,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:27:47,253 INFO L87 Difference]: Start difference. First operand 203 states and 325 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:27:47,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:27:47,530 INFO L93 Difference]: Finished difference Result 594 states and 952 transitions. [2025-01-09 11:27:47,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:27:47,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 180 [2025-01-09 11:27:47,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:27:47,535 INFO L225 Difference]: With dead ends: 594 [2025-01-09 11:27:47,537 INFO L226 Difference]: Without dead ends: 394 [2025-01-09 11:27:47,539 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 11:27:47,539 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 188 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:27:47,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 541 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:27:47,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-01-09 11:27:47,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 207. [2025-01-09 11:27:47,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 150 states have (on average 1.4733333333333334) internal successors, (221), 150 states have internal predecessors, (221), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 11:27:47,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 329 transitions. [2025-01-09 11:27:47,586 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 329 transitions. Word has length 180 [2025-01-09 11:27:47,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:27:47,587 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 329 transitions. [2025-01-09 11:27:47,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:27:47,587 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 329 transitions. [2025-01-09 11:27:47,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 11:27:47,589 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:27:47,589 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:27:47,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:27:47,589 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:27:47,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:27:47,590 INFO L85 PathProgramCache]: Analyzing trace with hash 405744134, now seen corresponding path program 1 times [2025-01-09 11:27:47,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:27:47,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470774682] [2025-01-09 11:27:47,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:47,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:27:47,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 11:27:47,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 11:27:47,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:47,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:47,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:27:47,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:27:47,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470774682] [2025-01-09 11:27:47,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470774682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:27:47,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:27:47,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:27:47,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004914303] [2025-01-09 11:27:47,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:27:47,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:27:47,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:27:47,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:27:47,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:27:47,996 INFO L87 Difference]: Start difference. First operand 207 states and 329 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:27:48,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:27:48,055 INFO L93 Difference]: Finished difference Result 472 states and 752 transitions. [2025-01-09 11:27:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:27:48,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-01-09 11:27:48,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:27:48,058 INFO L225 Difference]: With dead ends: 472 [2025-01-09 11:27:48,058 INFO L226 Difference]: Without dead ends: 268 [2025-01-09 11:27:48,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:27:48,059 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 150 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:27:48,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 331 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:27:48,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-01-09 11:27:48,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 207. [2025-01-09 11:27:48,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 150 states have (on average 1.4533333333333334) internal successors, (218), 150 states have internal predecessors, (218), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 11:27:48,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 326 transitions. [2025-01-09 11:27:48,087 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 326 transitions. Word has length 181 [2025-01-09 11:27:48,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:27:48,087 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 326 transitions. [2025-01-09 11:27:48,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:27:48,088 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 326 transitions. [2025-01-09 11:27:48,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 11:27:48,089 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:27:48,090 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:27:48,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 11:27:48,090 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:27:48,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:27:48,090 INFO L85 PathProgramCache]: Analyzing trace with hash -16957692, now seen corresponding path program 1 times [2025-01-09 11:27:48,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:27:48,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999448811] [2025-01-09 11:27:48,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:48,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:27:48,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 11:27:48,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 11:27:48,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:48,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:27:56,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:27:56,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:27:56,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999448811] [2025-01-09 11:27:56,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999448811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:27:56,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:27:56,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 11:27:56,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536548187] [2025-01-09 11:27:56,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:27:56,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 11:27:56,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:27:56,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 11:27:56,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 11:27:56,551 INFO L87 Difference]: Start difference. First operand 207 states and 326 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:27:58,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:27:58,849 INFO L93 Difference]: Finished difference Result 745 states and 1146 transitions. [2025-01-09 11:27:58,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 11:27:58,850 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-01-09 11:27:58,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:27:58,855 INFO L225 Difference]: With dead ends: 745 [2025-01-09 11:27:58,855 INFO L226 Difference]: Without dead ends: 541 [2025-01-09 11:27:58,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2025-01-09 11:27:58,857 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 603 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:27:58,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 813 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 11:27:58,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-01-09 11:27:58,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 387. [2025-01-09 11:27:58,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 302 states have (on average 1.4768211920529801) internal successors, (446), 302 states have internal predecessors, (446), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 11:27:58,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 608 transitions. [2025-01-09 11:27:58,887 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 608 transitions. Word has length 181 [2025-01-09 11:27:58,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:27:58,889 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 608 transitions. [2025-01-09 11:27:58,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:27:58,891 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 608 transitions. [2025-01-09 11:27:58,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 11:27:58,893 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:27:58,893 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:27:58,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 11:27:58,893 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:27:58,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:27:58,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1758049670, now seen corresponding path program 1 times [2025-01-09 11:27:58,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:27:58,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155614132] [2025-01-09 11:27:58,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:27:58,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:27:58,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 11:27:58,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 11:27:58,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:27:58,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:00,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:28:00,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:00,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155614132] [2025-01-09 11:28:00,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155614132] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:00,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:00,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 11:28:00,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211223827] [2025-01-09 11:28:00,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:00,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 11:28:00,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:00,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 11:28:00,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 11:28:00,387 INFO L87 Difference]: Start difference. First operand 387 states and 608 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:28:01,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:01,323 INFO L93 Difference]: Finished difference Result 842 states and 1311 transitions. [2025-01-09 11:28:01,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 11:28:01,324 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-01-09 11:28:01,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:01,326 INFO L225 Difference]: With dead ends: 842 [2025-01-09 11:28:01,326 INFO L226 Difference]: Without dead ends: 622 [2025-01-09 11:28:01,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-01-09 11:28:01,329 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 499 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:01,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 588 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 11:28:01,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2025-01-09 11:28:01,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 452. [2025-01-09 11:28:01,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 367 states have (on average 1.4850136239782017) internal successors, (545), 367 states have internal predecessors, (545), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 11:28:01,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 707 transitions. [2025-01-09 11:28:01,360 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 707 transitions. Word has length 181 [2025-01-09 11:28:01,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:01,360 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 707 transitions. [2025-01-09 11:28:01,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:28:01,360 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 707 transitions. [2025-01-09 11:28:01,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 11:28:01,361 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:01,362 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:01,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 11:28:01,362 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:01,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:01,362 INFO L85 PathProgramCache]: Analyzing trace with hash 663100678, now seen corresponding path program 1 times [2025-01-09 11:28:01,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:01,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600881257] [2025-01-09 11:28:01,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:01,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:01,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 11:28:01,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 11:28:01,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:01,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:02,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:28:02,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:02,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600881257] [2025-01-09 11:28:02,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600881257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:02,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:02,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 11:28:02,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248542027] [2025-01-09 11:28:02,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:02,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 11:28:02,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:02,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 11:28:02,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 11:28:02,999 INFO L87 Difference]: Start difference. First operand 452 states and 707 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:28:03,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:03,882 INFO L93 Difference]: Finished difference Result 810 states and 1249 transitions. [2025-01-09 11:28:03,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 11:28:03,883 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-01-09 11:28:03,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:03,886 INFO L225 Difference]: With dead ends: 810 [2025-01-09 11:28:03,886 INFO L226 Difference]: Without dead ends: 588 [2025-01-09 11:28:03,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-01-09 11:28:03,887 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 431 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:03,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 546 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 11:28:03,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-01-09 11:28:03,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 472. [2025-01-09 11:28:03,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 387 states have (on average 1.496124031007752) internal successors, (579), 387 states have internal predecessors, (579), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 11:28:03,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 741 transitions. [2025-01-09 11:28:03,919 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 741 transitions. Word has length 181 [2025-01-09 11:28:03,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:03,919 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 741 transitions. [2025-01-09 11:28:03,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:28:03,920 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 741 transitions. [2025-01-09 11:28:03,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 11:28:03,922 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:03,922 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:03,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 11:28:03,923 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:03,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:03,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1287090763, now seen corresponding path program 1 times [2025-01-09 11:28:03,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:03,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383422373] [2025-01-09 11:28:03,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:03,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:03,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 11:28:03,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 11:28:03,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:03,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:05,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:28:05,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:05,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383422373] [2025-01-09 11:28:05,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383422373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:05,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:05,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 11:28:05,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602869085] [2025-01-09 11:28:05,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:05,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 11:28:05,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:05,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 11:28:05,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 11:28:05,034 INFO L87 Difference]: Start difference. First operand 472 states and 741 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:28:05,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:05,417 INFO L93 Difference]: Finished difference Result 834 states and 1288 transitions. [2025-01-09 11:28:05,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 11:28:05,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-01-09 11:28:05,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:05,420 INFO L225 Difference]: With dead ends: 834 [2025-01-09 11:28:05,420 INFO L226 Difference]: Without dead ends: 584 [2025-01-09 11:28:05,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-09 11:28:05,422 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 210 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:05,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 472 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:28:05,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-01-09 11:28:05,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 482. [2025-01-09 11:28:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 397 states have (on average 1.4836272040302267) internal successors, (589), 397 states have internal predecessors, (589), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 11:28:05,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 751 transitions. [2025-01-09 11:28:05,456 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 751 transitions. Word has length 181 [2025-01-09 11:28:05,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:05,457 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 751 transitions. [2025-01-09 11:28:05,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:28:05,457 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 751 transitions. [2025-01-09 11:28:05,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 11:28:05,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:05,458 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:05,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 11:28:05,459 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:05,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:05,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1038026046, now seen corresponding path program 1 times [2025-01-09 11:28:05,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:05,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228822852] [2025-01-09 11:28:05,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:05,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:05,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 11:28:05,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 11:28:05,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:05,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:05,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:28:05,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:05,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228822852] [2025-01-09 11:28:05,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228822852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:05,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:05,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:28:05,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572582837] [2025-01-09 11:28:05,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:05,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:28:05,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:05,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:28:05,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:28:05,699 INFO L87 Difference]: Start difference. First operand 482 states and 751 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:28:05,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:05,909 INFO L93 Difference]: Finished difference Result 746 states and 1159 transitions. [2025-01-09 11:28:05,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:28:05,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-01-09 11:28:05,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:05,911 INFO L225 Difference]: With dead ends: 746 [2025-01-09 11:28:05,912 INFO L226 Difference]: Without dead ends: 474 [2025-01-09 11:28:05,913 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 11:28:05,914 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 102 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:05,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 381 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:28:05,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-01-09 11:28:05,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 446. [2025-01-09 11:28:05,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 361 states have (on average 1.4598337950138505) internal successors, (527), 361 states have internal predecessors, (527), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 11:28:05,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 689 transitions. [2025-01-09 11:28:05,945 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 689 transitions. Word has length 181 [2025-01-09 11:28:05,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:05,945 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 689 transitions. [2025-01-09 11:28:05,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:28:05,945 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 689 transitions. [2025-01-09 11:28:05,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 11:28:05,948 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:05,948 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:05,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 11:28:05,948 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:05,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:05,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1256234189, now seen corresponding path program 1 times [2025-01-09 11:28:05,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:05,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691382582] [2025-01-09 11:28:05,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:05,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:05,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 11:28:06,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 11:28:06,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:06,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:07,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:28:07,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:07,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691382582] [2025-01-09 11:28:07,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691382582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:07,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:07,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 11:28:07,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277897604] [2025-01-09 11:28:07,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:07,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 11:28:07,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:07,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 11:28:07,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 11:28:07,819 INFO L87 Difference]: Start difference. First operand 446 states and 689 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:28:08,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:08,816 INFO L93 Difference]: Finished difference Result 837 states and 1267 transitions. [2025-01-09 11:28:08,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 11:28:08,817 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 182 [2025-01-09 11:28:08,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:08,819 INFO L225 Difference]: With dead ends: 837 [2025-01-09 11:28:08,819 INFO L226 Difference]: Without dead ends: 633 [2025-01-09 11:28:08,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:28:08,820 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 230 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:08,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 847 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 11:28:08,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-01-09 11:28:08,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 474. [2025-01-09 11:28:08,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 387 states have (on average 1.4392764857881137) internal successors, (557), 387 states have internal predecessors, (557), 81 states have call successors, (81), 5 states have call predecessors, (81), 5 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 11:28:08,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 719 transitions. [2025-01-09 11:28:08,852 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 719 transitions. Word has length 182 [2025-01-09 11:28:08,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:08,853 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 719 transitions. [2025-01-09 11:28:08,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:28:08,853 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 719 transitions. [2025-01-09 11:28:08,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 11:28:08,854 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:08,855 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:08,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 11:28:08,855 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:08,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:08,855 INFO L85 PathProgramCache]: Analyzing trace with hash 704633820, now seen corresponding path program 1 times [2025-01-09 11:28:08,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:08,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046103260] [2025-01-09 11:28:08,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:08,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:08,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 11:28:08,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 11:28:08,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:08,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:11,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:28:11,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:11,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046103260] [2025-01-09 11:28:11,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046103260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:11,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:11,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 11:28:11,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90101832] [2025-01-09 11:28:11,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:11,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 11:28:11,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:11,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 11:28:11,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-01-09 11:28:11,113 INFO L87 Difference]: Start difference. First operand 474 states and 719 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:28:13,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:13,361 INFO L93 Difference]: Finished difference Result 1113 states and 1676 transitions. [2025-01-09 11:28:13,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 11:28:13,361 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 182 [2025-01-09 11:28:13,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:13,364 INFO L225 Difference]: With dead ends: 1113 [2025-01-09 11:28:13,364 INFO L226 Difference]: Without dead ends: 823 [2025-01-09 11:28:13,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=159, Invalid=347, Unknown=0, NotChecked=0, Total=506 [2025-01-09 11:28:13,365 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 434 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:13,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 731 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 11:28:13,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2025-01-09 11:28:13,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 603. [2025-01-09 11:28:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 516 states have (on average 1.4670542635658914) internal successors, (757), 516 states have internal predecessors, (757), 81 states have call successors, (81), 5 states have call predecessors, (81), 5 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 11:28:13,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 919 transitions. [2025-01-09 11:28:13,399 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 919 transitions. Word has length 182 [2025-01-09 11:28:13,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:13,399 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 919 transitions. [2025-01-09 11:28:13,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:28:13,400 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 919 transitions. [2025-01-09 11:28:13,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 11:28:13,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:13,401 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:13,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 11:28:13,401 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:13,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:13,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1384692190, now seen corresponding path program 1 times [2025-01-09 11:28:13,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:13,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504772866] [2025-01-09 11:28:13,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:13,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:13,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 11:28:13,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 11:28:13,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:13,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:28:18,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:18,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504772866] [2025-01-09 11:28:18,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504772866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:18,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:18,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 11:28:18,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446891235] [2025-01-09 11:28:18,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:18,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 11:28:18,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:18,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 11:28:18,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-01-09 11:28:18,192 INFO L87 Difference]: Start difference. First operand 603 states and 919 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:28:20,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:20,241 INFO L93 Difference]: Finished difference Result 1108 states and 1658 transitions. [2025-01-09 11:28:20,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 11:28:20,241 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 182 [2025-01-09 11:28:20,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:20,244 INFO L225 Difference]: With dead ends: 1108 [2025-01-09 11:28:20,244 INFO L226 Difference]: Without dead ends: 719 [2025-01-09 11:28:20,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2025-01-09 11:28:20,246 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 346 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:20,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 983 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 11:28:20,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2025-01-09 11:28:20,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 603. [2025-01-09 11:28:20,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 516 states have (on average 1.4651162790697674) internal successors, (756), 516 states have internal predecessors, (756), 81 states have call successors, (81), 5 states have call predecessors, (81), 5 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 11:28:20,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 918 transitions. [2025-01-09 11:28:20,280 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 918 transitions. Word has length 182 [2025-01-09 11:28:20,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:20,280 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 918 transitions. [2025-01-09 11:28:20,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:28:20,281 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 918 transitions. [2025-01-09 11:28:20,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 11:28:20,281 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:20,282 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:20,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 11:28:20,282 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:20,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:20,282 INFO L85 PathProgramCache]: Analyzing trace with hash -198865841, now seen corresponding path program 1 times [2025-01-09 11:28:20,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:20,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300545614] [2025-01-09 11:28:20,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:20,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:20,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 11:28:20,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 11:28:20,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:20,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:28:22,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:22,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300545614] [2025-01-09 11:28:22,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300545614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:22,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:22,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 11:28:22,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145961246] [2025-01-09 11:28:22,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:22,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 11:28:22,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:22,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 11:28:22,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 11:28:22,773 INFO L87 Difference]: Start difference. First operand 603 states and 918 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:28:25,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:25,114 INFO L93 Difference]: Finished difference Result 1533 states and 2281 transitions. [2025-01-09 11:28:25,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 11:28:25,115 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 183 [2025-01-09 11:28:25,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:25,129 INFO L225 Difference]: With dead ends: 1533 [2025-01-09 11:28:25,129 INFO L226 Difference]: Without dead ends: 1215 [2025-01-09 11:28:25,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2025-01-09 11:28:25,130 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 611 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:25,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 519 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 11:28:25,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2025-01-09 11:28:25,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 689. [2025-01-09 11:28:25,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 602 states have (on average 1.4684385382059801) internal successors, (884), 602 states have internal predecessors, (884), 81 states have call successors, (81), 5 states have call predecessors, (81), 5 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 11:28:25,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1046 transitions. [2025-01-09 11:28:25,168 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1046 transitions. Word has length 183 [2025-01-09 11:28:25,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:25,168 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1046 transitions. [2025-01-09 11:28:25,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:28:25,168 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1046 transitions. [2025-01-09 11:28:25,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 11:28:25,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:25,169 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:25,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 11:28:25,170 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:25,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:25,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1219934195, now seen corresponding path program 1 times [2025-01-09 11:28:25,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:25,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601020600] [2025-01-09 11:28:25,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:25,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:25,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 11:28:25,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 11:28:25,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:25,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:27,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:28:27,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:27,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601020600] [2025-01-09 11:28:27,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601020600] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:27,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:27,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 11:28:27,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898145895] [2025-01-09 11:28:27,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:27,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 11:28:27,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:27,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 11:28:27,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 11:28:27,455 INFO L87 Difference]: Start difference. First operand 689 states and 1046 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:28:28,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:28,592 INFO L93 Difference]: Finished difference Result 1383 states and 2081 transitions. [2025-01-09 11:28:28,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 11:28:28,592 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 183 [2025-01-09 11:28:28,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:28,596 INFO L225 Difference]: With dead ends: 1383 [2025-01-09 11:28:28,596 INFO L226 Difference]: Without dead ends: 1033 [2025-01-09 11:28:28,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:28:28,597 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 340 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:28,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 643 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 11:28:28,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2025-01-09 11:28:28,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 609. [2025-01-09 11:28:28,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 522 states have (on average 1.4636015325670497) internal successors, (764), 522 states have internal predecessors, (764), 81 states have call successors, (81), 5 states have call predecessors, (81), 5 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 11:28:28,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 926 transitions. [2025-01-09 11:28:28,633 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 926 transitions. Word has length 183 [2025-01-09 11:28:28,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:28,633 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 926 transitions. [2025-01-09 11:28:28,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:28:28,633 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 926 transitions. [2025-01-09 11:28:28,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 11:28:28,634 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:28,634 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:28,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 11:28:28,634 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:28,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:28,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1964016329, now seen corresponding path program 1 times [2025-01-09 11:28:28,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:28,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356562092] [2025-01-09 11:28:28,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:28,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:28,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 11:28:28,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 11:28:28,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:28,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:35,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:28:35,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:35,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356562092] [2025-01-09 11:28:35,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356562092] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:35,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:35,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 11:28:35,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17840986] [2025-01-09 11:28:35,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:35,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 11:28:35,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:35,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 11:28:35,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-01-09 11:28:35,670 INFO L87 Difference]: Start difference. First operand 609 states and 926 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:28:38,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:38,643 INFO L93 Difference]: Finished difference Result 1113 states and 1662 transitions. [2025-01-09 11:28:38,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 11:28:38,644 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 183 [2025-01-09 11:28:38,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:38,647 INFO L225 Difference]: With dead ends: 1113 [2025-01-09 11:28:38,647 INFO L226 Difference]: Without dead ends: 787 [2025-01-09 11:28:38,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-01-09 11:28:38,650 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 390 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:38,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 800 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 11:28:38,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2025-01-09 11:28:38,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 617. [2025-01-09 11:28:38,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 530 states have (on average 1.4641509433962263) internal successors, (776), 530 states have internal predecessors, (776), 81 states have call successors, (81), 5 states have call predecessors, (81), 5 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 11:28:38,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 938 transitions. [2025-01-09 11:28:38,683 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 938 transitions. Word has length 183 [2025-01-09 11:28:38,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:38,684 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 938 transitions. [2025-01-09 11:28:38,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:28:38,684 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 938 transitions. [2025-01-09 11:28:38,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 11:28:38,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:38,685 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:38,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 11:28:38,685 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:38,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:38,685 INFO L85 PathProgramCache]: Analyzing trace with hash 869067337, now seen corresponding path program 1 times [2025-01-09 11:28:38,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:38,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474672458] [2025-01-09 11:28:38,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:38,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:38,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 11:28:38,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 11:28:38,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:38,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:28:41,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:41,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474672458] [2025-01-09 11:28:41,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474672458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:41,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:41,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 11:28:41,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724311222] [2025-01-09 11:28:41,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:41,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 11:28:41,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:41,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 11:28:41,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-01-09 11:28:41,213 INFO L87 Difference]: Start difference. First operand 617 states and 938 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:28:42,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:42,476 INFO L93 Difference]: Finished difference Result 1184 states and 1777 transitions. [2025-01-09 11:28:42,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 11:28:42,476 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 183 [2025-01-09 11:28:42,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:42,479 INFO L225 Difference]: With dead ends: 1184 [2025-01-09 11:28:42,479 INFO L226 Difference]: Without dead ends: 763 [2025-01-09 11:28:42,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2025-01-09 11:28:42,480 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 662 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:42,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 700 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 11:28:42,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2025-01-09 11:28:42,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 633. [2025-01-09 11:28:42,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 546 states have (on average 1.4523809523809523) internal successors, (793), 546 states have internal predecessors, (793), 81 states have call successors, (81), 5 states have call predecessors, (81), 5 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 11:28:42,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 955 transitions. [2025-01-09 11:28:42,516 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 955 transitions. Word has length 183 [2025-01-09 11:28:42,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:42,516 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 955 transitions. [2025-01-09 11:28:42,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:28:42,517 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 955 transitions. [2025-01-09 11:28:42,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 11:28:42,518 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:42,518 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:42,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 11:28:42,518 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:42,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:42,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1650892597, now seen corresponding path program 1 times [2025-01-09 11:28:42,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:42,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180225802] [2025-01-09 11:28:42,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:42,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:42,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 11:28:42,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 11:28:42,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:42,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:28:49,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:49,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180225802] [2025-01-09 11:28:49,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180225802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:49,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:49,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 11:28:49,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054094528] [2025-01-09 11:28:49,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:49,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 11:28:49,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:49,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 11:28:49,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-01-09 11:28:49,368 INFO L87 Difference]: Start difference. First operand 633 states and 955 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:28:53,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:53,237 INFO L93 Difference]: Finished difference Result 1263 states and 1853 transitions. [2025-01-09 11:28:53,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 11:28:53,238 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 183 [2025-01-09 11:28:53,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:53,241 INFO L225 Difference]: With dead ends: 1263 [2025-01-09 11:28:53,241 INFO L226 Difference]: Without dead ends: 937 [2025-01-09 11:28:53,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2025-01-09 11:28:53,242 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 488 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:53,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 970 Invalid, 1511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1415 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 11:28:53,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2025-01-09 11:28:53,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 679. [2025-01-09 11:28:53,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 592 states have (on average 1.4560810810810811) internal successors, (862), 592 states have internal predecessors, (862), 81 states have call successors, (81), 5 states have call predecessors, (81), 5 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 11:28:53,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1024 transitions. [2025-01-09 11:28:53,280 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1024 transitions. Word has length 183 [2025-01-09 11:28:53,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:53,280 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 1024 transitions. [2025-01-09 11:28:53,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:28:53,280 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1024 transitions. [2025-01-09 11:28:53,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-09 11:28:53,281 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:53,281 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:53,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 11:28:53,282 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:53,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:53,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1691031731, now seen corresponding path program 1 times [2025-01-09 11:28:53,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:53,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478585625] [2025-01-09 11:28:53,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:53,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:53,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 11:28:53,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 11:28:53,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:53,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat