./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal45.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal45.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7ffa7211fa1cbf66ca75ab73473062c0fcd7b10c25684a139cdd65fcb3c9a5dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:53:35,420 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:53:35,470 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 06:53:35,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:53:35,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:53:35,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:53:35,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:53:35,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:53:35,509 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:53:35,509 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:53:35,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:53:35,509 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:53:35,510 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:53:35,510 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:53:35,510 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:53:35,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:53:35,510 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:53:35,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:53:35,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:53:35,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:53:35,510 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:53:35,510 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:53:35,510 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:53:35,510 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:53:35,510 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:53:35,510 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:53:35,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:53:35,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:53:35,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:53:35,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:53:35,511 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:53:35,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:53:35,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:53:35,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:53:35,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:53:35,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:53:35,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:53:35,511 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:53:35,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:53:35,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:53:35,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:53:35,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:53:35,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:53:35,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:53:35,511 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:53:35,512 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7ffa7211fa1cbf66ca75ab73473062c0fcd7b10c25684a139cdd65fcb3c9a5dd [2025-01-09 06:53:35,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:53:35,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:53:35,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:53:35,876 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:53:35,876 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:53:35,878 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal45.c [2025-01-09 06:53:37,111 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e46017908/12966cb0595d4215a772e3ebf91fdda0/FLAG75a375bdf [2025-01-09 06:53:37,791 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:53:37,792 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal45.c [2025-01-09 06:53:37,839 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e46017908/12966cb0595d4215a772e3ebf91fdda0/FLAG75a375bdf [2025-01-09 06:53:38,189 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e46017908/12966cb0595d4215a772e3ebf91fdda0 [2025-01-09 06:53:38,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:53:38,192 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:53:38,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:53:38,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:53:38,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:53:38,196 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:53:38" (1/1) ... [2025-01-09 06:53:38,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7696888c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:38, skipping insertion in model container [2025-01-09 06:53:38,197 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:53:38" (1/1) ... [2025-01-09 06:53:38,301 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:53:38,529 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal45.c[1245,1258] [2025-01-09 06:53:39,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:53:39,499 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:53:39,507 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal45.c[1245,1258] [2025-01-09 06:53:40,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:53:40,099 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:53:40,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:40 WrapperNode [2025-01-09 06:53:40,101 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:53:40,102 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:53:40,102 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:53:40,102 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:53:40,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:40" (1/1) ... [2025-01-09 06:53:40,391 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:40" (1/1) ... [2025-01-09 06:53:42,994 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 36437 [2025-01-09 06:53:42,995 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:53:42,996 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:53:42,996 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:53:42,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:53:43,004 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:40" (1/1) ... [2025-01-09 06:53:43,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:40" (1/1) ... [2025-01-09 06:53:43,743 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:40" (1/1) ... [2025-01-09 06:53:44,250 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-01-09 06:53:44,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:40" (1/1) ... [2025-01-09 06:53:44,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:40" (1/1) ... [2025-01-09 06:53:45,229 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:40" (1/1) ... [2025-01-09 06:53:45,362 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:40" (1/1) ... [2025-01-09 06:53:45,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:40" (1/1) ... [2025-01-09 06:53:45,711 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:40" (1/1) ... [2025-01-09 06:53:45,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:40" (1/1) ... [2025-01-09 06:53:46,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:53:46,356 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:53:46,356 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:53:46,356 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:53:46,357 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:40" (1/1) ... [2025-01-09 06:53:46,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:53:46,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:53:46,381 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 06:53:46,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 06:53:46,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:53:46,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:53:46,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 06:53:46,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:53:46,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:53:47,662 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:53:47,664 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:54:46,413 INFO L? ?]: Removed 20150 outVars from TransFormulas that were not future-live. [2025-01-09 06:54:46,413 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:54:46,519 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:54:46,519 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 06:54:46,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:54:46 BoogieIcfgContainer [2025-01-09 06:54:46,520 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:54:46,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:54:46,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:54:46,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:54:46,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:53:38" (1/3) ... [2025-01-09 06:54:46,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e747095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:54:46, skipping insertion in model container [2025-01-09 06:54:46,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:40" (2/3) ... [2025-01-09 06:54:46,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e747095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:54:46, skipping insertion in model container [2025-01-09 06:54:46,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:54:46" (3/3) ... [2025-01-09 06:54:46,527 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal45.c [2025-01-09 06:54:46,536 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:54:46,538 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal45.c that has 1 procedures, 12490 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 06:54:46,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:54:46,736 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;@6257c821, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:54:46,736 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 06:54:46,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 12490 states, 12488 states have (on average 1.5004003843689941) internal successors, (18737), 12489 states have internal predecessors, (18737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:54:46,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-09 06:54:46,778 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:54:46,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:54:46,779 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:54:46,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:54:46,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1142786268, now seen corresponding path program 1 times [2025-01-09 06:54:46,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:54:46,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371002177] [2025-01-09 06:54:46,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:54:46,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:54:46,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 06:54:47,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 06:54:47,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:54:47,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:54:47,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:54:47,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:54:47,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371002177] [2025-01-09 06:54:47,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371002177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:54:47,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:54:47,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:54:47,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795515170] [2025-01-09 06:54:47,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:54:47,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:54:47,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:54:48,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:54:48,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:54:48,032 INFO L87 Difference]: Start difference. First operand has 12490 states, 12488 states have (on average 1.5004003843689941) internal successors, (18737), 12489 states have internal predecessors, (18737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:54:48,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:54:48,460 INFO L93 Difference]: Finished difference Result 24829 states and 37251 transitions. [2025-01-09 06:54:48,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:54:48,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 191 [2025-01-09 06:54:48,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:54:48,562 INFO L225 Difference]: With dead ends: 24829 [2025-01-09 06:54:48,562 INFO L226 Difference]: Without dead ends: 12489 [2025-01-09 06:54:48,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:54:48,588 INFO L435 NwaCegarLoop]: 18731 mSDtfsCounter, 0 mSDsluCounter, 37456 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56187 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:54:48,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56187 Invalid, 11 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:54:48,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12489 states. [2025-01-09 06:54:48,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12489 to 12489. [2025-01-09 06:54:48,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12489 states, 12488 states have (on average 1.5002402306213964) internal successors, (18735), 12488 states have internal predecessors, (18735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:54:48,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12489 states to 12489 states and 18735 transitions. [2025-01-09 06:54:48,964 INFO L78 Accepts]: Start accepts. Automaton has 12489 states and 18735 transitions. Word has length 191 [2025-01-09 06:54:48,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:54:48,966 INFO L471 AbstractCegarLoop]: Abstraction has 12489 states and 18735 transitions. [2025-01-09 06:54:48,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:54:48,967 INFO L276 IsEmpty]: Start isEmpty. Operand 12489 states and 18735 transitions. [2025-01-09 06:54:48,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-09 06:54:48,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:54:48,973 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:54:48,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:54:48,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:54:48,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:54:48,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1064939578, now seen corresponding path program 1 times [2025-01-09 06:54:48,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:54:48,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295040171] [2025-01-09 06:54:48,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:54:48,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:54:49,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-09 06:54:49,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-09 06:54:49,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:54:49,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:54:49,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:54:49,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:54:49,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295040171] [2025-01-09 06:54:49,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295040171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:54:49,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:54:49,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:54:49,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844511659] [2025-01-09 06:54:49,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:54:49,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:54:49,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:54:49,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:54:49,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:54:49,613 INFO L87 Difference]: Start difference. First operand 12489 states and 18735 transitions. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:54:49,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:54:49,950 INFO L93 Difference]: Finished difference Result 24830 states and 37249 transitions. [2025-01-09 06:54:49,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:54:49,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 192 [2025-01-09 06:54:49,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:54:49,997 INFO L225 Difference]: With dead ends: 24830 [2025-01-09 06:54:49,997 INFO L226 Difference]: Without dead ends: 12491 [2025-01-09 06:54:50,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:54:50,015 INFO L435 NwaCegarLoop]: 18731 mSDtfsCounter, 0 mSDsluCounter, 37452 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56183 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:54:50,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56183 Invalid, 15 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:54:50,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12491 states. [2025-01-09 06:54:50,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12491 to 12491. [2025-01-09 06:54:50,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12491 states, 12490 states have (on average 1.500160128102482) internal successors, (18737), 12490 states have internal predecessors, (18737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:54:50,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12491 states to 12491 states and 18737 transitions. [2025-01-09 06:54:50,501 INFO L78 Accepts]: Start accepts. Automaton has 12491 states and 18737 transitions. Word has length 192 [2025-01-09 06:54:50,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:54:50,502 INFO L471 AbstractCegarLoop]: Abstraction has 12491 states and 18737 transitions. [2025-01-09 06:54:50,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:54:50,502 INFO L276 IsEmpty]: Start isEmpty. Operand 12491 states and 18737 transitions. [2025-01-09 06:54:50,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-09 06:54:50,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:54:50,504 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:54:50,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:54:50,504 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:54:50,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:54:50,505 INFO L85 PathProgramCache]: Analyzing trace with hash 248646717, now seen corresponding path program 1 times [2025-01-09 06:54:50,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:54:50,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112446052] [2025-01-09 06:54:50,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:54:50,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:54:50,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 06:54:50,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 06:54:50,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:54:50,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:54:51,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:54:51,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:54:51,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112446052] [2025-01-09 06:54:51,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112446052] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:54:51,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:54:51,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:54:51,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764083297] [2025-01-09 06:54:51,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:54:51,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:54:51,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:54:51,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:54:51,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:54:51,446 INFO L87 Difference]: Start difference. First operand 12491 states and 18737 transitions. Second operand has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:54:51,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:54:51,709 INFO L93 Difference]: Finished difference Result 24832 states and 37250 transitions. [2025-01-09 06:54:51,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:54:51,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 193 [2025-01-09 06:54:51,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:54:51,729 INFO L225 Difference]: With dead ends: 24832 [2025-01-09 06:54:51,729 INFO L226 Difference]: Without dead ends: 12491 [2025-01-09 06:54:51,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:54:51,747 INFO L435 NwaCegarLoop]: 18727 mSDtfsCounter, 113 mSDsluCounter, 37340 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 56067 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:54:51,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 56067 Invalid, 13 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:54:51,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12491 states. [2025-01-09 06:54:51,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12491 to 12491. [2025-01-09 06:54:51,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12491 states, 12490 states have (on average 1.500080064051241) internal successors, (18736), 12490 states have internal predecessors, (18736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:54:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12491 states to 12491 states and 18736 transitions. [2025-01-09 06:54:51,992 INFO L78 Accepts]: Start accepts. Automaton has 12491 states and 18736 transitions. Word has length 193 [2025-01-09 06:54:51,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:54:51,993 INFO L471 AbstractCegarLoop]: Abstraction has 12491 states and 18736 transitions. [2025-01-09 06:54:51,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:54:51,993 INFO L276 IsEmpty]: Start isEmpty. Operand 12491 states and 18736 transitions. [2025-01-09 06:54:51,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-09 06:54:51,994 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:54:51,994 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:54:51,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:54:51,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:54:51,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:54:51,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1680112783, now seen corresponding path program 1 times [2025-01-09 06:54:51,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:54:51,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394786383] [2025-01-09 06:54:51,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:54:51,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:54:52,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-09 06:54:52,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-09 06:54:52,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:54:52,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:54:52,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:54:52,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:54:52,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394786383] [2025-01-09 06:54:52,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394786383] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:54:52,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:54:52,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:54:52,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560666379] [2025-01-09 06:54:52,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:54:52,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:54:52,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:54:52,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:54:52,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:54:52,513 INFO L87 Difference]: Start difference. First operand 12491 states and 18736 transitions. Second operand has 4 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:54:53,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:54:53,594 INFO L93 Difference]: Finished difference Result 36931 states and 55399 transitions. [2025-01-09 06:54:53,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:54:53,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2025-01-09 06:54:53,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:54:53,613 INFO L225 Difference]: With dead ends: 36931 [2025-01-09 06:54:53,614 INFO L226 Difference]: Without dead ends: 12491 [2025-01-09 06:54:53,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:54:53,640 INFO L435 NwaCegarLoop]: 18714 mSDtfsCounter, 17968 mSDsluCounter, 36796 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17968 SdHoareTripleChecker+Valid, 55510 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 06:54:53,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17968 Valid, 55510 Invalid, 1011 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [118 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 06:54:53,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12491 states. [2025-01-09 06:54:53,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12491 to 12491. [2025-01-09 06:54:53,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12491 states, 12490 states have (on average 1.5) internal successors, (18735), 12490 states have internal predecessors, (18735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:54:53,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12491 states to 12491 states and 18735 transitions. [2025-01-09 06:54:53,839 INFO L78 Accepts]: Start accepts. Automaton has 12491 states and 18735 transitions. Word has length 194 [2025-01-09 06:54:53,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:54:53,840 INFO L471 AbstractCegarLoop]: Abstraction has 12491 states and 18735 transitions. [2025-01-09 06:54:53,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:54:53,840 INFO L276 IsEmpty]: Start isEmpty. Operand 12491 states and 18735 transitions. [2025-01-09 06:54:53,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-09 06:54:53,841 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:54:53,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:54:53,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:54:53,842 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:54:53,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:54:53,842 INFO L85 PathProgramCache]: Analyzing trace with hash 305958358, now seen corresponding path program 1 times [2025-01-09 06:54:53,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:54:53,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155052562] [2025-01-09 06:54:53,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:54:53,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:54:53,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 06:54:53,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 06:54:53,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:54:53,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:54:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:54:54,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:54:54,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155052562] [2025-01-09 06:54:54,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155052562] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:54:54,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:54:54,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:54:54,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740990302] [2025-01-09 06:54:54,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:54:54,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:54:54,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:54:54,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:54:54,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:54:54,428 INFO L87 Difference]: Start difference. First operand 12491 states and 18735 transitions. Second operand has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:54:55,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:54:55,853 INFO L93 Difference]: Finished difference Result 24836 states and 37251 transitions. [2025-01-09 06:54:55,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:54:55,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2025-01-09 06:54:55,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:54:55,871 INFO L225 Difference]: With dead ends: 24836 [2025-01-09 06:54:55,871 INFO L226 Difference]: Without dead ends: 12495 [2025-01-09 06:54:55,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:54:55,884 INFO L435 NwaCegarLoop]: 18083 mSDtfsCounter, 18729 mSDsluCounter, 36162 mSDsCounter, 0 mSdLazyCounter, 1947 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18729 SdHoareTripleChecker+Valid, 54245 SdHoareTripleChecker+Invalid, 1948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:54:55,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18729 Valid, 54245 Invalid, 1948 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 1947 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 06:54:55,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12495 states. [2025-01-09 06:54:56,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12495 to 12494. [2025-01-09 06:54:56,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12494 states, 12493 states have (on average 1.4998799327623469) internal successors, (18738), 12493 states have internal predecessors, (18738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:54:56,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12494 states to 12494 states and 18738 transitions. [2025-01-09 06:54:56,045 INFO L78 Accepts]: Start accepts. Automaton has 12494 states and 18738 transitions. Word has length 195 [2025-01-09 06:54:56,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:54:56,045 INFO L471 AbstractCegarLoop]: Abstraction has 12494 states and 18738 transitions. [2025-01-09 06:54:56,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:54:56,046 INFO L276 IsEmpty]: Start isEmpty. Operand 12494 states and 18738 transitions. [2025-01-09 06:54:56,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 06:54:56,049 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:54:56,050 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:54:56,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:54:56,050 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:54:56,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:54:56,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1146080597, now seen corresponding path program 1 times [2025-01-09 06:54:56,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:54:56,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284283472] [2025-01-09 06:54:56,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:54:56,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:54:56,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 06:54:56,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 06:54:56,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:54:56,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:54:56,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:54:56,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:54:56,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284283472] [2025-01-09 06:54:56,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284283472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:54:56,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:54:56,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:54:56,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858165959] [2025-01-09 06:54:56,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:54:56,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:54:56,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:54:56,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:54:56,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:54:56,706 INFO L87 Difference]: Start difference. First operand 12494 states and 18738 transitions. Second operand has 5 states, 5 states have (on average 39.2) internal successors, (196), 5 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:54:56,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:54:56,864 INFO L93 Difference]: Finished difference Result 24841 states and 37257 transitions. [2025-01-09 06:54:56,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:54:56,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.2) internal successors, (196), 5 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 196 [2025-01-09 06:54:56,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:54:56,882 INFO L225 Difference]: With dead ends: 24841 [2025-01-09 06:54:56,882 INFO L226 Difference]: Without dead ends: 12497 [2025-01-09 06:54:56,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:54:56,894 INFO L435 NwaCegarLoop]: 18728 mSDtfsCounter, 60 mSDsluCounter, 37445 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 56173 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:54:56,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 56173 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:54:56,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12497 states. [2025-01-09 06:54:56,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12497 to 12497. [2025-01-09 06:54:57,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12497 states, 12496 states have (on average 1.4997599231754162) internal successors, (18741), 12496 states have internal predecessors, (18741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:54:57,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12497 states to 12497 states and 18741 transitions. [2025-01-09 06:54:57,023 INFO L78 Accepts]: Start accepts. Automaton has 12497 states and 18741 transitions. Word has length 196 [2025-01-09 06:54:57,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:54:57,023 INFO L471 AbstractCegarLoop]: Abstraction has 12497 states and 18741 transitions. [2025-01-09 06:54:57,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.2) internal successors, (196), 5 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:54:57,024 INFO L276 IsEmpty]: Start isEmpty. Operand 12497 states and 18741 transitions. [2025-01-09 06:54:57,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 06:54:57,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:54:57,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:54:57,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:54:57,026 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:54:57,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:54:57,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2001967071, now seen corresponding path program 1 times [2025-01-09 06:54:57,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:54:57,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616786997] [2025-01-09 06:54:57,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:54:57,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:54:57,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 06:54:57,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 06:54:57,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:54:57,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:54:57,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:54:57,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:54:57,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616786997] [2025-01-09 06:54:57,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616786997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:54:57,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:54:57,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:54:57,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944815757] [2025-01-09 06:54:57,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:54:57,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:54:57,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:54:57,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:54:57,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:54:57,881 INFO L87 Difference]: Start difference. First operand 12497 states and 18741 transitions. Second operand has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 7 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)