./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-10.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash acffbf4568185b4df73fbdfca312807b0d1acfe4982bda3fcfc32319476145af --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:48:07,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:48:07,428 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:48:07,435 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:48:07,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:48:07,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:48:07,454 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:48:07,455 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:48:07,455 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:48:07,455 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:48:07,456 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:48:07,456 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:48:07,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:48:07,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:48:07,456 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:48:07,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:48:07,457 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:48:07,457 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:48:07,457 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:48:07,457 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:48:07,457 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:48:07,457 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:48:07,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:48:07,457 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:48:07,458 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:48:07,458 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:48:07,458 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:48:07,458 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:48:07,458 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:48:07,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:48:07,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:48:07,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:48:07,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:48:07,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:48:07,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:48:07,459 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:48:07,459 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:48:07,459 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:48:07,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:48:07,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:48:07,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:48:07,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:48:07,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:48:07,459 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> acffbf4568185b4df73fbdfca312807b0d1acfe4982bda3fcfc32319476145af [2025-03-03 20:48:07,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:48:07,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:48:07,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:48:07,695 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:48:07,695 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:48:07,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-10.i [2025-03-03 20:48:08,819 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27b19408d/64a73358e75c4b90892e7bb06beb4345/FLAGc41df9754 [2025-03-03 20:48:09,131 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:48:09,131 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-10.i [2025-03-03 20:48:09,143 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27b19408d/64a73358e75c4b90892e7bb06beb4345/FLAGc41df9754 [2025-03-03 20:48:09,395 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27b19408d/64a73358e75c4b90892e7bb06beb4345 [2025-03-03 20:48:09,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:48:09,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:48:09,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:48:09,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:48:09,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:48:09,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:48:09" (1/1) ... [2025-03-03 20:48:09,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5069a45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:48:09, skipping insertion in model container [2025-03-03 20:48:09,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:48:09" (1/1) ... [2025-03-03 20:48:09,416 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:48:09,522 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-10.i[919,932] [2025-03-03 20:48:09,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:48:09,604 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:48:09,615 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-10.i[919,932] [2025-03-03 20:48:09,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:48:09,679 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:48:09,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:48:09 WrapperNode [2025-03-03 20:48:09,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:48:09,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:48:09,682 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:48:09,682 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:48:09,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:48:09" (1/1) ... [2025-03-03 20:48:09,700 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:48:09" (1/1) ... [2025-03-03 20:48:09,738 INFO L138 Inliner]: procedures = 26, calls = 55, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 315 [2025-03-03 20:48:09,739 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:48:09,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:48:09,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:48:09,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:48:09,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:48:09" (1/1) ... [2025-03-03 20:48:09,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:48:09" (1/1) ... [2025-03-03 20:48:09,756 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:48:09" (1/1) ... [2025-03-03 20:48:09,780 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-03-03 20:48:09,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:48:09" (1/1) ... [2025-03-03 20:48:09,781 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:48:09" (1/1) ... [2025-03-03 20:48:09,793 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:48:09" (1/1) ... [2025-03-03 20:48:09,796 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:48:09" (1/1) ... [2025-03-03 20:48:09,799 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:48:09" (1/1) ... [2025-03-03 20:48:09,800 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:48:09" (1/1) ... [2025-03-03 20:48:09,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:48:09,809 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:48:09,809 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:48:09,809 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:48:09,810 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:48:09" (1/1) ... [2025-03-03 20:48:09,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:48:09,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:48:09,840 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:48:09,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:48:09,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:48:09,860 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:48:09,860 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:48:09,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:48:09,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:48:09,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:48:09,940 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:48:09,941 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:48:10,417 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L211: havoc property_#t~bitwise35#1;havoc property_#t~ite37#1;havoc property_#t~bitwise36#1;havoc property_#t~short38#1; [2025-03-03 20:48:10,457 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-03-03 20:48:10,458 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:48:10,476 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:48:10,476 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:48:10,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:48:10 BoogieIcfgContainer [2025-03-03 20:48:10,476 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:48:10,479 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:48:10,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:48:10,483 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:48:10,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:48:09" (1/3) ... [2025-03-03 20:48:10,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65cd8d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:48:10, skipping insertion in model container [2025-03-03 20:48:10,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:48:09" (2/3) ... [2025-03-03 20:48:10,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65cd8d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:48:10, skipping insertion in model container [2025-03-03 20:48:10,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:48:10" (3/3) ... [2025-03-03 20:48:10,486 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-10.i [2025-03-03 20:48:10,497 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:48:10,501 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-10.i that has 2 procedures, 137 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:48:10,569 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:48:10,576 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;@47b542d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:48:10,576 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:48:10,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 92 states have (on average 1.423913043478261) internal successors, (131), 93 states have internal predecessors, (131), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 20:48:10,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-03 20:48:10,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:48:10,594 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:48:10,594 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:48:10,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:48:10,599 INFO L85 PathProgramCache]: Analyzing trace with hash 657089151, now seen corresponding path program 1 times [2025-03-03 20:48:10,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:48:10,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330192239] [2025-03-03 20:48:10,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:48:10,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:48:10,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-03 20:48:10,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-03 20:48:10,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:48:10,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:48:10,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-03-03 20:48:10,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:48:10,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330192239] [2025-03-03 20:48:10,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330192239] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:48:10,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781918527] [2025-03-03 20:48:10,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:48:10,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:48:10,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:48:10,957 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:48:10,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:48:11,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-03 20:48:11,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-03 20:48:11,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:48:11,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:48:11,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:48:11,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:48:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-03-03 20:48:11,200 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:48:11,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781918527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:48:11,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:48:11,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:48:11,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663985832] [2025-03-03 20:48:11,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:48:11,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:48:11,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:48:11,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:48:11,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:48:11,224 INFO L87 Difference]: Start difference. First operand has 137 states, 92 states have (on average 1.423913043478261) internal successors, (131), 93 states have internal predecessors, (131), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-03 20:48:11,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:48:11,264 INFO L93 Difference]: Finished difference Result 268 states and 467 transitions. [2025-03-03 20:48:11,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:48:11,266 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) Word has length 262 [2025-03-03 20:48:11,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:48:11,270 INFO L225 Difference]: With dead ends: 268 [2025-03-03 20:48:11,270 INFO L226 Difference]: Without dead ends: 134 [2025-03-03 20:48:11,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:48:11,275 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:48:11,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:48:11,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-03 20:48:11,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-03-03 20:48:11,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 90 states have (on average 1.4) internal successors, (126), 90 states have internal predecessors, (126), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 20:48:11,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 210 transitions. [2025-03-03 20:48:11,317 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 210 transitions. Word has length 262 [2025-03-03 20:48:11,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:48:11,318 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 210 transitions. [2025-03-03 20:48:11,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-03 20:48:11,319 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 210 transitions. [2025-03-03 20:48:11,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-03 20:48:11,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:48:11,335 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:48:11,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 20:48:11,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:48:11,536 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:48:11,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:48:11,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1457933861, now seen corresponding path program 1 times [2025-03-03 20:48:11,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:48:11,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125733100] [2025-03-03 20:48:11,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:48:11,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:48:11,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-03 20:48:11,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-03 20:48:11,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:48:11,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:48:12,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-03 20:48:12,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:48:12,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125733100] [2025-03-03 20:48:12,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125733100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:48:12,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:48:12,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:48:12,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22351326] [2025-03-03 20:48:12,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:48:12,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:48:12,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:48:12,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:48:12,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:48:12,264 INFO L87 Difference]: Start difference. First operand 134 states and 210 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-03 20:48:12,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:48:12,509 INFO L93 Difference]: Finished difference Result 397 states and 625 transitions. [2025-03-03 20:48:12,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:48:12,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 262 [2025-03-03 20:48:12,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:48:12,513 INFO L225 Difference]: With dead ends: 397 [2025-03-03 20:48:12,513 INFO L226 Difference]: Without dead ends: 266 [2025-03-03 20:48:12,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:48:12,517 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 130 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:48:12,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 577 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:48:12,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-03 20:48:12,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 206. [2025-03-03 20:48:12,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 119 states have (on average 1.3025210084033614) internal successors, (155), 119 states have internal predecessors, (155), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 20:48:12,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 323 transitions. [2025-03-03 20:48:12,560 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 323 transitions. Word has length 262 [2025-03-03 20:48:12,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:48:12,560 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 323 transitions. [2025-03-03 20:48:12,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-03 20:48:12,560 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 323 transitions. [2025-03-03 20:48:12,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-03 20:48:12,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:48:12,566 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:48:12,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:48:12,567 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:48:12,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:48:12,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1922880811, now seen corresponding path program 1 times [2025-03-03 20:48:12,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:48:12,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657917961] [2025-03-03 20:48:12,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:48:12,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:48:12,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-03 20:48:12,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-03 20:48:12,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:48:12,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:48:29,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-03 20:48:29,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:48:29,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657917961] [2025-03-03 20:48:29,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657917961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:48:29,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:48:29,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 20:48:29,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189212600] [2025-03-03 20:48:29,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:48:29,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 20:48:29,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:48:29,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 20:48:29,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-03 20:48:29,919 INFO L87 Difference]: Start difference. First operand 206 states and 323 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-03 20:48:32,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:48:32,018 INFO L93 Difference]: Finished difference Result 681 states and 1056 transitions. [2025-03-03 20:48:32,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 20:48:32,018 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 263 [2025-03-03 20:48:32,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:48:32,023 INFO L225 Difference]: With dead ends: 681 [2025-03-03 20:48:32,023 INFO L226 Difference]: Without dead ends: 550 [2025-03-03 20:48:32,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2025-03-03 20:48:32,024 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 1313 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1313 SdHoareTripleChecker+Valid, 1381 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:48:32,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1313 Valid, 1381 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 20:48:32,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-03 20:48:32,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 388. [2025-03-03 20:48:32,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 255 states have (on average 1.3568627450980393) internal successors, (346), 256 states have internal predecessors, (346), 126 states have call successors, (126), 6 states have call predecessors, (126), 6 states have return successors, (126), 125 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-03 20:48:32,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 598 transitions. [2025-03-03 20:48:32,074 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 598 transitions. Word has length 263 [2025-03-03 20:48:32,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:48:32,074 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 598 transitions. [2025-03-03 20:48:32,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-03 20:48:32,075 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 598 transitions. [2025-03-03 20:48:32,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-03 20:48:32,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:48:32,077 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:48:32,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:48:32,077 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:48:32,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:48:32,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1375014132, now seen corresponding path program 1 times [2025-03-03 20:48:32,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:48:32,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115358644] [2025-03-03 20:48:32,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:48:32,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:48:32,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-03 20:48:32,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-03 20:48:32,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:48:32,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:49:00,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-03 20:49:00,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:49:00,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115358644] [2025-03-03 20:49:00,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115358644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:49:00,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:49:00,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 20:49:00,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558174389] [2025-03-03 20:49:00,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:49:00,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 20:49:00,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:49:00,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 20:49:00,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-03 20:49:00,167 INFO L87 Difference]: Start difference. First operand 388 states and 598 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-03 20:49:02,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:49:02,865 INFO L93 Difference]: Finished difference Result 690 states and 1051 transitions. [2025-03-03 20:49:02,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 20:49:02,865 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 263 [2025-03-03 20:49:02,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:49:02,869 INFO L225 Difference]: With dead ends: 690 [2025-03-03 20:49:02,870 INFO L226 Difference]: Without dead ends: 559 [2025-03-03 20:49:02,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=226, Invalid=530, Unknown=0, NotChecked=0, Total=756 [2025-03-03 20:49:02,871 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 1005 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 1621 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:49:02,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 1498 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1621 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 20:49:02,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-03 20:49:02,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 318. [2025-03-03 20:49:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 229 states have (on average 1.4061135371179039) internal successors, (322), 229 states have internal predecessors, (322), 84 states have call successors, (84), 4 states have call predecessors, (84), 4 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 20:49:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 490 transitions. [2025-03-03 20:49:02,896 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 490 transitions. Word has length 263 [2025-03-03 20:49:02,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:49:02,898 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 490 transitions. [2025-03-03 20:49:02,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-03 20:49:02,898 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 490 transitions. [2025-03-03 20:49:02,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-03 20:49:02,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:49:02,901 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:49:02,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:49:02,902 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:49:02,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:49:02,902 INFO L85 PathProgramCache]: Analyzing trace with hash -415383723, now seen corresponding path program 1 times [2025-03-03 20:49:02,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:49:02,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874788831] [2025-03-03 20:49:02,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:49:02,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:49:02,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-03 20:49:03,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-03 20:49:03,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:49:03,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:49:05,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-03 20:49:05,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:49:05,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874788831] [2025-03-03 20:49:05,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874788831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:49:05,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:49:05,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 20:49:05,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450960449] [2025-03-03 20:49:05,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:49:05,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 20:49:05,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:49:05,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 20:49:05,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-03 20:49:05,765 INFO L87 Difference]: Start difference. First operand 318 states and 490 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-03 20:49:07,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:49:07,417 INFO L93 Difference]: Finished difference Result 1152 states and 1762 transitions. [2025-03-03 20:49:07,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 20:49:07,417 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 263 [2025-03-03 20:49:07,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:49:07,421 INFO L225 Difference]: With dead ends: 1152 [2025-03-03 20:49:07,422 INFO L226 Difference]: Without dead ends: 837 [2025-03-03 20:49:07,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-03-03 20:49:07,423 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 723 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:49:07,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1581 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 20:49:07,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2025-03-03 20:49:07,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 441. [2025-03-03 20:49:07,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 307 states have (on average 1.3680781758957654) internal successors, (420), 307 states have internal predecessors, (420), 126 states have call successors, (126), 7 states have call predecessors, (126), 7 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-03 20:49:07,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 672 transitions. [2025-03-03 20:49:07,455 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 672 transitions. Word has length 263 [2025-03-03 20:49:07,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:49:07,456 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 672 transitions. [2025-03-03 20:49:07,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-03 20:49:07,456 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 672 transitions. [2025-03-03 20:49:07,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-03 20:49:07,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:49:07,458 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:49:07,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:49:07,458 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:49:07,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:49:07,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1092168086, now seen corresponding path program 1 times [2025-03-03 20:49:07,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:49:07,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318411592] [2025-03-03 20:49:07,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:49:07,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:49:07,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-03 20:49:07,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-03 20:49:07,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:49:07,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:49:11,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-03 20:49:11,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:49:11,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318411592] [2025-03-03 20:49:11,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318411592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:49:11,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:49:11,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 20:49:11,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210930447] [2025-03-03 20:49:11,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:49:11,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 20:49:11,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:49:11,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 20:49:11,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-03-03 20:49:11,926 INFO L87 Difference]: Start difference. First operand 441 states and 672 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-03 20:49:15,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:49:15,306 INFO L93 Difference]: Finished difference Result 757 states and 1149 transitions. [2025-03-03 20:49:15,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 20:49:15,306 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 263 [2025-03-03 20:49:15,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:49:15,310 INFO L225 Difference]: With dead ends: 757 [2025-03-03 20:49:15,310 INFO L226 Difference]: Without dead ends: 626 [2025-03-03 20:49:15,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2025-03-03 20:49:15,311 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 931 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 2024 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 2029 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 2024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:49:15,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 2029 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 2024 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 20:49:15,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-03-03 20:49:15,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 440. [2025-03-03 20:49:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 306 states have (on average 1.369281045751634) internal successors, (419), 306 states have internal predecessors, (419), 126 states have call successors, (126), 7 states have call predecessors, (126), 7 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-03 20:49:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 671 transitions. [2025-03-03 20:49:15,334 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 671 transitions. Word has length 263 [2025-03-03 20:49:15,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:49:15,335 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 671 transitions. [2025-03-03 20:49:15,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-03 20:49:15,335 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 671 transitions. [2025-03-03 20:49:15,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-03 20:49:15,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:49:15,336 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:49:15,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:49:15,337 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:49:15,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:49:15,337 INFO L85 PathProgramCache]: Analyzing trace with hash -151882859, now seen corresponding path program 1 times [2025-03-03 20:49:15,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:49:15,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421729186] [2025-03-03 20:49:15,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:49:15,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:49:15,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-03 20:49:15,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-03 20:49:15,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:49:15,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:49:16,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-03 20:49:16,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:49:16,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421729186] [2025-03-03 20:49:16,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421729186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:49:16,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:49:16,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 20:49:16,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828381607] [2025-03-03 20:49:16,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:49:16,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 20:49:16,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:49:16,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 20:49:16,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-03 20:49:16,809 INFO L87 Difference]: Start difference. First operand 440 states and 671 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-03 20:49:17,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:49:17,782 INFO L93 Difference]: Finished difference Result 876 states and 1336 transitions. [2025-03-03 20:49:17,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 20:49:17,782 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 263 [2025-03-03 20:49:17,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:49:17,786 INFO L225 Difference]: With dead ends: 876 [2025-03-03 20:49:17,786 INFO L226 Difference]: Without dead ends: 560 [2025-03-03 20:49:17,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2025-03-03 20:49:17,788 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 864 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:49:17,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 1537 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 20:49:17,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-03-03 20:49:17,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 468. [2025-03-03 20:49:17,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 334 states have (on average 1.3862275449101797) internal successors, (463), 334 states have internal predecessors, (463), 126 states have call successors, (126), 7 states have call predecessors, (126), 7 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-03 20:49:17,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 715 transitions. [2025-03-03 20:49:17,820 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 715 transitions. Word has length 263 [2025-03-03 20:49:17,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:49:17,821 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 715 transitions. [2025-03-03 20:49:17,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-03 20:49:17,821 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 715 transitions. [2025-03-03 20:49:17,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-03 20:49:17,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:49:17,823 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:49:17,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:49:17,824 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:49:17,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:49:17,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1989887564, now seen corresponding path program 1 times [2025-03-03 20:49:17,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:49:17,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469227778] [2025-03-03 20:49:17,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:49:17,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:49:17,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-03 20:49:17,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-03 20:49:17,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:49:17,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:49:21,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-03 20:49:21,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:49:21,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469227778] [2025-03-03 20:49:21,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469227778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:49:21,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:49:21,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 20:49:21,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459588100] [2025-03-03 20:49:21,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:49:21,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 20:49:21,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:49:21,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 20:49:21,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:49:21,186 INFO L87 Difference]: Start difference. First operand 468 states and 715 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-03 20:49:23,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:49:23,428 INFO L93 Difference]: Finished difference Result 996 states and 1535 transitions. [2025-03-03 20:49:23,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 20:49:23,431 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 263 [2025-03-03 20:49:23,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:49:23,434 INFO L225 Difference]: With dead ends: 996 [2025-03-03 20:49:23,434 INFO L226 Difference]: Without dead ends: 865 [2025-03-03 20:49:23,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2025-03-03 20:49:23,436 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 742 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 1584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:49:23,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 1911 Invalid, 1584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 20:49:23,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2025-03-03 20:49:23,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 613. [2025-03-03 20:49:23,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 434 states have (on average 1.3755760368663594) internal successors, (597), 434 states have internal predecessors, (597), 168 states have call successors, (168), 10 states have call predecessors, (168), 10 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2025-03-03 20:49:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 933 transitions. [2025-03-03 20:49:23,473 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 933 transitions. Word has length 263 [2025-03-03 20:49:23,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:49:23,474 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 933 transitions. [2025-03-03 20:49:23,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-03 20:49:23,474 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 933 transitions. [2025-03-03 20:49:23,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-03 20:49:23,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:49:23,477 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:49:23,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:49:23,477 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:49:23,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:49:23,477 INFO L85 PathProgramCache]: Analyzing trace with hash -218889612, now seen corresponding path program 1 times [2025-03-03 20:49:23,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:49:23,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643976548] [2025-03-03 20:49:23,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:49:23,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:49:23,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-03 20:49:23,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-03 20:49:23,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:49:23,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:49:24,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-03 20:49:24,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:49:24,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643976548] [2025-03-03 20:49:24,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643976548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:49:24,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:49:24,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 20:49:24,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191446556] [2025-03-03 20:49:24,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:49:24,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 20:49:24,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:49:24,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 20:49:24,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-03 20:49:24,523 INFO L87 Difference]: Start difference. First operand 613 states and 933 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-03 20:49:25,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:49:25,294 INFO L93 Difference]: Finished difference Result 1199 states and 1834 transitions. [2025-03-03 20:49:25,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 20:49:25,295 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 263 [2025-03-03 20:49:25,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:49:25,299 INFO L225 Difference]: With dead ends: 1199 [2025-03-03 20:49:25,299 INFO L226 Difference]: Without dead ends: 894 [2025-03-03 20:49:25,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-03 20:49:25,304 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 514 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:49:25,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 1799 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 20:49:25,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2025-03-03 20:49:25,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 641. [2025-03-03 20:49:25,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 462 states have (on average 1.3874458874458875) internal successors, (641), 462 states have internal predecessors, (641), 168 states have call successors, (168), 10 states have call predecessors, (168), 10 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2025-03-03 20:49:25,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 977 transitions. [2025-03-03 20:49:25,338 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 977 transitions. Word has length 263 [2025-03-03 20:49:25,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:49:25,338 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 977 transitions. [2025-03-03 20:49:25,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-03 20:49:25,338 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 977 transitions. [2025-03-03 20:49:25,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-03 20:49:25,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:49:25,341 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:49:25,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:49:25,341 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:49:25,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:49:25,342 INFO L85 PathProgramCache]: Analyzing trace with hash 522782837, now seen corresponding path program 1 times [2025-03-03 20:49:25,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:49:25,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804456578] [2025-03-03 20:49:25,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:49:25,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:49:25,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-03 20:49:25,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-03 20:49:25,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:49:25,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:49:30,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-03 20:49:30,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:49:30,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804456578] [2025-03-03 20:49:30,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804456578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:49:30,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:49:30,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 20:49:30,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11950212] [2025-03-03 20:49:30,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:49:30,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 20:49:30,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:49:30,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 20:49:30,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-03-03 20:49:30,182 INFO L87 Difference]: Start difference. First operand 641 states and 977 transitions. Second operand has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-03-03 20:49:33,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:49:33,905 INFO L93 Difference]: Finished difference Result 1086 states and 1653 transitions. [2025-03-03 20:49:33,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 20:49:33,905 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) Word has length 264 [2025-03-03 20:49:33,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:49:33,910 INFO L225 Difference]: With dead ends: 1086 [2025-03-03 20:49:33,910 INFO L226 Difference]: Without dead ends: 955 [2025-03-03 20:49:33,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=202, Invalid=728, Unknown=0, NotChecked=0, Total=930 [2025-03-03 20:49:33,912 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 1065 mSDsluCounter, 1845 mSDsCounter, 0 mSdLazyCounter, 2030 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 2060 SdHoareTripleChecker+Invalid, 2177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 2030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:49:33,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1065 Valid, 2060 Invalid, 2177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 2030 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 20:49:33,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2025-03-03 20:49:33,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 663. [2025-03-03 20:49:33,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 482 states have (on average 1.3858921161825726) internal successors, (668), 482 states have internal predecessors, (668), 168 states have call successors, (168), 12 states have call predecessors, (168), 12 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2025-03-03 20:49:33,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1004 transitions. [2025-03-03 20:49:33,945 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1004 transitions. Word has length 264 [2025-03-03 20:49:33,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:49:33,945 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 1004 transitions. [2025-03-03 20:49:33,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-03-03 20:49:33,945 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1004 transitions. [2025-03-03 20:49:33,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-03 20:49:33,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:49:33,947 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:49:33,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:49:33,947 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:49:33,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:49:33,948 INFO L85 PathProgramCache]: Analyzing trace with hash -321689034, now seen corresponding path program 1 times [2025-03-03 20:49:33,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:49:33,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156475148] [2025-03-03 20:49:33,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:49:33,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:49:33,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-03 20:49:33,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-03 20:49:33,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:49:33,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:49:34,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-03 20:49:34,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:49:34,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156475148] [2025-03-03 20:49:34,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156475148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:49:34,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:49:34,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:49:34,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326742662] [2025-03-03 20:49:34,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:49:34,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:49:34,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:49:34,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:49:34,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:49:34,095 INFO L87 Difference]: Start difference. First operand 663 states and 1004 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-03 20:49:34,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:49:34,189 INFO L93 Difference]: Finished difference Result 1414 states and 2136 transitions. [2025-03-03 20:49:34,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:49:34,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 264 [2025-03-03 20:49:34,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:49:34,194 INFO L225 Difference]: With dead ends: 1414 [2025-03-03 20:49:34,195 INFO L226 Difference]: Without dead ends: 884 [2025-03-03 20:49:34,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:49:34,197 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 84 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:49:34,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 726 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:49:34,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2025-03-03 20:49:34,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 864. [2025-03-03 20:49:34,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 666 states have (on average 1.4039039039039038) internal successors, (935), 669 states have internal predecessors, (935), 180 states have call successors, (180), 17 states have call predecessors, (180), 17 states have return successors, (180), 177 states have call predecessors, (180), 180 states have call successors, (180) [2025-03-03 20:49:34,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1295 transitions. [2025-03-03 20:49:34,237 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1295 transitions. Word has length 264 [2025-03-03 20:49:34,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:49:34,238 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1295 transitions. [2025-03-03 20:49:34,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-03 20:49:34,238 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1295 transitions. [2025-03-03 20:49:34,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-03 20:49:34,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:49:34,240 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:49:34,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:49:34,240 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:49:34,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:49:34,241 INFO L85 PathProgramCache]: Analyzing trace with hash -736451723, now seen corresponding path program 1 times [2025-03-03 20:49:34,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:49:34,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102838485] [2025-03-03 20:49:34,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:49:34,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:49:34,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-03 20:49:34,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-03 20:49:34,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:49:34,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat