./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vMiim_p2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vMiim_p2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash c3533435b3574844c676ebf9ef5728195d9e5ba69ebd57baed9e55717a70044d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:19:07,368 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:19:07,448 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 08:19:07,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:19:07,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:19:07,478 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:19:07,479 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:19:07,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:19:07,480 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:19:07,480 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:19:07,481 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:19:07,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:19:07,481 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:19:07,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:19:07,481 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:19:07,482 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:19:07,482 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:19:07,482 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:19:07,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:19:07,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:19:07,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:19:07,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:19:07,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:19:07,482 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:19:07,483 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:19:07,483 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:19:07,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:19:07,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:19:07,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:19:07,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:19:07,483 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:19:07,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:19:07,484 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:19:07,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:19:07,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:19:07,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:19:07,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:19:07,484 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:19:07,484 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:19:07,484 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:19:07,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:19:07,484 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:19:07,484 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:19:07,485 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:19:07,485 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:19:07,485 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c3533435b3574844c676ebf9ef5728195d9e5ba69ebd57baed9e55717a70044d [2025-01-09 08:19:07,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:19:07,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:19:07,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:19:07,781 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:19:07,781 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:19:07,782 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vMiim_p2.c [2025-01-09 08:19:08,992 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e1d2176dc/a85b2b1a206c4e4fa1927c85f780d0a7/FLAG18002756a [2025-01-09 08:19:09,283 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:19:09,284 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vMiim_p2.c [2025-01-09 08:19:09,297 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e1d2176dc/a85b2b1a206c4e4fa1927c85f780d0a7/FLAG18002756a [2025-01-09 08:19:09,319 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e1d2176dc/a85b2b1a206c4e4fa1927c85f780d0a7 [2025-01-09 08:19:09,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:19:09,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:19:09,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:19:09,324 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:19:09,327 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:19:09,328 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:19:09" (1/1) ... [2025-01-09 08:19:09,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36758f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:09, skipping insertion in model container [2025-01-09 08:19:09,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:19:09" (1/1) ... [2025-01-09 08:19:09,357 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:19:09,476 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vMiim_p2.c[1258,1271] [2025-01-09 08:19:09,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:19:09,607 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:19:09,613 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vMiim_p2.c[1258,1271] [2025-01-09 08:19:09,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:19:09,703 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:19:09,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:09 WrapperNode [2025-01-09 08:19:09,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:19:09,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:19:09,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:19:09,705 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:19:09,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:09" (1/1) ... [2025-01-09 08:19:09,740 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:09" (1/1) ... [2025-01-09 08:19:09,869 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1475 [2025-01-09 08:19:09,869 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:19:09,870 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:19:09,870 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:19:09,870 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:19:09,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:09" (1/1) ... [2025-01-09 08:19:09,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:09" (1/1) ... [2025-01-09 08:19:09,901 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:09" (1/1) ... [2025-01-09 08:19:09,960 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 08:19:09,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:09" (1/1) ... [2025-01-09 08:19:09,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:09" (1/1) ... [2025-01-09 08:19:10,039 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:09" (1/1) ... [2025-01-09 08:19:10,046 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:09" (1/1) ... [2025-01-09 08:19:10,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:09" (1/1) ... [2025-01-09 08:19:10,072 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:09" (1/1) ... [2025-01-09 08:19:10,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:09" (1/1) ... [2025-01-09 08:19:10,096 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:19:10,097 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:19:10,098 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:19:10,098 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:19:10,099 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:09" (1/1) ... [2025-01-09 08:19:10,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:19:10,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:19:10,122 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 08:19:10,136 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 08:19:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:19:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:19:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:19:10,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:19:10,350 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:19:10,351 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:19:11,545 INFO L? ?]: Removed 723 outVars from TransFormulas that were not future-live. [2025-01-09 08:19:11,546 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:19:11,560 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:19:11,561 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:19:11,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:19:11 BoogieIcfgContainer [2025-01-09 08:19:11,561 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:19:11,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:19:11,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:19:11,567 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:19:11,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:19:09" (1/3) ... [2025-01-09 08:19:11,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c45982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:19:11, skipping insertion in model container [2025-01-09 08:19:11,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:09" (2/3) ... [2025-01-09 08:19:11,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c45982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:19:11, skipping insertion in model container [2025-01-09 08:19:11,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:19:11" (3/3) ... [2025-01-09 08:19:11,569 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_vMiim_p2.c [2025-01-09 08:19:11,579 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:19:11,581 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_QF_BV_vMiim_p2.c that has 1 procedures, 346 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:19:11,621 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:19:11,629 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;@5a4c966f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:19:11,629 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:19:11,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 346 states, 344 states have (on average 1.497093023255814) internal successors, (515), 345 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:11,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 08:19:11,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:11,639 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:11,640 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:11,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:11,643 INFO L85 PathProgramCache]: Analyzing trace with hash -288881028, now seen corresponding path program 1 times [2025-01-09 08:19:11,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:11,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546664837] [2025-01-09 08:19:11,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:11,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:11,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 08:19:11,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 08:19:11,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:11,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:12,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:12,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:12,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546664837] [2025-01-09 08:19:12,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546664837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:12,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:12,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:19:12,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814790579] [2025-01-09 08:19:12,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:12,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:19:12,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:12,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:19:12,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:19:12,320 INFO L87 Difference]: Start difference. First operand has 346 states, 344 states have (on average 1.497093023255814) internal successors, (515), 345 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:12,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:12,392 INFO L93 Difference]: Finished difference Result 565 states and 843 transitions. [2025-01-09 08:19:12,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:19:12,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-01-09 08:19:12,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:12,413 INFO L225 Difference]: With dead ends: 565 [2025-01-09 08:19:12,413 INFO L226 Difference]: Without dead ends: 345 [2025-01-09 08:19:12,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:19:12,418 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 0 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:12,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1521 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:12,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-01-09 08:19:12,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-01-09 08:19:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 344 states have (on average 1.4912790697674418) internal successors, (513), 344 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:12,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 513 transitions. [2025-01-09 08:19:12,454 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 513 transitions. Word has length 85 [2025-01-09 08:19:12,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:12,454 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 513 transitions. [2025-01-09 08:19:12,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:12,455 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 513 transitions. [2025-01-09 08:19:12,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 08:19:12,456 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:12,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:12,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 08:19:12,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:12,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:12,458 INFO L85 PathProgramCache]: Analyzing trace with hash -363681603, now seen corresponding path program 1 times [2025-01-09 08:19:12,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:12,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233302061] [2025-01-09 08:19:12,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:12,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:12,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 08:19:12,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 08:19:12,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:12,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:12,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:12,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:12,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233302061] [2025-01-09 08:19:12,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233302061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:12,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:12,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:19:12,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102696727] [2025-01-09 08:19:12,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:12,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:19:12,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:12,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:19:12,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:19:12,742 INFO L87 Difference]: Start difference. First operand 345 states and 513 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:12,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:12,774 INFO L93 Difference]: Finished difference Result 566 states and 841 transitions. [2025-01-09 08:19:12,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:19:12,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-01-09 08:19:12,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:12,776 INFO L225 Difference]: With dead ends: 566 [2025-01-09 08:19:12,776 INFO L226 Difference]: Without dead ends: 347 [2025-01-09 08:19:12,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:19:12,778 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 0 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:12,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1517 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:12,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-01-09 08:19:12,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2025-01-09 08:19:12,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.4884393063583814) internal successors, (515), 346 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:12,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 515 transitions. [2025-01-09 08:19:12,791 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 515 transitions. Word has length 86 [2025-01-09 08:19:12,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:12,791 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 515 transitions. [2025-01-09 08:19:12,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:12,791 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 515 transitions. [2025-01-09 08:19:12,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 08:19:12,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:12,797 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:12,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:19:12,797 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:12,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:12,797 INFO L85 PathProgramCache]: Analyzing trace with hash 512806773, now seen corresponding path program 1 times [2025-01-09 08:19:12,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:12,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23050828] [2025-01-09 08:19:12,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:12,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:12,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 08:19:12,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 08:19:12,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:12,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:13,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:13,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:13,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23050828] [2025-01-09 08:19:13,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23050828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:13,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:13,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:19:13,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011541435] [2025-01-09 08:19:13,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:13,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:19:13,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:13,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:19:13,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:19:13,368 INFO L87 Difference]: Start difference. First operand 347 states and 515 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:13,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:13,523 INFO L93 Difference]: Finished difference Result 599 states and 889 transitions. [2025-01-09 08:19:13,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:19:13,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-01-09 08:19:13,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:13,526 INFO L225 Difference]: With dead ends: 599 [2025-01-09 08:19:13,526 INFO L226 Difference]: Without dead ends: 378 [2025-01-09 08:19:13,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:19:13,528 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 518 mSDsluCounter, 1964 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 2457 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:13,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 2457 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:19:13,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-01-09 08:19:13,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2025-01-09 08:19:13,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 1.4840425531914894) internal successors, (558), 376 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 558 transitions. [2025-01-09 08:19:13,538 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 558 transitions. Word has length 87 [2025-01-09 08:19:13,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:13,539 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 558 transitions. [2025-01-09 08:19:13,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:13,539 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 558 transitions. [2025-01-09 08:19:13,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 08:19:13,541 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:13,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:13,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:19:13,541 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:13,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:13,542 INFO L85 PathProgramCache]: Analyzing trace with hash 281686400, now seen corresponding path program 1 times [2025-01-09 08:19:13,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:13,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359385822] [2025-01-09 08:19:13,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:13,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:13,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 08:19:13,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 08:19:13,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:13,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:14,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:14,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:14,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359385822] [2025-01-09 08:19:14,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359385822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:14,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:14,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:19:14,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132363783] [2025-01-09 08:19:14,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:14,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:19:14,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:14,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:19:14,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:19:14,107 INFO L87 Difference]: Start difference. First operand 377 states and 558 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:14,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:14,240 INFO L93 Difference]: Finished difference Result 607 states and 896 transitions. [2025-01-09 08:19:14,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:19:14,241 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-01-09 08:19:14,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:14,242 INFO L225 Difference]: With dead ends: 607 [2025-01-09 08:19:14,242 INFO L226 Difference]: Without dead ends: 379 [2025-01-09 08:19:14,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:19:14,243 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 512 mSDsluCounter, 1974 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 2469 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:14,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 2469 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:19:14,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-01-09 08:19:14,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 378. [2025-01-09 08:19:14,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 1.4801061007957559) internal successors, (558), 377 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:14,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 558 transitions. [2025-01-09 08:19:14,262 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 558 transitions. Word has length 88 [2025-01-09 08:19:14,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:14,262 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 558 transitions. [2025-01-09 08:19:14,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:14,263 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 558 transitions. [2025-01-09 08:19:14,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 08:19:14,264 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:14,264 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:14,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 08:19:14,268 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:14,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:14,269 INFO L85 PathProgramCache]: Analyzing trace with hash -373971900, now seen corresponding path program 1 times [2025-01-09 08:19:14,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:14,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804613675] [2025-01-09 08:19:14,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:14,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:14,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 08:19:14,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 08:19:14,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:14,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:14,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:14,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:14,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804613675] [2025-01-09 08:19:14,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804613675] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:14,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:14,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 08:19:14,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901922059] [2025-01-09 08:19:14,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:14,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 08:19:14,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:14,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 08:19:14,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:19:14,832 INFO L87 Difference]: Start difference. First operand 378 states and 558 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:15,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:15,003 INFO L93 Difference]: Finished difference Result 723 states and 1066 transitions. [2025-01-09 08:19:15,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 08:19:15,003 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-01-09 08:19:15,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:15,005 INFO L225 Difference]: With dead ends: 723 [2025-01-09 08:19:15,005 INFO L226 Difference]: Without dead ends: 502 [2025-01-09 08:19:15,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-01-09 08:19:15,006 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 870 mSDsluCounter, 2950 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 3443 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:15,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 3443 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:19:15,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-01-09 08:19:15,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 381. [2025-01-09 08:19:15,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 1.4763157894736842) internal successors, (561), 380 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:15,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 561 transitions. [2025-01-09 08:19:15,013 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 561 transitions. Word has length 88 [2025-01-09 08:19:15,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:15,013 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 561 transitions. [2025-01-09 08:19:15,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:15,013 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 561 transitions. [2025-01-09 08:19:15,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 08:19:15,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:15,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:15,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 08:19:15,015 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:15,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:15,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1233342294, now seen corresponding path program 1 times [2025-01-09 08:19:15,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:15,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79880509] [2025-01-09 08:19:15,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:15,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:15,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 08:19:15,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 08:19:15,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:15,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:15,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:15,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:15,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79880509] [2025-01-09 08:19:15,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79880509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:15,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:15,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:19:15,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558224277] [2025-01-09 08:19:15,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:15,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:19:15,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:15,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:19:15,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:19:15,224 INFO L87 Difference]: Start difference. First operand 381 states and 561 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:15,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:15,376 INFO L93 Difference]: Finished difference Result 807 states and 1186 transitions. [2025-01-09 08:19:15,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:19:15,376 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-01-09 08:19:15,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:15,378 INFO L225 Difference]: With dead ends: 807 [2025-01-09 08:19:15,378 INFO L226 Difference]: Without dead ends: 571 [2025-01-09 08:19:15,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:19:15,379 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 1066 mSDsluCounter, 1968 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 2461 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:15,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 2461 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:19:15,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-01-09 08:19:15,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 382. [2025-01-09 08:19:15,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 1.4724409448818898) internal successors, (561), 381 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:15,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 561 transitions. [2025-01-09 08:19:15,393 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 561 transitions. Word has length 89 [2025-01-09 08:19:15,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:15,393 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 561 transitions. [2025-01-09 08:19:15,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:15,394 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 561 transitions. [2025-01-09 08:19:15,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 08:19:15,394 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:15,395 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:15,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 08:19:15,396 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:15,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:15,396 INFO L85 PathProgramCache]: Analyzing trace with hash -705267193, now seen corresponding path program 1 times [2025-01-09 08:19:15,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:15,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071890665] [2025-01-09 08:19:15,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:15,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:15,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 08:19:15,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 08:19:15,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:15,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:15,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:15,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:15,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071890665] [2025-01-09 08:19:15,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071890665] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:15,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:15,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:19:15,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035567704] [2025-01-09 08:19:15,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:15,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:19:15,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:15,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:19:15,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:19:15,681 INFO L87 Difference]: Start difference. First operand 382 states and 561 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:15,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:15,784 INFO L93 Difference]: Finished difference Result 657 states and 958 transitions. [2025-01-09 08:19:15,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:19:15,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 08:19:15,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:15,786 INFO L225 Difference]: With dead ends: 657 [2025-01-09 08:19:15,786 INFO L226 Difference]: Without dead ends: 416 [2025-01-09 08:19:15,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:19:15,787 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 596 mSDsluCounter, 1980 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 2476 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:15,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 2476 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:19:15,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-01-09 08:19:15,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 383. [2025-01-09 08:19:15,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.468586387434555) internal successors, (561), 382 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 561 transitions. [2025-01-09 08:19:15,800 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 561 transitions. Word has length 90 [2025-01-09 08:19:15,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:15,801 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 561 transitions. [2025-01-09 08:19:15,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:15,801 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 561 transitions. [2025-01-09 08:19:15,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 08:19:15,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:15,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:15,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 08:19:15,801 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:15,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:15,802 INFO L85 PathProgramCache]: Analyzing trace with hash 108715939, now seen corresponding path program 1 times [2025-01-09 08:19:15,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:15,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708135569] [2025-01-09 08:19:15,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:15,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:15,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 08:19:15,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 08:19:15,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:15,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:16,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:16,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:16,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708135569] [2025-01-09 08:19:16,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708135569] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:16,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:16,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:19:16,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589879346] [2025-01-09 08:19:16,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:16,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:19:16,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:16,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:19:16,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:19:16,077 INFO L87 Difference]: Start difference. First operand 383 states and 561 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:16,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:16,183 INFO L93 Difference]: Finished difference Result 687 states and 1000 transitions. [2025-01-09 08:19:16,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:19:16,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-01-09 08:19:16,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:16,185 INFO L225 Difference]: With dead ends: 687 [2025-01-09 08:19:16,185 INFO L226 Difference]: Without dead ends: 441 [2025-01-09 08:19:16,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:19:16,186 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 666 mSDsluCounter, 1976 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 2471 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:16,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 2471 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:19:16,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-01-09 08:19:16,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 384. [2025-01-09 08:19:16,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 1.4647519582245432) internal successors, (561), 383 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:16,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 561 transitions. [2025-01-09 08:19:16,198 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 561 transitions. Word has length 91 [2025-01-09 08:19:16,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:16,199 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 561 transitions. [2025-01-09 08:19:16,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:16,203 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 561 transitions. [2025-01-09 08:19:16,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 08:19:16,203 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:16,203 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:16,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 08:19:16,204 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:16,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:16,204 INFO L85 PathProgramCache]: Analyzing trace with hash 354664334, now seen corresponding path program 1 times [2025-01-09 08:19:16,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:16,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765800444] [2025-01-09 08:19:16,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:16,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:16,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 08:19:16,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 08:19:16,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:16,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:16,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:16,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:16,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765800444] [2025-01-09 08:19:16,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765800444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:16,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:16,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:19:16,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695464910] [2025-01-09 08:19:16,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:16,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:19:16,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:16,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:19:16,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:19:16,435 INFO L87 Difference]: Start difference. First operand 384 states and 561 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:16,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:16,553 INFO L93 Difference]: Finished difference Result 829 states and 1210 transitions. [2025-01-09 08:19:16,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:19:16,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-01-09 08:19:16,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:16,555 INFO L225 Difference]: With dead ends: 829 [2025-01-09 08:19:16,555 INFO L226 Difference]: Without dead ends: 578 [2025-01-09 08:19:16,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:19:16,556 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 1072 mSDsluCounter, 1980 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 2476 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:16,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 2476 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:19:16,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-01-09 08:19:16,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 385. [2025-01-09 08:19:16,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.4609375) internal successors, (561), 384 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:16,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 561 transitions. [2025-01-09 08:19:16,566 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 561 transitions. Word has length 92 [2025-01-09 08:19:16,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:16,566 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 561 transitions. [2025-01-09 08:19:16,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:16,566 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 561 transitions. [2025-01-09 08:19:16,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 08:19:16,567 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:16,567 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:16,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 08:19:16,568 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:16,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:16,568 INFO L85 PathProgramCache]: Analyzing trace with hash -346539620, now seen corresponding path program 1 times [2025-01-09 08:19:16,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:16,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455725775] [2025-01-09 08:19:16,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:16,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:16,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 08:19:16,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 08:19:16,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:16,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:16,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:16,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:16,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455725775] [2025-01-09 08:19:16,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455725775] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:16,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:16,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:19:16,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148637705] [2025-01-09 08:19:16,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:16,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:19:16,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:16,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:19:16,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:19:16,720 INFO L87 Difference]: Start difference. First operand 385 states and 561 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:16,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:16,785 INFO L93 Difference]: Finished difference Result 798 states and 1168 transitions. [2025-01-09 08:19:16,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:19:16,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-01-09 08:19:16,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:16,787 INFO L225 Difference]: With dead ends: 798 [2025-01-09 08:19:16,787 INFO L226 Difference]: Without dead ends: 547 [2025-01-09 08:19:16,787 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 08:19:16,788 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 1025 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:16,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 1497 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:16,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-01-09 08:19:16,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 366. [2025-01-09 08:19:16,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 1.4684931506849315) internal successors, (536), 365 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:16,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 536 transitions. [2025-01-09 08:19:16,795 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 536 transitions. Word has length 93 [2025-01-09 08:19:16,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:16,795 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 536 transitions. [2025-01-09 08:19:16,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:16,795 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 536 transitions. [2025-01-09 08:19:16,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 08:19:16,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:16,797 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:16,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 08:19:16,797 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:16,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:16,797 INFO L85 PathProgramCache]: Analyzing trace with hash 920549707, now seen corresponding path program 1 times [2025-01-09 08:19:16,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:16,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522702549] [2025-01-09 08:19:16,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:16,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:16,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 08:19:16,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 08:19:16,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:16,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:17,317 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:17,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:17,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522702549] [2025-01-09 08:19:17,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522702549] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:19:17,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819496769] [2025-01-09 08:19:17,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:17,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:19:17,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:19:17,320 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:19:17,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 08:19:17,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 08:19:17,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 08:19:17,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:17,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:17,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 1425 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 08:19:17,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:19:18,310 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:18,312 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:19:18,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819496769] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:18,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:19:18,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-01-09 08:19:18,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310725741] [2025-01-09 08:19:18,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:18,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:19:18,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:18,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:19:18,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:19:18,315 INFO L87 Difference]: Start difference. First operand 366 states and 536 transitions. Second operand has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:18,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:18,698 INFO L93 Difference]: Finished difference Result 586 states and 862 transitions. [2025-01-09 08:19:18,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:19:18,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 197 [2025-01-09 08:19:18,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:18,700 INFO L225 Difference]: With dead ends: 586 [2025-01-09 08:19:18,700 INFO L226 Difference]: Without dead ends: 365 [2025-01-09 08:19:18,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:19:18,701 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 388 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:18,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 601 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 08:19:18,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-01-09 08:19:18,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2025-01-09 08:19:18,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.4642857142857142) internal successors, (533), 364 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:18,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 533 transitions. [2025-01-09 08:19:18,708 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 533 transitions. Word has length 197 [2025-01-09 08:19:18,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:18,709 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 533 transitions. [2025-01-09 08:19:18,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:18,709 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 533 transitions. [2025-01-09 08:19:18,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 08:19:18,711 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:18,711 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:18,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 08:19:18,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 08:19:18,915 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:18,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:18,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1323076601, now seen corresponding path program 1 times [2025-01-09 08:19:18,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:18,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189752077] [2025-01-09 08:19:18,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:18,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:18,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 08:19:19,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 08:19:19,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:19,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:19,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:19,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189752077] [2025-01-09 08:19:19,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189752077] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:19,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:19,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:19:19,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609309267] [2025-01-09 08:19:19,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:19,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:19:19,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:19,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:19:19,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:19:19,688 INFO L87 Difference]: Start difference. First operand 365 states and 533 transitions. Second operand has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:19,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:19,982 INFO L93 Difference]: Finished difference Result 705 states and 1032 transitions. [2025-01-09 08:19:19,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:19:19,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2025-01-09 08:19:19,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:19,984 INFO L225 Difference]: With dead ends: 705 [2025-01-09 08:19:19,985 INFO L226 Difference]: Without dead ends: 477 [2025-01-09 08:19:19,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:19:19,985 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 787 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:19,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 1774 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 08:19:19,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-01-09 08:19:19,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 431. [2025-01-09 08:19:19,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 430 states have (on average 1.4627906976744185) internal successors, (629), 430 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:19,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 629 transitions. [2025-01-09 08:19:19,993 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 629 transitions. Word has length 198 [2025-01-09 08:19:19,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:19,993 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 629 transitions. [2025-01-09 08:19:19,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:19,993 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 629 transitions. [2025-01-09 08:19:19,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 08:19:19,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:19,995 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:19,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 08:19:19,995 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:19,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:19,996 INFO L85 PathProgramCache]: Analyzing trace with hash 973882016, now seen corresponding path program 1 times [2025-01-09 08:19:19,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:19,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284210177] [2025-01-09 08:19:19,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:19,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:20,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 08:19:20,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 08:19:20,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:20,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:20,804 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:20,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:20,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284210177] [2025-01-09 08:19:20,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284210177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:20,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:20,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:19:20,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417305960] [2025-01-09 08:19:20,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:20,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:19:20,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:20,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:19:20,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:19:20,805 INFO L87 Difference]: Start difference. First operand 431 states and 629 transitions. Second operand has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:21,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:21,229 INFO L93 Difference]: Finished difference Result 697 states and 1020 transitions. [2025-01-09 08:19:21,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:19:21,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2025-01-09 08:19:21,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:21,231 INFO L225 Difference]: With dead ends: 697 [2025-01-09 08:19:21,231 INFO L226 Difference]: Without dead ends: 477 [2025-01-09 08:19:21,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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 08:19:21,232 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 760 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:21,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 885 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 08:19:21,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-01-09 08:19:21,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 432. [2025-01-09 08:19:21,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 431 states have (on average 1.4617169373549883) internal successors, (630), 431 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:21,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 630 transitions. [2025-01-09 08:19:21,242 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 630 transitions. Word has length 199 [2025-01-09 08:19:21,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:21,242 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 630 transitions. [2025-01-09 08:19:21,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:21,242 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 630 transitions. [2025-01-09 08:19:21,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-01-09 08:19:21,243 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:21,244 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:21,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 08:19:21,244 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:21,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:21,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1515292036, now seen corresponding path program 1 times [2025-01-09 08:19:21,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:21,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908233316] [2025-01-09 08:19:21,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:21,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:21,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-09 08:19:21,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-09 08:19:21,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:21,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:21,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:21,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908233316] [2025-01-09 08:19:21,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908233316] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:21,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:21,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:19:21,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812555977] [2025-01-09 08:19:21,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:21,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:19:21,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:21,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:19:21,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:19:21,979 INFO L87 Difference]: Start difference. First operand 432 states and 630 transitions. Second operand has 6 states, 6 states have (on average 33.333333333333336) internal successors, (200), 6 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:22,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:22,328 INFO L93 Difference]: Finished difference Result 835 states and 1216 transitions. [2025-01-09 08:19:22,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:19:22,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 33.333333333333336) internal successors, (200), 6 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2025-01-09 08:19:22,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:22,331 INFO L225 Difference]: With dead ends: 835 [2025-01-09 08:19:22,331 INFO L226 Difference]: Without dead ends: 615 [2025-01-09 08:19:22,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:19:22,332 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 1110 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:22,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 1477 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 08:19:22,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-01-09 08:19:22,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 542. [2025-01-09 08:19:22,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 1.4639556377079483) internal successors, (792), 541 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:22,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 792 transitions. [2025-01-09 08:19:22,342 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 792 transitions. Word has length 200 [2025-01-09 08:19:22,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:22,342 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 792 transitions. [2025-01-09 08:19:22,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.333333333333336) internal successors, (200), 6 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:22,343 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 792 transitions. [2025-01-09 08:19:22,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-01-09 08:19:22,344 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:22,344 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:22,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 08:19:22,345 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:22,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:22,345 INFO L85 PathProgramCache]: Analyzing trace with hash -601620675, now seen corresponding path program 1 times [2025-01-09 08:19:22,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:22,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772119865] [2025-01-09 08:19:22,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:22,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:22,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-09 08:19:22,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-09 08:19:22,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:22,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:23,098 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:23,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:23,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772119865] [2025-01-09 08:19:23,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772119865] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:23,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:23,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:19:23,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264696437] [2025-01-09 08:19:23,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:23,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:19:23,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:23,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:19:23,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:19:23,101 INFO L87 Difference]: Start difference. First operand 542 states and 792 transitions. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:23,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:23,540 INFO L93 Difference]: Finished difference Result 764 states and 1119 transitions. [2025-01-09 08:19:23,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:19:23,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 201 [2025-01-09 08:19:23,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:23,542 INFO L225 Difference]: With dead ends: 764 [2025-01-09 08:19:23,542 INFO L226 Difference]: Without dead ends: 544 [2025-01-09 08:19:23,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:19:23,543 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 896 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:23,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 878 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 08:19:23,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-01-09 08:19:23,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 543. [2025-01-09 08:19:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 542 states have (on average 1.46309963099631) internal successors, (793), 542 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:23,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 793 transitions. [2025-01-09 08:19:23,554 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 793 transitions. Word has length 201 [2025-01-09 08:19:23,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:23,555 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 793 transitions. [2025-01-09 08:19:23,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:23,555 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 793 transitions. [2025-01-09 08:19:23,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 08:19:23,557 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:23,557 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:23,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 08:19:23,557 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:23,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:23,558 INFO L85 PathProgramCache]: Analyzing trace with hash 556901287, now seen corresponding path program 1 times [2025-01-09 08:19:23,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:23,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470870091] [2025-01-09 08:19:23,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:23,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:23,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 08:19:24,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 08:19:24,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:24,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:25,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:25,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470870091] [2025-01-09 08:19:25,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470870091] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:25,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:25,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:19:25,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060086721] [2025-01-09 08:19:25,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:25,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:19:25,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:25,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:19:25,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:19:25,071 INFO L87 Difference]: Start difference. First operand 543 states and 793 transitions. Second operand has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:25,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:25,120 INFO L93 Difference]: Finished difference Result 854 states and 1252 transitions. [2025-01-09 08:19:25,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:19:25,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 202 [2025-01-09 08:19:25,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:25,123 INFO L225 Difference]: With dead ends: 854 [2025-01-09 08:19:25,123 INFO L226 Difference]: Without dead ends: 547 [2025-01-09 08:19:25,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:19:25,124 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 382 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:25,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1500 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:25,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-01-09 08:19:25,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2025-01-09 08:19:25,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 1.4597069597069596) internal successors, (797), 546 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:25,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 797 transitions. [2025-01-09 08:19:25,138 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 797 transitions. Word has length 202 [2025-01-09 08:19:25,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:25,139 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 797 transitions. [2025-01-09 08:19:25,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:25,139 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 797 transitions. [2025-01-09 08:19:25,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 08:19:25,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:25,141 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:25,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 08:19:25,142 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:25,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:25,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1493615647, now seen corresponding path program 1 times [2025-01-09 08:19:25,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:25,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82398241] [2025-01-09 08:19:25,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:25,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:25,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 08:19:25,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 08:19:25,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:25,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:27,429 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:27,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:27,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82398241] [2025-01-09 08:19:27,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82398241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:27,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:27,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 08:19:27,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39067577] [2025-01-09 08:19:27,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:27,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 08:19:27,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:27,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 08:19:27,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:19:27,431 INFO L87 Difference]: Start difference. First operand 547 states and 797 transitions. Second operand has 11 states, 11 states have (on average 18.454545454545453) internal successors, (203), 11 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:27,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:27,654 INFO L93 Difference]: Finished difference Result 978 states and 1420 transitions. [2025-01-09 08:19:27,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 08:19:27,655 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 18.454545454545453) internal successors, (203), 11 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2025-01-09 08:19:27,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:27,657 INFO L225 Difference]: With dead ends: 978 [2025-01-09 08:19:27,657 INFO L226 Difference]: Without dead ends: 672 [2025-01-09 08:19:27,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2025-01-09 08:19:27,659 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 1024 mSDsluCounter, 2120 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 2616 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:27,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1024 Valid, 2616 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:19:27,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-01-09 08:19:27,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 656. [2025-01-09 08:19:27,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 655 states have (on average 1.4442748091603053) internal successors, (946), 655 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:27,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 946 transitions. [2025-01-09 08:19:27,673 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 946 transitions. Word has length 203 [2025-01-09 08:19:27,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:27,673 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 946 transitions. [2025-01-09 08:19:27,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.454545454545453) internal successors, (203), 11 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 946 transitions. [2025-01-09 08:19:27,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 08:19:27,675 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:27,675 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:27,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 08:19:27,675 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:27,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:27,676 INFO L85 PathProgramCache]: Analyzing trace with hash 45112710, now seen corresponding path program 1 times [2025-01-09 08:19:27,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:27,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795239051] [2025-01-09 08:19:27,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:27,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:27,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 08:19:28,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 08:19:28,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:28,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:30,352 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:30,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:30,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795239051] [2025-01-09 08:19:30,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795239051] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:19:30,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165173987] [2025-01-09 08:19:30,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:30,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:19:30,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:19:30,357 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:19:30,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 08:19:30,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 08:19:31,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 08:19:31,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:31,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:31,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 1439 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 08:19:31,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:19:31,484 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:31,484 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:19:31,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165173987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:31,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:19:31,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2025-01-09 08:19:31,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105733254] [2025-01-09 08:19:31,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:31,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:19:31,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:31,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:19:31,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-01-09 08:19:31,486 INFO L87 Difference]: Start difference. First operand 656 states and 946 transitions. Second operand has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:31,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:31,892 INFO L93 Difference]: Finished difference Result 1104 states and 1600 transitions. [2025-01-09 08:19:31,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:19:31,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2025-01-09 08:19:31,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:31,895 INFO L225 Difference]: With dead ends: 1104 [2025-01-09 08:19:31,895 INFO L226 Difference]: Without dead ends: 656 [2025-01-09 08:19:31,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-01-09 08:19:31,896 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 731 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:31,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 879 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 08:19:31,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2025-01-09 08:19:31,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2025-01-09 08:19:31,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 655 states have (on average 1.4381679389312978) internal successors, (942), 655 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 942 transitions. [2025-01-09 08:19:31,905 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 942 transitions. Word has length 203 [2025-01-09 08:19:31,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:31,905 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 942 transitions. [2025-01-09 08:19:31,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:31,906 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 942 transitions. [2025-01-09 08:19:31,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 08:19:31,907 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:31,907 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:31,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 08:19:32,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 08:19:32,111 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:32,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:32,111 INFO L85 PathProgramCache]: Analyzing trace with hash 161548361, now seen corresponding path program 1 times [2025-01-09 08:19:32,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:32,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087324342] [2025-01-09 08:19:32,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:32,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:32,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 08:19:32,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 08:19:32,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:32,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:33,435 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:33,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:33,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087324342] [2025-01-09 08:19:33,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087324342] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:19:33,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385965074] [2025-01-09 08:19:33,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:33,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:19:33,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:19:33,438 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:19:33,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 08:19:33,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 08:19:34,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 08:19:34,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:34,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:34,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 1443 conjuncts, 104 conjuncts are in the unsatisfiable core [2025-01-09 08:19:34,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:19:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:36,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:19:36,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385965074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:36,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:19:36,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2025-01-09 08:19:36,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125961065] [2025-01-09 08:19:36,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:36,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 08:19:36,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:36,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 08:19:36,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-01-09 08:19:36,745 INFO L87 Difference]: Start difference. First operand 656 states and 942 transitions. Second operand has 11 states, 11 states have (on average 18.636363636363637) internal successors, (205), 11 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:37,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:37,915 INFO L93 Difference]: Finished difference Result 969 states and 1403 transitions. [2025-01-09 08:19:37,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 08:19:37,915 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 18.636363636363637) internal successors, (205), 11 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2025-01-09 08:19:37,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:37,918 INFO L225 Difference]: With dead ends: 969 [2025-01-09 08:19:37,918 INFO L226 Difference]: Without dead ends: 664 [2025-01-09 08:19:37,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2025-01-09 08:19:37,920 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 1012 mSDsluCounter, 1835 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 2098 SdHoareTripleChecker+Invalid, 1710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:37,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 2098 Invalid, 1710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 08:19:37,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-01-09 08:19:37,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 662. [2025-01-09 08:19:37,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.4357034795763994) internal successors, (949), 661 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:37,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 949 transitions. [2025-01-09 08:19:37,932 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 949 transitions. Word has length 205 [2025-01-09 08:19:37,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:37,933 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 949 transitions. [2025-01-09 08:19:37,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.636363636363637) internal successors, (205), 11 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:37,933 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 949 transitions. [2025-01-09 08:19:37,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 08:19:37,934 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:37,934 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:37,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 08:19:38,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:19:38,135 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:38,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:38,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2024220089, now seen corresponding path program 1 times [2025-01-09 08:19:38,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:38,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779677947] [2025-01-09 08:19:38,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:38,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:38,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 08:19:38,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 08:19:38,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:38,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:39,832 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:39,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:39,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779677947] [2025-01-09 08:19:39,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779677947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:39,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:39,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:19:39,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161120378] [2025-01-09 08:19:39,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:39,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:19:39,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:39,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:19:39,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:19:39,835 INFO L87 Difference]: Start difference. First operand 662 states and 949 transitions. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:39,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:39,927 INFO L93 Difference]: Finished difference Result 986 states and 1425 transitions. [2025-01-09 08:19:39,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:19:39,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-01-09 08:19:39,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:39,929 INFO L225 Difference]: With dead ends: 986 [2025-01-09 08:19:39,929 INFO L226 Difference]: Without dead ends: 672 [2025-01-09 08:19:39,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:19:39,931 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 378 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:39,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1940 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:19:39,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-01-09 08:19:39,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 662. [2025-01-09 08:19:39,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.4357034795763994) internal successors, (949), 661 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:39,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 949 transitions. [2025-01-09 08:19:39,941 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 949 transitions. Word has length 206 [2025-01-09 08:19:39,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:39,942 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 949 transitions. [2025-01-09 08:19:39,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:39,942 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 949 transitions. [2025-01-09 08:19:39,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 08:19:39,944 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:39,944 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:39,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 08:19:39,944 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:39,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:39,945 INFO L85 PathProgramCache]: Analyzing trace with hash -776952089, now seen corresponding path program 1 times [2025-01-09 08:19:39,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:39,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440969509] [2025-01-09 08:19:39,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:39,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:39,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 08:19:40,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 08:19:40,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:40,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:41,296 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:41,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:41,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440969509] [2025-01-09 08:19:41,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440969509] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:19:41,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66960240] [2025-01-09 08:19:41,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:41,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:19:41,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:19:41,299 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:19:41,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 08:19:41,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 08:19:42,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 08:19:42,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:42,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:42,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 1444 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-01-09 08:19:42,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:19:43,533 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:43,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:19:46,150 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:46,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66960240] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:19:46,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:19:46,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 17] total 43 [2025-01-09 08:19:46,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234357993] [2025-01-09 08:19:46,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:19:46,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-01-09 08:19:46,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:46,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-01-09 08:19:46,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1652, Unknown=0, NotChecked=0, Total=1806 [2025-01-09 08:19:46,152 INFO L87 Difference]: Start difference. First operand 662 states and 949 transitions. Second operand has 43 states, 43 states have (on average 13.976744186046512) internal successors, (601), 43 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:48,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:48,036 INFO L93 Difference]: Finished difference Result 1167 states and 1687 transitions. [2025-01-09 08:19:48,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-01-09 08:19:48,036 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 13.976744186046512) internal successors, (601), 43 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-01-09 08:19:48,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:48,042 INFO L225 Difference]: With dead ends: 1167 [2025-01-09 08:19:48,043 INFO L226 Difference]: Without dead ends: 900 [2025-01-09 08:19:48,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1467 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=748, Invalid=6224, Unknown=0, NotChecked=0, Total=6972 [2025-01-09 08:19:48,045 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 3448 mSDsluCounter, 10716 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3448 SdHoareTripleChecker+Valid, 11185 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:48,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3448 Valid, 11185 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 08:19:48,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2025-01-09 08:19:48,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 884. [2025-01-09 08:19:48,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 1.433748584371461) internal successors, (1266), 883 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:48,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1266 transitions. [2025-01-09 08:19:48,055 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1266 transitions. Word has length 206 [2025-01-09 08:19:48,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:48,055 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 1266 transitions. [2025-01-09 08:19:48,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 13.976744186046512) internal successors, (601), 43 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:48,056 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1266 transitions. [2025-01-09 08:19:48,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 08:19:48,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:48,057 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:48,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 08:19:48,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-09 08:19:48,260 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:48,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:48,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1701790958, now seen corresponding path program 1 times [2025-01-09 08:19:48,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:48,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811079401] [2025-01-09 08:19:48,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:48,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:48,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 08:19:48,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 08:19:48,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:48,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:49,700 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:49,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:49,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811079401] [2025-01-09 08:19:49,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811079401] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:19:49,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501341504] [2025-01-09 08:19:49,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:49,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:19:49,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:19:49,703 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:19:49,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 08:19:50,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 08:19:50,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 08:19:50,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:50,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:50,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 1447 conjuncts, 106 conjuncts are in the unsatisfiable core [2025-01-09 08:19:50,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:19:51,517 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:51,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:19:53,929 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:53,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501341504] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:19:53,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:19:53,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20, 19] total 50 [2025-01-09 08:19:53,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246584686] [2025-01-09 08:19:53,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:19:53,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-01-09 08:19:53,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:53,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-01-09 08:19:53,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=2179, Unknown=0, NotChecked=0, Total=2450 [2025-01-09 08:19:53,932 INFO L87 Difference]: Start difference. First operand 884 states and 1266 transitions. Second operand has 50 states, 50 states have (on average 12.2) internal successors, (610), 50 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:57,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:57,383 INFO L93 Difference]: Finished difference Result 1836 states and 2646 transitions. [2025-01-09 08:19:57,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-01-09 08:19:57,384 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 12.2) internal successors, (610), 50 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207 [2025-01-09 08:19:57,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:57,387 INFO L225 Difference]: With dead ends: 1836 [2025-01-09 08:19:57,387 INFO L226 Difference]: Without dead ends: 1426 [2025-01-09 08:19:57,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3194 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1270, Invalid=9860, Unknown=0, NotChecked=0, Total=11130 [2025-01-09 08:19:57,392 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 6619 mSDsluCounter, 6520 mSDsCounter, 0 mSdLazyCounter, 5280 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6619 SdHoareTripleChecker+Valid, 6802 SdHoareTripleChecker+Invalid, 5303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 5280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:57,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6619 Valid, 6802 Invalid, 5303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 5280 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 08:19:57,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2025-01-09 08:19:57,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1155. [2025-01-09 08:19:57,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1154 states have (on average 1.438474870017331) internal successors, (1660), 1154 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:57,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1660 transitions. [2025-01-09 08:19:57,407 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1660 transitions. Word has length 207 [2025-01-09 08:19:57,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:57,407 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1660 transitions. [2025-01-09 08:19:57,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 12.2) internal successors, (610), 50 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:57,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1660 transitions. [2025-01-09 08:19:57,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 08:19:57,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:57,409 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:19:57,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 08:19:57,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-09 08:19:57,614 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:57,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:57,618 INFO L85 PathProgramCache]: Analyzing trace with hash 553939868, now seen corresponding path program 1 times [2025-01-09 08:19:57,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:57,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621454179] [2025-01-09 08:19:57,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:57,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:57,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 08:19:57,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 08:19:57,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:57,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:58,991 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:58,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:58,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621454179] [2025-01-09 08:19:58,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621454179] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:19:58,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465797347] [2025-01-09 08:19:58,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:58,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:19:58,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:19:58,994 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:19:58,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 08:19:59,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 08:19:59,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 08:19:59,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:59,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:59,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-09 08:19:59,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:20:00,163 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 08:20:00,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:20:06,673 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_z_14 Int) (v_y_14 Int)) (or (not (= (mod |c_ULTIMATE.start_main_~state_29~0#1| 256) (+ (* v_z_14 255) (* v_y_14 256)))) (< v_z_14 1) (< 255 v_z_14))) (= (mod |c_ULTIMATE.start_main_~input_12~0#1| 256) 0)) is different from false [2025-01-09 08:20:07,269 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_z_14 Int) (v_y_14 Int)) (or (not (= (mod |c_ULTIMATE.start_main_~state_29~0#1| 256) (+ (* v_z_14 255) (* v_y_14 256)))) (< v_z_14 1) (< 255 v_z_14))) (= (mod |c_ULTIMATE.start_main_#t~bitwise74#1| 256) 0)) is different from false [2025-01-09 08:20:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 10 not checked. [2025-01-09 08:20:07,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465797347] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:20:07,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:20:07,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 27 [2025-01-09 08:20:07,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473330793] [2025-01-09 08:20:07,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:20:07,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 08:20:07,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:07,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 08:20:07,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=492, Unknown=11, NotChecked=94, Total=702 [2025-01-09 08:20:07,409 INFO L87 Difference]: Start difference. First operand 1155 states and 1660 transitions. Second operand has 27 states, 27 states have (on average 16.85185185185185) internal successors, (455), 27 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:07,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:07,872 INFO L93 Difference]: Finished difference Result 2102 states and 3042 transitions. [2025-01-09 08:20:07,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 08:20:07,873 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 16.85185185185185) internal successors, (455), 27 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 208 [2025-01-09 08:20:07,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:07,877 INFO L225 Difference]: With dead ends: 2102 [2025-01-09 08:20:07,877 INFO L226 Difference]: Without dead ends: 1608 [2025-01-09 08:20:07,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 398 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=189, Invalid=864, Unknown=11, NotChecked=126, Total=1190 [2025-01-09 08:20:07,878 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 3804 mSDsluCounter, 5213 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3804 SdHoareTripleChecker+Valid, 5719 SdHoareTripleChecker+Invalid, 3019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2667 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:07,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3804 Valid, 5719 Invalid, 3019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 349 Invalid, 0 Unknown, 2667 Unchecked, 0.3s Time] [2025-01-09 08:20:07,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2025-01-09 08:20:07,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1159. [2025-01-09 08:20:07,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1158 states have (on average 1.4335060449050085) internal successors, (1660), 1158 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:07,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1660 transitions. [2025-01-09 08:20:07,894 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1660 transitions. Word has length 208 [2025-01-09 08:20:07,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:07,895 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1660 transitions. [2025-01-09 08:20:07,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 16.85185185185185) internal successors, (455), 27 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:07,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1660 transitions. [2025-01-09 08:20:07,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 08:20:07,896 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:07,896 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:20:07,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 08:20:08,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-09 08:20:08,101 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:08,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:08,102 INFO L85 PathProgramCache]: Analyzing trace with hash 536617513, now seen corresponding path program 1 times [2025-01-09 08:20:08,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:08,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504650460] [2025-01-09 08:20:08,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:08,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:08,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 08:20:08,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 08:20:08,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:08,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:10,028 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:10,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:10,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504650460] [2025-01-09 08:20:10,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504650460] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:20:10,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305781566] [2025-01-09 08:20:10,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:10,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:20:10,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:20:10,032 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:20:10,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 08:20:10,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 08:20:10,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 08:20:10,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:10,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:10,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 115 conjuncts are in the unsatisfiable core [2025-01-09 08:20:10,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:20:12,420 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:12,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:20:14,598 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:14,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305781566] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:20:14,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:20:14,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 18] total 42 [2025-01-09 08:20:14,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789270792] [2025-01-09 08:20:14,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:20:14,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-01-09 08:20:14,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:14,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-01-09 08:20:14,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1554, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 08:20:14,603 INFO L87 Difference]: Start difference. First operand 1159 states and 1660 transitions. Second operand has 42 states, 42 states have (on average 14.547619047619047) internal successors, (611), 42 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:17,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:17,330 INFO L93 Difference]: Finished difference Result 1513 states and 2178 transitions. [2025-01-09 08:20:17,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-09 08:20:17,331 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 14.547619047619047) internal successors, (611), 42 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 208 [2025-01-09 08:20:17,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:17,335 INFO L225 Difference]: With dead ends: 1513 [2025-01-09 08:20:17,335 INFO L226 Difference]: Without dead ends: 1214 [2025-01-09 08:20:17,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=586, Invalid=4670, Unknown=0, NotChecked=0, Total=5256 [2025-01-09 08:20:17,337 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 1889 mSDsluCounter, 5057 mSDsCounter, 0 mSdLazyCounter, 4679 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1889 SdHoareTripleChecker+Valid, 5346 SdHoareTripleChecker+Invalid, 4695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 4679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:17,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1889 Valid, 5346 Invalid, 4695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 4679 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 08:20:17,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2025-01-09 08:20:17,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1157. [2025-01-09 08:20:17,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.4316608996539792) internal successors, (1655), 1156 states have internal predecessors, (1655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:17,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1655 transitions. [2025-01-09 08:20:17,350 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1655 transitions. Word has length 208 [2025-01-09 08:20:17,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:17,351 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1655 transitions. [2025-01-09 08:20:17,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 14.547619047619047) internal successors, (611), 42 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:17,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1655 transitions. [2025-01-09 08:20:17,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 08:20:17,352 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:17,352 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:20:17,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 08:20:17,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:20:17,557 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:17,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:17,558 INFO L85 PathProgramCache]: Analyzing trace with hash -119040787, now seen corresponding path program 1 times [2025-01-09 08:20:17,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:17,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761727163] [2025-01-09 08:20:17,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:17,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:17,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 08:20:17,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 08:20:17,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:17,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:19,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:19,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761727163] [2025-01-09 08:20:19,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761727163] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:20:19,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232573207] [2025-01-09 08:20:19,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:19,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:20:19,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:20:19,123 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:20:19,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 08:20:19,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 08:20:19,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 08:20:19,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:19,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:19,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 1450 conjuncts, 134 conjuncts are in the unsatisfiable core [2025-01-09 08:20:19,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:20:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:21,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:20:23,898 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:23,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232573207] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:20:23,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:20:23,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 24, 19] total 55 [2025-01-09 08:20:23,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388002751] [2025-01-09 08:20:23,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:20:23,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-01-09 08:20:23,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:23,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-01-09 08:20:23,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=2721, Unknown=0, NotChecked=0, Total=2970 [2025-01-09 08:20:23,901 INFO L87 Difference]: Start difference. First operand 1157 states and 1655 transitions. Second operand has 55 states, 55 states have (on average 11.145454545454545) internal successors, (613), 55 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:29,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:29,421 INFO L93 Difference]: Finished difference Result 2457 states and 3522 transitions. [2025-01-09 08:20:29,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-01-09 08:20:29,422 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 11.145454545454545) internal successors, (613), 55 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 208 [2025-01-09 08:20:29,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:29,426 INFO L225 Difference]: With dead ends: 2457 [2025-01-09 08:20:29,427 INFO L226 Difference]: Without dead ends: 1644 [2025-01-09 08:20:29,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3757 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1328, Invalid=11554, Unknown=0, NotChecked=0, Total=12882 [2025-01-09 08:20:29,435 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 6004 mSDsluCounter, 10349 mSDsCounter, 0 mSdLazyCounter, 8579 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6004 SdHoareTripleChecker+Valid, 10694 SdHoareTripleChecker+Invalid, 8608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 8579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:29,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6004 Valid, 10694 Invalid, 8608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 8579 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-09 08:20:29,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2025-01-09 08:20:29,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1177. [2025-01-09 08:20:29,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1176 states have (on average 1.4302721088435375) internal successors, (1682), 1176 states have internal predecessors, (1682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:29,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1682 transitions. [2025-01-09 08:20:29,467 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1682 transitions. Word has length 208 [2025-01-09 08:20:29,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:29,468 INFO L471 AbstractCegarLoop]: Abstraction has 1177 states and 1682 transitions. [2025-01-09 08:20:29,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 11.145454545454545) internal successors, (613), 55 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:29,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1682 transitions. [2025-01-09 08:20:29,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 08:20:29,469 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:29,469 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:20:29,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 08:20:29,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:20:29,674 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:29,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:29,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1134095019, now seen corresponding path program 1 times [2025-01-09 08:20:29,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:29,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007446593] [2025-01-09 08:20:29,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:29,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:29,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 08:20:29,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 08:20:29,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:29,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:30,226 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:30,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:30,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007446593] [2025-01-09 08:20:30,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007446593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:30,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:30,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 08:20:30,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631758140] [2025-01-09 08:20:30,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:30,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:20:30,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:30,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:20:30,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:20:30,228 INFO L87 Difference]: Start difference. First operand 1177 states and 1682 transitions. Second operand has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:30,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:30,346 INFO L93 Difference]: Finished difference Result 2615 states and 3752 transitions. [2025-01-09 08:20:30,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:20:30,346 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 209 [2025-01-09 08:20:30,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:30,351 INFO L225 Difference]: With dead ends: 2615 [2025-01-09 08:20:30,351 INFO L226 Difference]: Without dead ends: 2104 [2025-01-09 08:20:30,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:20:30,353 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 215 mSDsluCounter, 3221 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 3769 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:30,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 3769 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:30,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2104 states. [2025-01-09 08:20:30,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2104 to 1960. [2025-01-09 08:20:30,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1960 states, 1959 states have (on average 1.4344053088310362) internal successors, (2810), 1959 states have internal predecessors, (2810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:30,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 2810 transitions. [2025-01-09 08:20:30,380 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 2810 transitions. Word has length 209 [2025-01-09 08:20:30,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:30,381 INFO L471 AbstractCegarLoop]: Abstraction has 1960 states and 2810 transitions. [2025-01-09 08:20:30,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:30,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 2810 transitions. [2025-01-09 08:20:30,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 08:20:30,385 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:30,386 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:20:30,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 08:20:30,386 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:30,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:30,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1920412383, now seen corresponding path program 1 times [2025-01-09 08:20:30,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:30,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864843812] [2025-01-09 08:20:30,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:30,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:30,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes.