./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_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_fillercodesize_ps-cn-10_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 a356de088718b875f6f2396a50433e83aa6fe2b03aff9fb8f00ce9106af95d3b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:29:53,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:29:53,269 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:29:53,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:29:53,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:29:53,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:29:53,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:29:53,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:29:53,298 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:29:53,299 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:29:53,299 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:29:53,299 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:29:53,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:29:53,300 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:29:53,300 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:29:53,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:29:53,300 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:29:53,300 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:29:53,300 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:29:53,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:29:53,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:29:53,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:29:53,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:29:53,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:29:53,300 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:29:53,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:29:53,301 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:29:53,301 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:29:53,301 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:29:53,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:29:53,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:29:53,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:29:53,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:29:53,301 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:29:53,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:29:53,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:29:53,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:29:53,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:29:53,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:29:53,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:29:53,302 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:29:53,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:29:53,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:29:53,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:29:53,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:29:53,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:29:53,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:29:53,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:29:53,302 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 -> a356de088718b875f6f2396a50433e83aa6fe2b03aff9fb8f00ce9106af95d3b [2025-01-09 09:29:53,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:29:53,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:29:53,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:29:53,581 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:29:53,581 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:29:53,582 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-34.i [2025-01-09 09:29:54,897 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fabf07e3/bdf0cd7ea042424bb6b437af04b851fa/FLAGe7df1c901 [2025-01-09 09:29:55,235 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:29:55,237 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-34.i [2025-01-09 09:29:55,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fabf07e3/bdf0cd7ea042424bb6b437af04b851fa/FLAGe7df1c901 [2025-01-09 09:29:55,271 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fabf07e3/bdf0cd7ea042424bb6b437af04b851fa [2025-01-09 09:29:55,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:29:55,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:29:55,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:29:55,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:29:55,282 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:29:55,283 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:29:55" (1/1) ... [2025-01-09 09:29:55,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4366b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55, skipping insertion in model container [2025-01-09 09:29:55,285 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:29:55" (1/1) ... [2025-01-09 09:29:55,308 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:29:55,443 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-34.i[915,928] [2025-01-09 09:29:55,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:29:55,539 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:29:55,550 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-34.i[915,928] [2025-01-09 09:29:55,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:29:55,621 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:29:55,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55 WrapperNode [2025-01-09 09:29:55,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:29:55,624 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:29:55,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:29:55,624 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:29:55,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55" (1/1) ... [2025-01-09 09:29:55,644 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55" (1/1) ... [2025-01-09 09:29:55,688 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 221 [2025-01-09 09:29:55,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:29:55,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:29:55,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:29:55,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:29:55,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55" (1/1) ... [2025-01-09 09:29:55,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55" (1/1) ... [2025-01-09 09:29:55,704 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55" (1/1) ... [2025-01-09 09:29:55,734 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 09:29:55,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55" (1/1) ... [2025-01-09 09:29:55,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55" (1/1) ... [2025-01-09 09:29:55,748 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55" (1/1) ... [2025-01-09 09:29:55,749 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55" (1/1) ... [2025-01-09 09:29:55,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55" (1/1) ... [2025-01-09 09:29:55,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55" (1/1) ... [2025-01-09 09:29:55,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55" (1/1) ... [2025-01-09 09:29:55,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:29:55,772 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:29:55,775 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:29:55,776 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:29:55,777 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55" (1/1) ... [2025-01-09 09:29:55,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:29:55,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:29:55,808 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 09:29:55,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 09:29:55,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:29:55,834 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:29:55,834 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:29:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:29:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:29:55,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:29:55,912 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:29:55,914 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:29:56,332 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-01-09 09:29:56,332 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:29:56,345 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:29:56,347 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:29:56,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:56 BoogieIcfgContainer [2025-01-09 09:29:56,348 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:29:56,350 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:29:56,350 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:29:56,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:29:56,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:29:55" (1/3) ... [2025-01-09 09:29:56,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e29c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:29:56, skipping insertion in model container [2025-01-09 09:29:56,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55" (2/3) ... [2025-01-09 09:29:56,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e29c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:29:56, skipping insertion in model container [2025-01-09 09:29:56,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:56" (3/3) ... [2025-01-09 09:29:56,360 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-34.i [2025-01-09 09:29:56,373 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:29:56,376 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-34.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:29:56,433 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:29:56,443 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;@53c66a31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:29:56,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:29:56,449 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 09:29:56,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 09:29:56,462 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:29:56,462 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:29:56,463 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:29:56,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:29:56,469 INFO L85 PathProgramCache]: Analyzing trace with hash -890425245, now seen corresponding path program 1 times [2025-01-09 09:29:56,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:29:56,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294079129] [2025-01-09 09:29:56,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:29:56,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:29:56,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 09:29:56,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 09:29:56,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:29:56,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:29:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 09:29:57,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:29:57,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294079129] [2025-01-09 09:29:57,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294079129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:29:57,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:29:57,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:29:57,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52507157] [2025-01-09 09:29:57,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:29:57,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:29:57,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:29:57,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:29:57,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:29:57,355 INFO L87 Difference]: Start difference. First operand has 85 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:29:57,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:29:57,619 INFO L93 Difference]: Finished difference Result 273 states and 471 transitions. [2025-01-09 09:29:57,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:29:57,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2025-01-09 09:29:57,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:29:57,634 INFO L225 Difference]: With dead ends: 273 [2025-01-09 09:29:57,635 INFO L226 Difference]: Without dead ends: 191 [2025-01-09 09:29:57,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:29:57,641 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 135 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:29:57,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 393 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:29:57,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-01-09 09:29:57,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 161. [2025-01-09 09:29:57,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 114 states have (on average 1.394736842105263) internal successors, (159), 114 states have internal predecessors, (159), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 09:29:57,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 247 transitions. [2025-01-09 09:29:57,724 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 247 transitions. Word has length 145 [2025-01-09 09:29:57,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:29:57,727 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 247 transitions. [2025-01-09 09:29:57,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:29:57,727 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 247 transitions. [2025-01-09 09:29:57,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 09:29:57,731 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:29:57,731 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:29:57,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 09:29:57,732 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:29:57,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:29:57,732 INFO L85 PathProgramCache]: Analyzing trace with hash -109281795, now seen corresponding path program 1 times [2025-01-09 09:29:57,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:29:57,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843903153] [2025-01-09 09:29:57,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:29:57,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:29:57,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 09:29:57,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 09:29:57,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:29:57,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:29:58,154 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 09:29:58,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:29:58,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843903153] [2025-01-09 09:29:58,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843903153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:29:58,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:29:58,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:29:58,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521088755] [2025-01-09 09:29:58,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:29:58,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:29:58,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:29:58,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:29:58,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:29:58,159 INFO L87 Difference]: Start difference. First operand 161 states and 247 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:29:58,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:29:58,478 INFO L93 Difference]: Finished difference Result 472 states and 724 transitions. [2025-01-09 09:29:58,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:29:58,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-01-09 09:29:58,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:29:58,485 INFO L225 Difference]: With dead ends: 472 [2025-01-09 09:29:58,485 INFO L226 Difference]: Without dead ends: 314 [2025-01-09 09:29:58,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:29:58,487 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 191 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:29:58,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 371 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:29:58,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-01-09 09:29:58,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 165. [2025-01-09 09:29:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 118 states have (on average 1.38135593220339) internal successors, (163), 118 states have internal predecessors, (163), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 09:29:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 251 transitions. [2025-01-09 09:29:58,522 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 251 transitions. Word has length 146 [2025-01-09 09:29:58,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:29:58,523 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 251 transitions. [2025-01-09 09:29:58,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:29:58,523 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 251 transitions. [2025-01-09 09:29:58,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 09:29:58,525 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:29:58,525 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:29:58,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:29:58,525 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:29:58,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:29:58,526 INFO L85 PathProgramCache]: Analyzing trace with hash -713693365, now seen corresponding path program 1 times [2025-01-09 09:29:58,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:29:58,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632320426] [2025-01-09 09:29:58,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:29:58,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:29:58,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 09:29:58,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 09:29:58,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:29:58,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:29:58,824 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 09:29:58,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:29:58,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632320426] [2025-01-09 09:29:58,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632320426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:29:58,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:29:58,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:29:58,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860458361] [2025-01-09 09:29:58,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:29:58,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:29:58,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:29:58,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:29:58,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:29:58,826 INFO L87 Difference]: Start difference. First operand 165 states and 251 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:29:59,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:29:59,017 INFO L93 Difference]: Finished difference Result 440 states and 669 transitions. [2025-01-09 09:29:59,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:29:59,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2025-01-09 09:29:59,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:29:59,020 INFO L225 Difference]: With dead ends: 440 [2025-01-09 09:29:59,020 INFO L226 Difference]: Without dead ends: 278 [2025-01-09 09:29:59,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:29:59,025 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 100 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:29:59,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 467 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:29:59,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-01-09 09:29:59,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 210. [2025-01-09 09:29:59,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 140 states have (on average 1.3428571428571427) internal successors, (188), 140 states have internal predecessors, (188), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 09:29:59,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 320 transitions. [2025-01-09 09:29:59,080 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 320 transitions. Word has length 147 [2025-01-09 09:29:59,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:29:59,081 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 320 transitions. [2025-01-09 09:29:59,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:29:59,082 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 320 transitions. [2025-01-09 09:29:59,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 09:29:59,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:29:59,087 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:29:59,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:29:59,087 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:29:59,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:29:59,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1280451341, now seen corresponding path program 1 times [2025-01-09 09:29:59,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:29:59,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25727867] [2025-01-09 09:29:59,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:29:59,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:29:59,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 09:29:59,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 09:29:59,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:29:59,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:30:02,568 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 09:30:02,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:30:02,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25727867] [2025-01-09 09:30:02,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25727867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:30:02,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:30:02,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 09:30:02,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516544365] [2025-01-09 09:30:02,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:30:02,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:30:02,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:30:02,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:30:02,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:30:02,571 INFO L87 Difference]: Start difference. First operand 210 states and 320 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:30:03,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:30:03,755 INFO L93 Difference]: Finished difference Result 566 states and 852 transitions. [2025-01-09 09:30:03,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 09:30:03,756 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2025-01-09 09:30:03,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:30:03,759 INFO L225 Difference]: With dead ends: 566 [2025-01-09 09:30:03,759 INFO L226 Difference]: Without dead ends: 404 [2025-01-09 09:30:03,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:30:03,761 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 404 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:30:03,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 439 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 09:30:03,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-01-09 09:30:03,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 248. [2025-01-09 09:30:03,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 178 states have (on average 1.3820224719101124) internal successors, (246), 178 states have internal predecessors, (246), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 09:30:03,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 378 transitions. [2025-01-09 09:30:03,806 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 378 transitions. Word has length 147 [2025-01-09 09:30:03,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:30:03,806 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 378 transitions. [2025-01-09 09:30:03,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:30:03,807 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 378 transitions. [2025-01-09 09:30:03,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 09:30:03,808 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:30:03,808 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:30:03,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:30:03,809 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:30:03,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:30:03,810 INFO L85 PathProgramCache]: Analyzing trace with hash -494556021, now seen corresponding path program 1 times [2025-01-09 09:30:03,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:30:03,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856120832] [2025-01-09 09:30:03,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:30:03,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:30:03,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 09:30:03,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 09:30:03,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:30:03,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:30:11,233 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 09:30:11,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:30:11,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856120832] [2025-01-09 09:30:11,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856120832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:30:11,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:30:11,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 09:30:11,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212747232] [2025-01-09 09:30:11,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:30:11,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 09:30:11,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:30:11,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 09:30:11,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 09:30:11,236 INFO L87 Difference]: Start difference. First operand 248 states and 378 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:30:13,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:30:13,434 INFO L93 Difference]: Finished difference Result 661 states and 980 transitions. [2025-01-09 09:30:13,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 09:30:13,434 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2025-01-09 09:30:13,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:30:13,437 INFO L225 Difference]: With dead ends: 661 [2025-01-09 09:30:13,437 INFO L226 Difference]: Without dead ends: 466 [2025-01-09 09:30:13,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2025-01-09 09:30:13,440 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 445 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:30:13,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 613 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 09:30:13,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-01-09 09:30:13,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 342. [2025-01-09 09:30:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 272 states have (on average 1.3860294117647058) internal successors, (377), 272 states have internal predecessors, (377), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 09:30:13,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 509 transitions. [2025-01-09 09:30:13,476 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 509 transitions. Word has length 147 [2025-01-09 09:30:13,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:30:13,477 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 509 transitions. [2025-01-09 09:30:13,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:30:13,477 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 509 transitions. [2025-01-09 09:30:13,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 09:30:13,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:30:13,479 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:30:13,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:30:13,480 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:30:13,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:30:13,482 INFO L85 PathProgramCache]: Analyzing trace with hash 185502349, now seen corresponding path program 1 times [2025-01-09 09:30:13,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:30:13,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120988152] [2025-01-09 09:30:13,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:30:13,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:30:13,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 09:30:13,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 09:30:13,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:30:13,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:30:16,882 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 09:30:16,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:30:16,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120988152] [2025-01-09 09:30:16,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120988152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:30:16,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:30:16,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 09:30:16,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266112877] [2025-01-09 09:30:16,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:30:16,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:30:16,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:30:16,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:30:16,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:30:16,884 INFO L87 Difference]: Start difference. First operand 342 states and 509 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:30:17,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:30:17,766 INFO L93 Difference]: Finished difference Result 658 states and 976 transitions. [2025-01-09 09:30:17,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 09:30:17,766 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2025-01-09 09:30:17,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:30:17,769 INFO L225 Difference]: With dead ends: 658 [2025-01-09 09:30:17,769 INFO L226 Difference]: Without dead ends: 478 [2025-01-09 09:30:17,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:30:17,770 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 331 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:30:17,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 440 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 09:30:17,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-01-09 09:30:17,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 362. [2025-01-09 09:30:17,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 292 states have (on average 1.4075342465753424) internal successors, (411), 292 states have internal predecessors, (411), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 09:30:17,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 543 transitions. [2025-01-09 09:30:17,803 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 543 transitions. Word has length 147 [2025-01-09 09:30:17,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:30:17,804 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 543 transitions. [2025-01-09 09:30:17,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:30:17,804 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 543 transitions. [2025-01-09 09:30:17,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 09:30:17,805 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:30:17,806 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:30:17,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:30:17,806 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:30:17,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:30:17,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1764689092, now seen corresponding path program 1 times [2025-01-09 09:30:17,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:30:17,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509319903] [2025-01-09 09:30:17,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:30:17,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:30:17,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 09:30:17,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 09:30:17,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:30:17,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:30:18,894 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 09:30:18,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:30:18,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509319903] [2025-01-09 09:30:18,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509319903] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:30:18,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:30:18,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:30:18,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895423573] [2025-01-09 09:30:18,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:30:18,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:30:18,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:30:18,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:30:18,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:30:18,896 INFO L87 Difference]: Start difference. First operand 362 states and 543 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:30:19,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:30:19,259 INFO L93 Difference]: Finished difference Result 678 states and 1009 transitions. [2025-01-09 09:30:19,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 09:30:19,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2025-01-09 09:30:19,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:30:19,263 INFO L225 Difference]: With dead ends: 678 [2025-01-09 09:30:19,263 INFO L226 Difference]: Without dead ends: 470 [2025-01-09 09:30:19,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 09:30:19,264 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 178 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:30:19,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 429 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:30:19,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-01-09 09:30:19,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 368. [2025-01-09 09:30:19,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 298 states have (on average 1.3926174496644295) internal successors, (415), 298 states have internal predecessors, (415), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 09:30:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 547 transitions. [2025-01-09 09:30:19,290 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 547 transitions. Word has length 147 [2025-01-09 09:30:19,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:30:19,291 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 547 transitions. [2025-01-09 09:30:19,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:30:19,291 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 547 transitions. [2025-01-09 09:30:19,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 09:30:19,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:30:19,293 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:30:19,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:30:19,293 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:30:19,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:30:19,293 INFO L85 PathProgramCache]: Analyzing trace with hash 269334091, now seen corresponding path program 1 times [2025-01-09 09:30:19,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:30:19,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423475389] [2025-01-09 09:30:19,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:30:19,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:30:19,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 09:30:19,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 09:30:19,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:30:19,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:30:19,855 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 09:30:19,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:30:19,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423475389] [2025-01-09 09:30:19,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423475389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:30:19,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:30:19,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 09:30:19,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512559462] [2025-01-09 09:30:19,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:30:19,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 09:30:19,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:30:19,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 09:30:19,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:30:19,857 INFO L87 Difference]: Start difference. First operand 368 states and 547 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:30:20,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:30:20,376 INFO L93 Difference]: Finished difference Result 690 states and 1022 transitions. [2025-01-09 09:30:20,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 09:30:20,376 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2025-01-09 09:30:20,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:30:20,379 INFO L225 Difference]: With dead ends: 690 [2025-01-09 09:30:20,380 INFO L226 Difference]: Without dead ends: 512 [2025-01-09 09:30:20,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-09 09:30:20,382 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 237 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:30:20,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 472 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:30:20,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-01-09 09:30:20,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 370. [2025-01-09 09:30:20,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 300 states have (on average 1.3966666666666667) internal successors, (419), 300 states have internal predecessors, (419), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 09:30:20,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 551 transitions. [2025-01-09 09:30:20,423 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 551 transitions. Word has length 147 [2025-01-09 09:30:20,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:30:20,424 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 551 transitions. [2025-01-09 09:30:20,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:30:20,424 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 551 transitions. [2025-01-09 09:30:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 09:30:20,428 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:30:20,428 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:30:20,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:30:20,428 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:30:20,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:30:20,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1505673271, now seen corresponding path program 1 times [2025-01-09 09:30:20,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:30:20,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786874107] [2025-01-09 09:30:20,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:30:20,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:30:20,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 09:30:20,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 09:30:20,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:30:20,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:30:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 09:30:20,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:30:20,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786874107] [2025-01-09 09:30:20,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786874107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:30:20,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:30:20,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:30:20,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624882016] [2025-01-09 09:30:20,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:30:20,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:30:20,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:30:20,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:30:20,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:30:20,778 INFO L87 Difference]: Start difference. First operand 370 states and 551 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:30:20,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:30:20,996 INFO L93 Difference]: Finished difference Result 612 states and 910 transitions. [2025-01-09 09:30:20,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:30:20,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2025-01-09 09:30:20,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:30:20,999 INFO L225 Difference]: With dead ends: 612 [2025-01-09 09:30:20,999 INFO L226 Difference]: Without dead ends: 368 [2025-01-09 09:30:21,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:30:21,001 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 87 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:30:21,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 302 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:30:21,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-01-09 09:30:21,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 340. [2025-01-09 09:30:21,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 270 states have (on average 1.3518518518518519) internal successors, (365), 270 states have internal predecessors, (365), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 09:30:21,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 497 transitions. [2025-01-09 09:30:21,035 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 497 transitions. Word has length 147 [2025-01-09 09:30:21,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:30:21,035 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 497 transitions. [2025-01-09 09:30:21,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:30:21,036 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 497 transitions. [2025-01-09 09:30:21,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 09:30:21,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:30:21,039 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:30:21,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:30:21,040 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:30:21,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:30:21,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1118086734, now seen corresponding path program 1 times [2025-01-09 09:30:21,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:30:21,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628715137] [2025-01-09 09:30:21,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:30:21,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:30:21,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 09:30:21,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 09:30:21,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:30:21,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:30:23,251 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 09:30:23,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:30:23,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628715137] [2025-01-09 09:30:23,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628715137] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:30:23,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:30:23,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 09:30:23,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689791842] [2025-01-09 09:30:23,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:30:23,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:30:23,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:30:23,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:30:23,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:30:23,253 INFO L87 Difference]: Start difference. First operand 340 states and 497 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:30:24,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:30:24,437 INFO L93 Difference]: Finished difference Result 687 states and 997 transitions. [2025-01-09 09:30:24,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 09:30:24,438 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2025-01-09 09:30:24,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:30:24,441 INFO L225 Difference]: With dead ends: 687 [2025-01-09 09:30:24,441 INFO L226 Difference]: Without dead ends: 525 [2025-01-09 09:30:24,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:30:24,443 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 293 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:30:24,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 551 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:30:24,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-01-09 09:30:24,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 368. [2025-01-09 09:30:24,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 296 states have (on average 1.3344594594594594) internal successors, (395), 296 states have internal predecessors, (395), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 09:30:24,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 527 transitions. [2025-01-09 09:30:24,477 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 527 transitions. Word has length 148 [2025-01-09 09:30:24,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:30:24,478 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 527 transitions. [2025-01-09 09:30:24,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:30:24,478 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 527 transitions. [2025-01-09 09:30:24,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 09:30:24,480 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:30:24,480 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:30:24,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 09:30:24,481 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:30:24,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:30:24,481 INFO L85 PathProgramCache]: Analyzing trace with hash 282994882, now seen corresponding path program 1 times [2025-01-09 09:30:24,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:30:24,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063687247] [2025-01-09 09:30:24,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:30:24,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:30:24,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 09:30:24,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 09:30:24,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:30:24,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:30:28,176 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 09:30:28,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:30:28,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063687247] [2025-01-09 09:30:28,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063687247] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:30:28,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:30:28,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 09:30:28,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805004068] [2025-01-09 09:30:28,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:30:28,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 09:30:28,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:30:28,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 09:30:28,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:30:28,178 INFO L87 Difference]: Start difference. First operand 368 states and 527 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:30:29,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:30:29,981 INFO L93 Difference]: Finished difference Result 796 states and 1127 transitions. [2025-01-09 09:30:29,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 09:30:29,982 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2025-01-09 09:30:29,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:30:29,985 INFO L225 Difference]: With dead ends: 796 [2025-01-09 09:30:29,985 INFO L226 Difference]: Without dead ends: 521 [2025-01-09 09:30:29,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2025-01-09 09:30:29,988 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 431 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:30:29,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 633 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 09:30:29,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-01-09 09:30:30,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 409. [2025-01-09 09:30:30,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 337 states have (on average 1.3471810089020773) internal successors, (454), 337 states have internal predecessors, (454), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 09:30:30,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 586 transitions. [2025-01-09 09:30:30,041 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 586 transitions. Word has length 148 [2025-01-09 09:30:30,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:30:30,041 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 586 transitions. [2025-01-09 09:30:30,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:30:30,042 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 586 transitions. [2025-01-09 09:30:30,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 09:30:30,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:30:30,044 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:30:30,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 09:30:30,044 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:30:30,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:30:30,045 INFO L85 PathProgramCache]: Analyzing trace with hash 963053252, now seen corresponding path program 1 times [2025-01-09 09:30:30,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:30:30,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075394119] [2025-01-09 09:30:30,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:30:30,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:30:30,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 09:30:30,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 09:30:30,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:30:30,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:30:34,691 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 09:30:34,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:30:34,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075394119] [2025-01-09 09:30:34,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075394119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:30:34,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:30:34,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 09:30:34,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884479896] [2025-01-09 09:30:34,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:30:34,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 09:30:34,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:30:34,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 09:30:34,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:30:34,693 INFO L87 Difference]: Start difference. First operand 409 states and 586 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:30:36,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:30:36,615 INFO L93 Difference]: Finished difference Result 697 states and 984 transitions. [2025-01-09 09:30:36,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 09:30:36,615 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2025-01-09 09:30:36,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:30:36,618 INFO L225 Difference]: With dead ends: 697 [2025-01-09 09:30:36,618 INFO L226 Difference]: Without dead ends: 515 [2025-01-09 09:30:36,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 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 09:30:36,620 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 231 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:30:36,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 814 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 09:30:36,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-01-09 09:30:36,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 401. [2025-01-09 09:30:36,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 329 states have (on average 1.337386018237082) internal successors, (440), 329 states have internal predecessors, (440), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 09:30:36,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 572 transitions. [2025-01-09 09:30:36,660 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 572 transitions. Word has length 148 [2025-01-09 09:30:36,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:30:36,660 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 572 transitions. [2025-01-09 09:30:36,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:30:36,660 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 572 transitions. [2025-01-09 09:30:36,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 09:30:36,662 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:30:36,662 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:30:36,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 09:30:36,662 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:30:36,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:30:36,663 INFO L85 PathProgramCache]: Analyzing trace with hash 390638678, now seen corresponding path program 1 times [2025-01-09 09:30:36,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:30:36,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115920160] [2025-01-09 09:30:36,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:30:36,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:30:36,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 09:30:36,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 09:30:36,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:30:36,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:30:39,075 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 09:30:39,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:30:39,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115920160] [2025-01-09 09:30:39,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115920160] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:30:39,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:30:39,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 09:30:39,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602547595] [2025-01-09 09:30:39,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:30:39,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 09:30:39,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:30:39,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 09:30:39,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 09:30:39,078 INFO L87 Difference]: Start difference. First operand 401 states and 572 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:30:40,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:30:40,702 INFO L93 Difference]: Finished difference Result 804 states and 1147 transitions. [2025-01-09 09:30:40,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 09:30:40,703 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2025-01-09 09:30:40,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:30:40,707 INFO L225 Difference]: With dead ends: 804 [2025-01-09 09:30:40,707 INFO L226 Difference]: Without dead ends: 626 [2025-01-09 09:30:40,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2025-01-09 09:30:40,708 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 355 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:30:40,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 393 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 09:30:40,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-01-09 09:30:40,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 399. [2025-01-09 09:30:40,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 327 states have (on average 1.3394495412844036) internal successors, (438), 327 states have internal predecessors, (438), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 09:30:40,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 570 transitions. [2025-01-09 09:30:40,744 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 570 transitions. Word has length 149 [2025-01-09 09:30:40,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:30:40,745 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 570 transitions. [2025-01-09 09:30:40,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:30:40,745 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 570 transitions. [2025-01-09 09:30:40,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 09:30:40,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:30:40,746 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:30:40,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 09:30:40,746 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:30:40,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:30:40,747 INFO L85 PathProgramCache]: Analyzing trace with hash -834196214, now seen corresponding path program 1 times [2025-01-09 09:30:40,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:30:40,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231950848] [2025-01-09 09:30:40,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:30:40,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:30:40,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 09:30:40,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 09:30:40,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:30:40,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:30:46,092 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 09:30:46,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:30:46,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231950848] [2025-01-09 09:30:46,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231950848] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:30:46,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:30:46,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 09:30:46,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112674653] [2025-01-09 09:30:46,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:30:46,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 09:30:46,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:30:46,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 09:30:46,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:30:46,094 INFO L87 Difference]: Start difference. First operand 399 states and 570 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:30:49,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:30:49,186 INFO L93 Difference]: Finished difference Result 667 states and 950 transitions. [2025-01-09 09:30:49,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 09:30:49,187 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2025-01-09 09:30:49,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:30:49,190 INFO L225 Difference]: With dead ends: 667 [2025-01-09 09:30:49,190 INFO L226 Difference]: Without dead ends: 483 [2025-01-09 09:30:49,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2025-01-09 09:30:49,191 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 408 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:30:49,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 737 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 09:30:49,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-01-09 09:30:49,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 415. [2025-01-09 09:30:49,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 343 states have (on average 1.3411078717201166) internal successors, (460), 343 states have internal predecessors, (460), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 09:30:49,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 592 transitions. [2025-01-09 09:30:49,229 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 592 transitions. Word has length 149 [2025-01-09 09:30:49,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:30:49,230 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 592 transitions. [2025-01-09 09:30:49,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:30:49,230 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 592 transitions. [2025-01-09 09:30:49,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 09:30:49,231 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:30:49,231 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:30:49,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 09:30:49,231 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:30:49,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:30:49,232 INFO L85 PathProgramCache]: Analyzing trace with hash -154137844, now seen corresponding path program 1 times [2025-01-09 09:30:49,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:30:49,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498417113] [2025-01-09 09:30:49,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:30:49,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:30:49,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 09:30:49,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 09:30:49,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:30:49,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:30:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 09:30:54,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:30:54,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498417113] [2025-01-09 09:30:54,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498417113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:30:54,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:30:54,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 09:30:54,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963431835] [2025-01-09 09:30:54,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:30:54,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 09:30:54,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:30:54,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 09:30:54,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:30:54,534 INFO L87 Difference]: Start difference. First operand 415 states and 592 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:30:56,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:30:56,126 INFO L93 Difference]: Finished difference Result 687 states and 974 transitions. [2025-01-09 09:30:56,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 09:30:56,126 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2025-01-09 09:30:56,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:30:56,129 INFO L225 Difference]: With dead ends: 687 [2025-01-09 09:30:56,129 INFO L226 Difference]: Without dead ends: 509 [2025-01-09 09:30:56,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2025-01-09 09:30:56,130 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 302 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:30:56,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 770 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 09:30:56,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-01-09 09:30:56,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 411. [2025-01-09 09:30:56,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 339 states have (on average 1.3392330383480826) internal successors, (454), 339 states have internal predecessors, (454), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 09:30:56,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 586 transitions. [2025-01-09 09:30:56,167 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 586 transitions. Word has length 149 [2025-01-09 09:30:56,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:30:56,168 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 586 transitions. [2025-01-09 09:30:56,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 09:30:56,168 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 586 transitions. [2025-01-09 09:30:56,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 09:30:56,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:30:56,171 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:30:56,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 09:30:56,171 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:30:56,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:30:56,171 INFO L85 PathProgramCache]: Analyzing trace with hash -596260888, now seen corresponding path program 1 times [2025-01-09 09:30:56,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:30:56,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833751112] [2025-01-09 09:30:56,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:30:56,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:30:56,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 09:30:56,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 09:30:56,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:30:56,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat