./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.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.vcegar_QF_BV_pj_icu_icctl_p1.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 c8208b6c8f4a2ac058115c356d3ca9113d648f4f67e8abc6f1ec7c44bb7ab63f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:17:09,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:17:09,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 08:17:09,292 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:17:09,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:17:09,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:17:09,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:17:09,308 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:17:09,308 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:17:09,308 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:17:09,308 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:17:09,308 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:17:09,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:17:09,309 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:17:09,309 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:17:09,309 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:17:09,309 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:17:09,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:17:09,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:17:09,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:17:09,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:17:09,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:17:09,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:17:09,310 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:17:09,310 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:17:09,310 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:17:09,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:17:09,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:17:09,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:17:09,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:17:09,310 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:17:09,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:17:09,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:17:09,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:17:09,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:17:09,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:17:09,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:17:09,311 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:17:09,311 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:17:09,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:17:09,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:17:09,311 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:17:09,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:17:09,311 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:17:09,311 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:17:09,311 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 -> c8208b6c8f4a2ac058115c356d3ca9113d648f4f67e8abc6f1ec7c44bb7ab63f [2025-01-09 08:17:09,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:17:09,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:17:09,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:17:09,532 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:17:09,532 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:17:09,534 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.vcegar_QF_BV_pj_icu_icctl_p1.c [2025-01-09 08:17:10,699 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f49b14734/c7e05da06cfc4ff5866e48173241761a/FLAGe1f33f6d2 [2025-01-09 08:17:11,060 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:17:11,061 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2025-01-09 08:17:11,083 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f49b14734/c7e05da06cfc4ff5866e48173241761a/FLAGe1f33f6d2 [2025-01-09 08:17:11,270 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f49b14734/c7e05da06cfc4ff5866e48173241761a [2025-01-09 08:17:11,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:17:11,273 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:17:11,274 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:17:11,274 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:17:11,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:17:11,277 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:17:11" (1/1) ... [2025-01-09 08:17:11,278 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e951e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:11, skipping insertion in model container [2025-01-09 08:17:11,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:17:11" (1/1) ... [2025-01-09 08:17:11,329 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:17:11,504 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.vcegar_QF_BV_pj_icu_icctl_p1.c[1268,1281] [2025-01-09 08:17:11,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:17:11,871 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:17:11,880 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.vcegar_QF_BV_pj_icu_icctl_p1.c[1268,1281] [2025-01-09 08:17:12,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:17:12,133 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:17:12,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:12 WrapperNode [2025-01-09 08:17:12,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:17:12,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:17:12,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:17:12,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:17:12,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:12" (1/1) ... [2025-01-09 08:17:12,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:12" (1/1) ... [2025-01-09 08:17:12,882 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4824 [2025-01-09 08:17:12,882 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:17:12,883 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:17:12,883 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:17:12,883 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:17:12,891 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:12" (1/1) ... [2025-01-09 08:17:12,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:12" (1/1) ... [2025-01-09 08:17:12,956 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:12" (1/1) ... [2025-01-09 08:17:13,102 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 08:17:13,103 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:12" (1/1) ... [2025-01-09 08:17:13,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:12" (1/1) ... [2025-01-09 08:17:13,188 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:12" (1/1) ... [2025-01-09 08:17:13,202 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:12" (1/1) ... [2025-01-09 08:17:13,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:12" (1/1) ... [2025-01-09 08:17:13,262 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:12" (1/1) ... [2025-01-09 08:17:13,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:12" (1/1) ... [2025-01-09 08:17:13,355 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:17:13,357 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:17:13,357 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:17:13,357 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:17:13,358 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:12" (1/1) ... [2025-01-09 08:17:13,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:17:13,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:17:13,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 08:17:13,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 08:17:13,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:17:13,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:17:13,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:17:13,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:17:13,876 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:17:13,878 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:17:17,390 INFO L? ?]: Removed 3123 outVars from TransFormulas that were not future-live. [2025-01-09 08:17:17,390 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:17:17,428 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:17:17,428 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:17:17,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:17:17 BoogieIcfgContainer [2025-01-09 08:17:17,431 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:17:17,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:17:17,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:17:17,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:17:17,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:17:11" (1/3) ... [2025-01-09 08:17:17,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690926b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:17:17, skipping insertion in model container [2025-01-09 08:17:17,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:12" (2/3) ... [2025-01-09 08:17:17,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690926b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:17:17, skipping insertion in model container [2025-01-09 08:17:17,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:17:17" (3/3) ... [2025-01-09 08:17:17,439 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2025-01-09 08:17:17,449 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:17:17,451 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c that has 1 procedures, 1114 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:17:17,506 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:17:17,514 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;@446b6d6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:17:17,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:17:17,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 1114 states, 1112 states have (on average 1.4991007194244603) internal successors, (1667), 1113 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:17,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 08:17:17,526 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:17,526 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] [2025-01-09 08:17:17,527 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:17,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:17,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1553873824, now seen corresponding path program 1 times [2025-01-09 08:17:17,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:17,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970197722] [2025-01-09 08:17:17,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:17,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:17,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 08:17:17,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 08:17:17,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:17,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:18,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:18,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:18,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970197722] [2025-01-09 08:17:18,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970197722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:18,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:18,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:17:18,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039636425] [2025-01-09 08:17:18,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:18,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:17:18,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:18,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:17:18,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:17:18,343 INFO L87 Difference]: Start difference. First operand has 1114 states, 1112 states have (on average 1.4991007194244603) internal successors, (1667), 1113 states have internal predecessors, (1667), 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 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:18,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:18,465 INFO L93 Difference]: Finished difference Result 2109 states and 3159 transitions. [2025-01-09 08:17:18,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:17:18,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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 83 [2025-01-09 08:17:18,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:18,481 INFO L225 Difference]: With dead ends: 2109 [2025-01-09 08:17:18,481 INFO L226 Difference]: Without dead ends: 1113 [2025-01-09 08:17:18,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:17:18,486 INFO L435 NwaCegarLoop]: 1661 mSDtfsCounter, 0 mSDsluCounter, 3316 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4977 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:18,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4977 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:17:18,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2025-01-09 08:17:18,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2025-01-09 08:17:18,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 1112 states have (on average 1.4973021582733812) internal successors, (1665), 1112 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:18,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1665 transitions. [2025-01-09 08:17:18,560 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1665 transitions. Word has length 83 [2025-01-09 08:17:18,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:18,560 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1665 transitions. [2025-01-09 08:17:18,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:18,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1665 transitions. [2025-01-09 08:17:18,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 08:17:18,566 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:18,566 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] [2025-01-09 08:17:18,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 08:17:18,567 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:18,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:18,567 INFO L85 PathProgramCache]: Analyzing trace with hash 927143948, now seen corresponding path program 1 times [2025-01-09 08:17:18,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:18,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298188689] [2025-01-09 08:17:18,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:18,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:18,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 08:17:18,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 08:17:18,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:18,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:18,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:18,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:18,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298188689] [2025-01-09 08:17:18,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298188689] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:18,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:18,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:17:18,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426045351] [2025-01-09 08:17:18,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:18,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:17:18,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:18,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:17:18,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:17:18,816 INFO L87 Difference]: Start difference. First operand 1113 states and 1665 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:18,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:18,872 INFO L93 Difference]: Finished difference Result 2110 states and 3157 transitions. [2025-01-09 08:17:18,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:17:18,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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 84 [2025-01-09 08:17:18,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:18,878 INFO L225 Difference]: With dead ends: 2110 [2025-01-09 08:17:18,878 INFO L226 Difference]: Without dead ends: 1115 [2025-01-09 08:17:18,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:17:18,880 INFO L435 NwaCegarLoop]: 1661 mSDtfsCounter, 0 mSDsluCounter, 3312 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4973 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:18,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4973 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:17:18,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-01-09 08:17:18,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2025-01-09 08:17:18,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.4964093357271095) internal successors, (1667), 1114 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:18,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1667 transitions. [2025-01-09 08:17:18,965 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1667 transitions. Word has length 84 [2025-01-09 08:17:18,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:18,966 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1667 transitions. [2025-01-09 08:17:18,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:18,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1667 transitions. [2025-01-09 08:17:18,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 08:17:18,967 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:18,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:17:18,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:17:18,967 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:18,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:18,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1873693177, now seen corresponding path program 1 times [2025-01-09 08:17:18,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:18,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116252391] [2025-01-09 08:17:18,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:18,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:19,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 08:17:19,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 08:17:19,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:19,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:19,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:19,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:19,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116252391] [2025-01-09 08:17:19,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116252391] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:19,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:19,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:17:19,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109464124] [2025-01-09 08:17:19,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:19,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:17:19,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:19,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:17:19,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:17:19,414 INFO L87 Difference]: Start difference. First operand 1115 states and 1667 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:19,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:19,496 INFO L93 Difference]: Finished difference Result 2116 states and 3164 transitions. [2025-01-09 08:17:19,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:17:19,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-01-09 08:17:19,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:19,500 INFO L225 Difference]: With dead ends: 2116 [2025-01-09 08:17:19,500 INFO L226 Difference]: Without dead ends: 1119 [2025-01-09 08:17:19,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:17:19,502 INFO L435 NwaCegarLoop]: 1653 mSDtfsCounter, 1594 mSDsluCounter, 4950 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1594 SdHoareTripleChecker+Valid, 6603 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:19,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1594 Valid, 6603 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:17:19,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2025-01-09 08:17:19,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1118. [2025-01-09 08:17:19,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 1117 states have (on average 1.495076096687556) internal successors, (1670), 1117 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:19,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1670 transitions. [2025-01-09 08:17:19,520 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1670 transitions. Word has length 85 [2025-01-09 08:17:19,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:19,520 INFO L471 AbstractCegarLoop]: Abstraction has 1118 states and 1670 transitions. [2025-01-09 08:17:19,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:19,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1670 transitions. [2025-01-09 08:17:19,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 08:17:19,523 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:19,523 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:17:19,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:17:19,523 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:19,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:19,523 INFO L85 PathProgramCache]: Analyzing trace with hash -480508049, now seen corresponding path program 1 times [2025-01-09 08:17:19,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:19,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313728738] [2025-01-09 08:17:19,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:19,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:19,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 08:17:19,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 08:17:19,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:19,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:20,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:20,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313728738] [2025-01-09 08:17:20,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313728738] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:20,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:20,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:17:20,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715293111] [2025-01-09 08:17:20,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:20,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:17:20,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:20,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:17:20,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:17:20,233 INFO L87 Difference]: Start difference. First operand 1118 states and 1670 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:20,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:20,355 INFO L93 Difference]: Finished difference Result 2147 states and 3207 transitions. [2025-01-09 08:17:20,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:17:20,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-01-09 08:17:20,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:20,360 INFO L225 Difference]: With dead ends: 2147 [2025-01-09 08:17:20,360 INFO L226 Difference]: Without dead ends: 1147 [2025-01-09 08:17:20,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:17:20,362 INFO L435 NwaCegarLoop]: 1643 mSDtfsCounter, 1684 mSDsluCounter, 3285 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1684 SdHoareTripleChecker+Valid, 4928 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:20,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1684 Valid, 4928 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:17:20,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2025-01-09 08:17:20,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1124. [2025-01-09 08:17:20,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 1123 states have (on average 1.4942119323241319) internal successors, (1678), 1123 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:20,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1678 transitions. [2025-01-09 08:17:20,408 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1678 transitions. Word has length 86 [2025-01-09 08:17:20,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:20,408 INFO L471 AbstractCegarLoop]: Abstraction has 1124 states and 1678 transitions. [2025-01-09 08:17:20,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1678 transitions. [2025-01-09 08:17:20,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 08:17:20,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:20,409 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:17:20,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 08:17:20,409 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:20,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:20,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1016363339, now seen corresponding path program 1 times [2025-01-09 08:17:20,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:20,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638233986] [2025-01-09 08:17:20,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:20,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:20,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 08:17:20,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 08:17:20,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:20,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:21,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:21,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:21,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638233986] [2025-01-09 08:17:21,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638233986] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:21,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:21,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 08:17:21,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348521644] [2025-01-09 08:17:21,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:21,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:17:21,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:21,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:17:21,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:17:21,278 INFO L87 Difference]: Start difference. First operand 1124 states and 1678 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:21,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:21,574 INFO L93 Difference]: Finished difference Result 2151 states and 3212 transitions. [2025-01-09 08:17:21,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:17:21,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-01-09 08:17:21,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:21,580 INFO L225 Difference]: With dead ends: 2151 [2025-01-09 08:17:21,580 INFO L226 Difference]: Without dead ends: 1151 [2025-01-09 08:17:21,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-09 08:17:21,582 INFO L435 NwaCegarLoop]: 1640 mSDtfsCounter, 1694 mSDsluCounter, 4975 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1694 SdHoareTripleChecker+Valid, 6615 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:21,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1694 Valid, 6615 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:17:21,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2025-01-09 08:17:21,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1127. [2025-01-09 08:17:21,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 1126 states have (on average 1.4937833037300177) internal successors, (1682), 1126 states have internal predecessors, (1682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:21,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1682 transitions. [2025-01-09 08:17:21,604 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1682 transitions. Word has length 87 [2025-01-09 08:17:21,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:21,604 INFO L471 AbstractCegarLoop]: Abstraction has 1127 states and 1682 transitions. [2025-01-09 08:17:21,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:21,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1682 transitions. [2025-01-09 08:17:21,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 08:17:21,605 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:21,605 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:17:21,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 08:17:21,605 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:21,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:21,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1694012438, now seen corresponding path program 1 times [2025-01-09 08:17:21,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:21,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519880032] [2025-01-09 08:17:21,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:21,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:21,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 08:17:21,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 08:17:21,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:21,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:22,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:22,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:22,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519880032] [2025-01-09 08:17:22,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519880032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:22,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:22,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:17:22,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649801381] [2025-01-09 08:17:22,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:22,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:17:22,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:22,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:17:22,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:17:22,069 INFO L87 Difference]: Start difference. First operand 1127 states and 1682 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:22,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:22,251 INFO L93 Difference]: Finished difference Result 2153 states and 3214 transitions. [2025-01-09 08:17:22,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:17:22,252 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-01-09 08:17:22,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:22,255 INFO L225 Difference]: With dead ends: 2153 [2025-01-09 08:17:22,255 INFO L226 Difference]: Without dead ends: 1153 [2025-01-09 08:17:22,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:17:22,257 INFO L435 NwaCegarLoop]: 1640 mSDtfsCounter, 1692 mSDsluCounter, 4945 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1692 SdHoareTripleChecker+Valid, 6585 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:22,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1692 Valid, 6585 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:17:22,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2025-01-09 08:17:22,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1133. [2025-01-09 08:17:22,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1132 states have (on average 1.4929328621908127) internal successors, (1690), 1132 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:22,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1690 transitions. [2025-01-09 08:17:22,276 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1690 transitions. Word has length 88 [2025-01-09 08:17:22,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:22,277 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1690 transitions. [2025-01-09 08:17:22,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:22,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1690 transitions. [2025-01-09 08:17:22,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 08:17:22,278 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:22,278 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:17:22,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 08:17:22,278 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:22,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:22,278 INFO L85 PathProgramCache]: Analyzing trace with hash -385937742, now seen corresponding path program 1 times [2025-01-09 08:17:22,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:22,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905740335] [2025-01-09 08:17:22,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:22,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:22,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 08:17:22,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 08:17:22,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:22,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:22,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:22,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:22,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905740335] [2025-01-09 08:17:22,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905740335] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:22,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:22,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:17:22,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835327690] [2025-01-09 08:17:22,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:22,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:17:22,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:22,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:17:22,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:17:22,598 INFO L87 Difference]: Start difference. First operand 1133 states and 1690 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:22,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:22,711 INFO L93 Difference]: Finished difference Result 2154 states and 3214 transitions. [2025-01-09 08:17:22,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:17:22,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-01-09 08:17:22,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:22,715 INFO L225 Difference]: With dead ends: 2154 [2025-01-09 08:17:22,715 INFO L226 Difference]: Without dead ends: 1148 [2025-01-09 08:17:22,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:17:22,717 INFO L435 NwaCegarLoop]: 1645 mSDtfsCounter, 1679 mSDsluCounter, 3286 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1679 SdHoareTripleChecker+Valid, 4931 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:22,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1679 Valid, 4931 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:17:22,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2025-01-09 08:17:22,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1130. [2025-01-09 08:17:22,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1129 states have (on average 1.4924712134632419) internal successors, (1685), 1129 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1685 transitions. [2025-01-09 08:17:22,733 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1685 transitions. Word has length 88 [2025-01-09 08:17:22,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:22,733 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1685 transitions. [2025-01-09 08:17:22,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1685 transitions. [2025-01-09 08:17:22,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 08:17:22,734 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:22,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:17:22,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 08:17:22,734 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:22,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:22,735 INFO L85 PathProgramCache]: Analyzing trace with hash 92684690, now seen corresponding path program 1 times [2025-01-09 08:17:22,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:22,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818958059] [2025-01-09 08:17:22,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:22,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:22,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 08:17:22,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 08:17:22,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:22,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:23,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:23,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818958059] [2025-01-09 08:17:23,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818958059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:23,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:23,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 08:17:23,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9247435] [2025-01-09 08:17:23,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:23,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 08:17:23,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:23,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 08:17:23,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 08:17:23,520 INFO L87 Difference]: Start difference. First operand 1130 states and 1685 transitions. Second operand has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:23,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:23,905 INFO L93 Difference]: Finished difference Result 2154 states and 3214 transitions. [2025-01-09 08:17:23,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 08:17:23,906 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-01-09 08:17:23,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:23,909 INFO L225 Difference]: With dead ends: 2154 [2025-01-09 08:17:23,910 INFO L226 Difference]: Without dead ends: 1154 [2025-01-09 08:17:23,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2025-01-09 08:17:23,912 INFO L435 NwaCegarLoop]: 1634 mSDtfsCounter, 1692 mSDsluCounter, 11470 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1692 SdHoareTripleChecker+Valid, 13104 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:23,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1692 Valid, 13104 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:17:23,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2025-01-09 08:17:23,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1133. [2025-01-09 08:17:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1132 states have (on average 1.4920494699646643) internal successors, (1689), 1132 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:23,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1689 transitions. [2025-01-09 08:17:23,933 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1689 transitions. Word has length 89 [2025-01-09 08:17:23,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:23,933 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1689 transitions. [2025-01-09 08:17:23,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:23,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1689 transitions. [2025-01-09 08:17:23,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 08:17:23,934 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:23,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:17:23,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 08:17:23,934 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:23,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:23,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1860350766, now seen corresponding path program 1 times [2025-01-09 08:17:23,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:23,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376029962] [2025-01-09 08:17:23,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:23,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:23,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 08:17:23,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 08:17:23,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:23,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:24,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:24,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:24,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376029962] [2025-01-09 08:17:24,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376029962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:24,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:24,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:17:24,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262955672] [2025-01-09 08:17:24,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:24,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:17:24,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:24,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:17:24,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:17:24,217 INFO L87 Difference]: Start difference. First operand 1133 states and 1689 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:24,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:24,324 INFO L93 Difference]: Finished difference Result 2147 states and 3203 transitions. [2025-01-09 08:17:24,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:17:24,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-01-09 08:17:24,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:24,327 INFO L225 Difference]: With dead ends: 2147 [2025-01-09 08:17:24,327 INFO L226 Difference]: Without dead ends: 1147 [2025-01-09 08:17:24,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:17:24,329 INFO L435 NwaCegarLoop]: 1645 mSDtfsCounter, 1670 mSDsluCounter, 3286 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1670 SdHoareTripleChecker+Valid, 4931 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:24,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1670 Valid, 4931 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:17:24,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2025-01-09 08:17:24,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1133. [2025-01-09 08:17:24,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1132 states have (on average 1.4911660777385158) internal successors, (1688), 1132 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:24,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1688 transitions. [2025-01-09 08:17:24,346 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1688 transitions. Word has length 89 [2025-01-09 08:17:24,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:24,346 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1688 transitions. [2025-01-09 08:17:24,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:24,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1688 transitions. [2025-01-09 08:17:24,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 08:17:24,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:24,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:17:24,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 08:17:24,349 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:24,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:24,351 INFO L85 PathProgramCache]: Analyzing trace with hash -542283559, now seen corresponding path program 1 times [2025-01-09 08:17:24,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:24,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369908435] [2025-01-09 08:17:24,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:24,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:24,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 08:17:24,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 08:17:24,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:24,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:24,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:24,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:24,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369908435] [2025-01-09 08:17:24,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369908435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:24,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:24,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:17:24,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732584157] [2025-01-09 08:17:24,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:24,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:17:24,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:24,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:17:24,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:17:24,578 INFO L87 Difference]: Start difference. First operand 1133 states and 1688 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:24,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:24,689 INFO L93 Difference]: Finished difference Result 2144 states and 3198 transitions. [2025-01-09 08:17:24,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:17:24,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 08:17:24,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:24,694 INFO L225 Difference]: With dead ends: 2144 [2025-01-09 08:17:24,694 INFO L226 Difference]: Without dead ends: 1144 [2025-01-09 08:17:24,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:17:24,696 INFO L435 NwaCegarLoop]: 1644 mSDtfsCounter, 1661 mSDsluCounter, 3284 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1661 SdHoareTripleChecker+Valid, 4928 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:24,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1661 Valid, 4928 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:17:24,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2025-01-09 08:17:24,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1133. [2025-01-09 08:17:24,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1132 states have (on average 1.4902826855123674) internal successors, (1687), 1132 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:24,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1687 transitions. [2025-01-09 08:17:24,716 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1687 transitions. Word has length 90 [2025-01-09 08:17:24,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:24,716 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1687 transitions. [2025-01-09 08:17:24,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:24,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1687 transitions. [2025-01-09 08:17:24,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 08:17:24,717 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:24,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:17:24,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 08:17:24,717 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:24,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:24,717 INFO L85 PathProgramCache]: Analyzing trace with hash 367607869, now seen corresponding path program 1 times [2025-01-09 08:17:24,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:24,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223055409] [2025-01-09 08:17:24,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:24,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:24,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 08:17:24,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 08:17:24,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:24,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:25,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:25,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:25,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223055409] [2025-01-09 08:17:25,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223055409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:25,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:25,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 08:17:25,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191206316] [2025-01-09 08:17:25,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:25,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 08:17:25,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:25,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 08:17:25,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 08:17:25,295 INFO L87 Difference]: Start difference. First operand 1133 states and 1687 transitions. Second operand has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:25,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:25,642 INFO L93 Difference]: Finished difference Result 2148 states and 3203 transitions. [2025-01-09 08:17:25,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 08:17:25,642 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 08:17:25,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:25,646 INFO L225 Difference]: With dead ends: 2148 [2025-01-09 08:17:25,646 INFO L226 Difference]: Without dead ends: 1148 [2025-01-09 08:17:25,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2025-01-09 08:17:25,647 INFO L435 NwaCegarLoop]: 1633 mSDtfsCounter, 1668 mSDsluCounter, 6610 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1668 SdHoareTripleChecker+Valid, 8243 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:25,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1668 Valid, 8243 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:17:25,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2025-01-09 08:17:25,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1136. [2025-01-09 08:17:25,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 1135 states have (on average 1.4898678414096915) internal successors, (1691), 1135 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1691 transitions. [2025-01-09 08:17:25,662 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1691 transitions. Word has length 90 [2025-01-09 08:17:25,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:25,663 INFO L471 AbstractCegarLoop]: Abstraction has 1136 states and 1691 transitions. [2025-01-09 08:17:25,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1691 transitions. [2025-01-09 08:17:25,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 08:17:25,663 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:25,664 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:17:25,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 08:17:25,664 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:25,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:25,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1161171289, now seen corresponding path program 1 times [2025-01-09 08:17:25,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:25,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090337676] [2025-01-09 08:17:25,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:25,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:25,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 08:17:25,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 08:17:25,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:25,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:25,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:25,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:25,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090337676] [2025-01-09 08:17:25,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090337676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:25,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:25,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:17:25,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343830434] [2025-01-09 08:17:25,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:25,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:17:25,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:25,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:17:25,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:17:25,960 INFO L87 Difference]: Start difference. First operand 1136 states and 1691 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:26,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:26,125 INFO L93 Difference]: Finished difference Result 2150 states and 3205 transitions. [2025-01-09 08:17:26,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:17:26,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-01-09 08:17:26,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:26,129 INFO L225 Difference]: With dead ends: 2150 [2025-01-09 08:17:26,129 INFO L226 Difference]: Without dead ends: 1150 [2025-01-09 08:17:26,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:17:26,131 INFO L435 NwaCegarLoop]: 1639 mSDtfsCounter, 1665 mSDsluCounter, 4933 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1665 SdHoareTripleChecker+Valid, 6572 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:26,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1665 Valid, 6572 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:17:26,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2025-01-09 08:17:26,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1142. [2025-01-09 08:17:26,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 1141 states have (on average 1.4890446976336547) internal successors, (1699), 1141 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:26,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1699 transitions. [2025-01-09 08:17:26,146 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1699 transitions. Word has length 91 [2025-01-09 08:17:26,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:26,146 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1699 transitions. [2025-01-09 08:17:26,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:26,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1699 transitions. [2025-01-09 08:17:26,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 08:17:26,147 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:26,147 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:17:26,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 08:17:26,148 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:26,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:26,148 INFO L85 PathProgramCache]: Analyzing trace with hash 65253621, now seen corresponding path program 1 times [2025-01-09 08:17:26,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:26,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39195963] [2025-01-09 08:17:26,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:26,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:26,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 08:17:26,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 08:17:26,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:26,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:26,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:26,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39195963] [2025-01-09 08:17:26,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39195963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:26,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:26,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:17:26,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490333937] [2025-01-09 08:17:26,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:26,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:17:26,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:26,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:17:26,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:17:26,397 INFO L87 Difference]: Start difference. First operand 1142 states and 1699 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:26,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:26,497 INFO L93 Difference]: Finished difference Result 2151 states and 3205 transitions. [2025-01-09 08:17:26,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:17:26,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-01-09 08:17:26,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:26,501 INFO L225 Difference]: With dead ends: 2151 [2025-01-09 08:17:26,501 INFO L226 Difference]: Without dead ends: 1145 [2025-01-09 08:17:26,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:17:26,503 INFO L435 NwaCegarLoop]: 1644 mSDtfsCounter, 1652 mSDsluCounter, 3284 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1652 SdHoareTripleChecker+Valid, 4928 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:26,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1652 Valid, 4928 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:17:26,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2025-01-09 08:17:26,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1139. [2025-01-09 08:17:26,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1138 states have (on average 1.4885764499121266) internal successors, (1694), 1138 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:26,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1694 transitions. [2025-01-09 08:17:26,518 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1694 transitions. Word has length 91 [2025-01-09 08:17:26,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:26,519 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1694 transitions. [2025-01-09 08:17:26,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1694 transitions. [2025-01-09 08:17:26,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 08:17:26,519 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:26,519 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:17:26,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 08:17:26,520 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:26,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:26,520 INFO L85 PathProgramCache]: Analyzing trace with hash 260885476, now seen corresponding path program 1 times [2025-01-09 08:17:26,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:26,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186606610] [2025-01-09 08:17:26,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:26,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:26,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 08:17:26,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 08:17:26,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:26,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:26,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:26,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186606610] [2025-01-09 08:17:26,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186606610] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:26,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:26,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:17:26,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435943362] [2025-01-09 08:17:26,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:26,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:17:26,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:26,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:17:26,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:17:26,817 INFO L87 Difference]: Start difference. First operand 1139 states and 1694 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:26,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:26,985 INFO L93 Difference]: Finished difference Result 2148 states and 3201 transitions. [2025-01-09 08:17:26,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:17:26,985 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-01-09 08:17:26,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:26,988 INFO L225 Difference]: With dead ends: 2148 [2025-01-09 08:17:26,988 INFO L226 Difference]: Without dead ends: 1148 [2025-01-09 08:17:26,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:17:26,990 INFO L435 NwaCegarLoop]: 1643 mSDtfsCounter, 1647 mSDsluCounter, 6561 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1647 SdHoareTripleChecker+Valid, 8204 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:26,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1647 Valid, 8204 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:17:26,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2025-01-09 08:17:27,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1146. [2025-01-09 08:17:27,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1145 states have (on average 1.4873362445414846) internal successors, (1703), 1145 states have internal predecessors, (1703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:27,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1703 transitions. [2025-01-09 08:17:27,009 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1703 transitions. Word has length 92 [2025-01-09 08:17:27,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:27,009 INFO L471 AbstractCegarLoop]: Abstraction has 1146 states and 1703 transitions. [2025-01-09 08:17:27,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:27,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1703 transitions. [2025-01-09 08:17:27,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 08:17:27,010 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:27,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:17:27,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 08:17:27,010 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:27,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:27,011 INFO L85 PathProgramCache]: Analyzing trace with hash -394772824, now seen corresponding path program 1 times [2025-01-09 08:17:27,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:27,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347576161] [2025-01-09 08:17:27,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:27,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:27,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 08:17:27,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 08:17:27,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:27,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:27,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:27,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:27,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347576161] [2025-01-09 08:17:27,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347576161] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:27,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:27,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 08:17:27,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474849104] [2025-01-09 08:17:27,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:27,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 08:17:27,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:27,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 08:17:27,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-01-09 08:17:27,661 INFO L87 Difference]: Start difference. First operand 1146 states and 1703 transitions. Second operand has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:28,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:28,134 INFO L93 Difference]: Finished difference Result 2178 states and 3244 transitions. [2025-01-09 08:17:28,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 08:17:28,135 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-01-09 08:17:28,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:28,138 INFO L225 Difference]: With dead ends: 2178 [2025-01-09 08:17:28,138 INFO L226 Difference]: Without dead ends: 1178 [2025-01-09 08:17:28,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-01-09 08:17:28,140 INFO L435 NwaCegarLoop]: 1641 mSDtfsCounter, 1607 mSDsluCounter, 24560 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1607 SdHoareTripleChecker+Valid, 26201 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:28,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1607 Valid, 26201 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 08:17:28,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2025-01-09 08:17:28,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1168. [2025-01-09 08:17:28,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 1167 states have (on average 1.4892887746358183) internal successors, (1738), 1167 states have internal predecessors, (1738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:28,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1738 transitions. [2025-01-09 08:17:28,160 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1738 transitions. Word has length 92 [2025-01-09 08:17:28,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:28,160 INFO L471 AbstractCegarLoop]: Abstraction has 1168 states and 1738 transitions. [2025-01-09 08:17:28,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:28,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1738 transitions. [2025-01-09 08:17:28,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 08:17:28,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:28,161 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:17:28,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 08:17:28,162 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:28,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:28,162 INFO L85 PathProgramCache]: Analyzing trace with hash 219521664, now seen corresponding path program 1 times [2025-01-09 08:17:28,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:28,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651142311] [2025-01-09 08:17:28,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:28,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:28,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 08:17:28,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 08:17:28,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:28,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:28,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:28,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:28,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651142311] [2025-01-09 08:17:28,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651142311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:28,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:28,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:17:28,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107392071] [2025-01-09 08:17:28,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:28,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:17:28,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:28,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:17:28,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:17:28,366 INFO L87 Difference]: Start difference. First operand 1168 states and 1738 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:28,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:28,493 INFO L93 Difference]: Finished difference Result 2188 states and 3264 transitions. [2025-01-09 08:17:28,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:17:28,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-01-09 08:17:28,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:28,497 INFO L225 Difference]: With dead ends: 2188 [2025-01-09 08:17:28,497 INFO L226 Difference]: Without dead ends: 1163 [2025-01-09 08:17:28,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:17:28,499 INFO L435 NwaCegarLoop]: 1644 mSDtfsCounter, 1643 mSDsluCounter, 3284 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1643 SdHoareTripleChecker+Valid, 4928 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:28,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1643 Valid, 4928 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:17:28,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2025-01-09 08:17:28,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1161. [2025-01-09 08:17:28,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1160 states have (on average 1.4896551724137932) internal successors, (1728), 1160 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:28,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1728 transitions. [2025-01-09 08:17:28,517 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1728 transitions. Word has length 92 [2025-01-09 08:17:28,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:28,517 INFO L471 AbstractCegarLoop]: Abstraction has 1161 states and 1728 transitions. [2025-01-09 08:17:28,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:28,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1728 transitions. [2025-01-09 08:17:28,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 08:17:28,518 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:28,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:17:28,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 08:17:28,518 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:28,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:28,519 INFO L85 PathProgramCache]: Analyzing trace with hash -2083477344, now seen corresponding path program 1 times [2025-01-09 08:17:28,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:28,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159847431] [2025-01-09 08:17:28,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:28,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:28,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 08:17:28,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 08:17:28,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:28,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:17:28,570 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 08:17:28,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 08:17:28,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 08:17:28,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:28,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:17:28,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 08:17:28,663 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 08:17:28,664 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 08:17:28,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 08:17:28,668 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:17:28,729 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 08:17:28,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 08:17:28 BoogieIcfgContainer [2025-01-09 08:17:28,731 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 08:17:28,732 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 08:17:28,732 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 08:17:28,732 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 08:17:28,732 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:17:17" (3/4) ... [2025-01-09 08:17:28,734 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 08:17:28,734 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 08:17:28,735 INFO L158 Benchmark]: Toolchain (without parser) took 17462.39ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 107.1MB in the beginning and 497.7MB in the end (delta: -390.6MB). Peak memory consumption was 641.1MB. Max. memory is 16.1GB. [2025-01-09 08:17:28,735 INFO L158 Benchmark]: CDTParser took 0.82ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:17:28,735 INFO L158 Benchmark]: CACSL2BoogieTranslator took 861.04ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 77.2MB in the end (delta: 29.9MB). Peak memory consumption was 97.4MB. Max. memory is 16.1GB. [2025-01-09 08:17:28,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 747.16ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 77.2MB in the beginning and 218.1MB in the end (delta: -140.9MB). Peak memory consumption was 88.6MB. Max. memory is 16.1GB. [2025-01-09 08:17:28,736 INFO L158 Benchmark]: Boogie Preprocessor took 472.20ms. Allocated memory is still 335.5MB. Free memory was 218.1MB in the beginning and 181.8MB in the end (delta: 36.3MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. [2025-01-09 08:17:28,736 INFO L158 Benchmark]: RCFGBuilder took 4074.73ms. Allocated memory was 335.5MB in the beginning and 671.1MB in the end (delta: 335.5MB). Free memory was 181.8MB in the beginning and 428.8MB in the end (delta: -247.0MB). Peak memory consumption was 139.9MB. Max. memory is 16.1GB. [2025-01-09 08:17:28,736 INFO L158 Benchmark]: TraceAbstraction took 11297.67ms. Allocated memory was 671.1MB in the beginning and 1.2GB in the end (delta: 494.9MB). Free memory was 425.8MB in the beginning and 497.8MB in the end (delta: -72.0MB). Peak memory consumption was 417.5MB. Max. memory is 16.1GB. [2025-01-09 08:17:28,736 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 1.2GB. Free memory was 497.8MB in the beginning and 497.7MB in the end (delta: 74.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:17:28,737 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.82ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 861.04ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 77.2MB in the end (delta: 29.9MB). Peak memory consumption was 97.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 747.16ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 77.2MB in the beginning and 218.1MB in the end (delta: -140.9MB). Peak memory consumption was 88.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 472.20ms. Allocated memory is still 335.5MB. Free memory was 218.1MB in the beginning and 181.8MB in the end (delta: 36.3MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. * RCFGBuilder took 4074.73ms. Allocated memory was 335.5MB in the beginning and 671.1MB in the end (delta: 335.5MB). Free memory was 181.8MB in the beginning and 428.8MB in the end (delta: -247.0MB). Peak memory consumption was 139.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11297.67ms. Allocated memory was 671.1MB in the beginning and 1.2GB in the end (delta: 494.9MB). Free memory was 425.8MB in the beginning and 497.8MB in the end (delta: -72.0MB). Peak memory consumption was 417.5MB. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 1.2GB. Free memory was 497.8MB in the beginning and 497.7MB in the end (delta: 74.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 385. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 2); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (2 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 3); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (3 - 1); [L35] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 4); [L36] const SORT_12 msb_SORT_12 = (SORT_12)1 << (4 - 1); [L38] const SORT_16 mask_SORT_16 = (SORT_16)-1 >> (sizeof(SORT_16) * 8 - 8); [L39] const SORT_16 msb_SORT_16 = (SORT_16)1 << (8 - 1); [L41] const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 7); [L42] const SORT_21 msb_SORT_21 = (SORT_21)1 << (7 - 1); [L44] const SORT_21 var_22 = 1; [L45] const SORT_21 var_26 = 2; [L46] const SORT_21 var_29 = 4; [L47] const SORT_21 var_32 = 8; [L48] const SORT_21 var_35 = 16; [L49] const SORT_21 var_38 = 32; [L50] const SORT_21 var_41 = 64; [L51] const SORT_21 var_44 = 0; [L52] const SORT_3 var_47 = 1; [L53] const SORT_3 var_51 = 0; [L54] const SORT_6 var_138 = 0; [L56] SORT_1 input_2; [L57] SORT_3 input_4; [L58] SORT_3 input_5; [L59] SORT_6 input_7; [L60] SORT_3 input_8; [L61] SORT_3 input_9; [L62] SORT_3 input_10; [L63] SORT_3 input_11; [L64] SORT_12 input_13; [L65] SORT_3 input_14; [L66] SORT_3 input_15; [L67] SORT_16 input_17; [L68] SORT_3 input_18; [L69] SORT_3 input_19; [L70] SORT_3 input_20; [L71] SORT_3 input_360; [L72] SORT_3 input_382; [L73] SORT_3 input_397; [L74] SORT_3 input_412; [L75] SORT_3 input_427; [L76] SORT_3 input_442; [L77] SORT_3 input_457; [L78] SORT_3 input_472; [L79] SORT_3 input_487; [L80] SORT_3 input_502; [L81] SORT_3 input_517; [L82] SORT_3 input_532; [L83] SORT_3 input_547; [L84] SORT_3 input_562; [L85] SORT_3 input_577; [L86] SORT_3 input_592; [L87] SORT_3 input_608; [L88] SORT_3 input_610; [L89] SORT_3 input_612; [L90] SORT_3 input_614; [L91] SORT_3 input_616; [L92] SORT_3 input_618; [L93] SORT_3 input_620; [L94] SORT_3 input_622; [L95] SORT_3 input_627; [L96] SORT_3 input_669; [L97] SORT_3 input_678; [L98] SORT_21 input_683; [L99] SORT_21 input_684; [L100] SORT_21 input_685; [L101] SORT_21 input_686; [L102] SORT_21 input_689; [L103] SORT_21 input_693; [L104] SORT_21 input_697; [L105] SORT_21 input_705; [L106] SORT_21 input_709; [L107] SORT_21 input_711; [L108] SORT_21 input_715; [L109] SORT_21 input_718; [L110] SORT_21 input_722; [L111] SORT_21 input_727; [L112] SORT_21 input_731; [L113] SORT_21 input_736; [L114] SORT_21 input_738; [L115] SORT_21 input_739; [L116] SORT_21 input_741; [L117] SORT_21 input_745; [L118] SORT_21 input_750; [L119] SORT_21 input_757; [L120] SORT_21 input_758; [L121] SORT_21 input_760; [L122] SORT_21 input_764; [L123] SORT_21 input_769; [L124] SORT_21 input_771; [L125] SORT_21 input_772; [L126] SORT_21 input_774; [L127] SORT_21 input_778; [L128] SORT_21 input_783; [L129] SORT_21 input_787; [L130] SORT_21 input_792; [L131] SORT_21 input_794; [L132] SORT_21 input_800; [L133] SORT_21 input_812; [L134] SORT_3 input_830; [L135] SORT_3 input_837; [L136] SORT_3 input_848; [L137] SORT_3 input_854; [L138] SORT_3 input_860; [L139] SORT_3 input_866; [L140] SORT_3 input_872; [L141] SORT_3 input_878; [L142] SORT_3 input_884; [L143] SORT_3 input_890; [L144] SORT_3 input_896; [L145] SORT_3 input_902; [L146] SORT_3 input_908; [L147] SORT_3 input_914; [L148] SORT_3 input_920; [L150] EXPR __VERIFIER_nondet_uchar() & mask_SORT_21 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L150] SORT_21 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_21; [L151] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L151] SORT_3 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L152] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L152] SORT_3 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L153] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L153] SORT_3 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L154] EXPR __VERIFIER_nondet_uchar() & mask_SORT_21 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L154] SORT_21 state_58 = __VERIFIER_nondet_uchar() & mask_SORT_21; [L155] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L155] SORT_3 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L156] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L156] SORT_3 state_66 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L157] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L157] SORT_3 state_70 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L158] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L158] SORT_3 state_86 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L159] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L159] SORT_3 state_103 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L160] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L160] SORT_3 state_106 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L161] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L161] SORT_3 state_108 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L162] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L162] SORT_3 state_112 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L163] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L163] SORT_3 state_116 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L164] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L164] SORT_3 state_121 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L165] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L165] SORT_3 state_124 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L166] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L166] SORT_3 state_134 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L167] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L167] SORT_3 state_141 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L168] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L168] SORT_3 state_144 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L169] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L169] SORT_3 state_153 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L170] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L170] SORT_3 state_158 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L171] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L171] SORT_3 state_161 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L172] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L172] SORT_3 state_173 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L173] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L173] SORT_3 state_183 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L174] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L174] SORT_3 state_188 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L175] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L175] SORT_3 state_191 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L176] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L176] SORT_3 state_200 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L177] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L177] SORT_3 state_213 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L178] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L178] SORT_3 state_226 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L180] SORT_21 init_24_arg_1 = var_22; [L181] state_23 = init_24_arg_1 [L182] SORT_3 init_53_arg_1 = var_51; [L183] state_52 = init_53_arg_1 [L184] SORT_3 init_55_arg_1 = var_51; [L185] state_54 = init_55_arg_1 [L186] SORT_3 init_57_arg_1 = var_51; [L187] state_56 = init_57_arg_1 [L188] SORT_21 init_59_arg_1 = var_22; [L189] state_58 = init_59_arg_1 [L190] SORT_3 init_63_arg_1 = var_51; [L191] state_62 = init_63_arg_1 [L192] SORT_3 init_67_arg_1 = var_51; [L193] state_66 = init_67_arg_1 [L194] SORT_3 init_71_arg_1 = var_51; [L195] state_70 = init_71_arg_1 [L196] SORT_3 init_87_arg_1 = var_51; [L197] state_86 = init_87_arg_1 [L198] SORT_3 init_104_arg_1 = var_51; [L199] state_103 = init_104_arg_1 [L200] SORT_3 init_107_arg_1 = var_51; [L201] state_106 = init_107_arg_1 [L202] SORT_3 init_109_arg_1 = var_51; [L203] state_108 = init_109_arg_1 [L204] SORT_3 init_113_arg_1 = var_51; [L205] state_112 = init_113_arg_1 [L206] SORT_3 init_117_arg_1 = var_51; [L207] state_116 = init_117_arg_1 [L208] SORT_3 init_122_arg_1 = var_51; [L209] state_121 = init_122_arg_1 [L210] SORT_3 init_125_arg_1 = var_51; [L211] state_124 = init_125_arg_1 [L212] SORT_3 init_135_arg_1 = var_51; [L213] state_134 = init_135_arg_1 [L214] SORT_3 init_142_arg_1 = var_51; [L215] state_141 = init_142_arg_1 [L216] SORT_3 init_145_arg_1 = var_51; [L217] state_144 = init_145_arg_1 [L218] SORT_3 init_154_arg_1 = var_51; [L219] state_153 = init_154_arg_1 [L220] SORT_3 init_159_arg_1 = var_51; [L221] state_158 = init_159_arg_1 [L222] SORT_3 init_162_arg_1 = var_51; [L223] state_161 = init_162_arg_1 [L224] SORT_3 init_174_arg_1 = var_51; [L225] state_173 = init_174_arg_1 [L226] SORT_3 init_184_arg_1 = var_51; [L227] state_183 = init_184_arg_1 [L228] SORT_3 init_189_arg_1 = var_51; [L229] state_188 = init_189_arg_1 [L230] SORT_3 init_192_arg_1 = var_51; [L231] state_191 = init_192_arg_1 [L232] SORT_3 init_201_arg_1 = var_51; [L233] state_200 = init_201_arg_1 [L234] SORT_3 init_214_arg_1 = var_51; [L235] state_213 = init_214_arg_1 [L236] SORT_3 init_227_arg_1 = var_51; [L237] state_226 = init_227_arg_1 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L240] input_2 = __VERIFIER_nondet_uchar() [L241] input_4 = __VERIFIER_nondet_uchar() [L242] input_5 = __VERIFIER_nondet_uchar() [L243] input_7 = __VERIFIER_nondet_uchar() [L244] EXPR input_7 & mask_SORT_6 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L244] input_7 = input_7 & mask_SORT_6 [L245] input_8 = __VERIFIER_nondet_uchar() [L246] input_9 = __VERIFIER_nondet_uchar() [L247] input_10 = __VERIFIER_nondet_uchar() [L248] input_11 = __VERIFIER_nondet_uchar() [L249] input_13 = __VERIFIER_nondet_uchar() [L250] input_14 = __VERIFIER_nondet_uchar() [L251] input_15 = __VERIFIER_nondet_uchar() [L252] input_17 = __VERIFIER_nondet_uchar() [L253] input_18 = __VERIFIER_nondet_uchar() [L254] input_19 = __VERIFIER_nondet_uchar() [L255] input_20 = __VERIFIER_nondet_uchar() [L256] input_360 = __VERIFIER_nondet_uchar() [L257] input_382 = __VERIFIER_nondet_uchar() [L258] input_397 = __VERIFIER_nondet_uchar() [L259] input_412 = __VERIFIER_nondet_uchar() [L260] input_427 = __VERIFIER_nondet_uchar() [L261] input_442 = __VERIFIER_nondet_uchar() [L262] input_457 = __VERIFIER_nondet_uchar() [L263] input_472 = __VERIFIER_nondet_uchar() [L264] input_487 = __VERIFIER_nondet_uchar() [L265] input_502 = __VERIFIER_nondet_uchar() [L266] input_517 = __VERIFIER_nondet_uchar() [L267] input_532 = __VERIFIER_nondet_uchar() [L268] input_547 = __VERIFIER_nondet_uchar() [L269] input_562 = __VERIFIER_nondet_uchar() [L270] input_577 = __VERIFIER_nondet_uchar() [L271] input_592 = __VERIFIER_nondet_uchar() [L272] input_608 = __VERIFIER_nondet_uchar() [L273] input_610 = __VERIFIER_nondet_uchar() [L274] input_612 = __VERIFIER_nondet_uchar() [L275] input_614 = __VERIFIER_nondet_uchar() [L276] input_616 = __VERIFIER_nondet_uchar() [L277] input_618 = __VERIFIER_nondet_uchar() [L278] input_620 = __VERIFIER_nondet_uchar() [L279] input_622 = __VERIFIER_nondet_uchar() [L280] input_627 = __VERIFIER_nondet_uchar() [L281] input_669 = __VERIFIER_nondet_uchar() [L282] input_678 = __VERIFIER_nondet_uchar() [L283] input_683 = __VERIFIER_nondet_uchar() [L284] input_684 = __VERIFIER_nondet_uchar() [L285] input_685 = __VERIFIER_nondet_uchar() [L286] input_686 = __VERIFIER_nondet_uchar() [L287] input_689 = __VERIFIER_nondet_uchar() [L288] input_693 = __VERIFIER_nondet_uchar() [L289] input_697 = __VERIFIER_nondet_uchar() [L290] input_705 = __VERIFIER_nondet_uchar() [L291] input_709 = __VERIFIER_nondet_uchar() [L292] input_711 = __VERIFIER_nondet_uchar() [L293] input_715 = __VERIFIER_nondet_uchar() [L294] input_718 = __VERIFIER_nondet_uchar() [L295] input_722 = __VERIFIER_nondet_uchar() [L296] input_727 = __VERIFIER_nondet_uchar() [L297] input_731 = __VERIFIER_nondet_uchar() [L298] input_736 = __VERIFIER_nondet_uchar() [L299] input_738 = __VERIFIER_nondet_uchar() [L300] input_739 = __VERIFIER_nondet_uchar() [L301] input_741 = __VERIFIER_nondet_uchar() [L302] input_745 = __VERIFIER_nondet_uchar() [L303] input_750 = __VERIFIER_nondet_uchar() [L304] input_757 = __VERIFIER_nondet_uchar() [L305] input_758 = __VERIFIER_nondet_uchar() [L306] input_760 = __VERIFIER_nondet_uchar() [L307] input_764 = __VERIFIER_nondet_uchar() [L308] input_769 = __VERIFIER_nondet_uchar() [L309] input_771 = __VERIFIER_nondet_uchar() [L310] input_772 = __VERIFIER_nondet_uchar() [L311] input_774 = __VERIFIER_nondet_uchar() [L312] input_778 = __VERIFIER_nondet_uchar() [L313] input_783 = __VERIFIER_nondet_uchar() [L314] input_787 = __VERIFIER_nondet_uchar() [L315] input_792 = __VERIFIER_nondet_uchar() [L316] input_794 = __VERIFIER_nondet_uchar() [L317] input_800 = __VERIFIER_nondet_uchar() [L318] input_812 = __VERIFIER_nondet_uchar() [L319] input_830 = __VERIFIER_nondet_uchar() [L320] input_837 = __VERIFIER_nondet_uchar() [L321] input_848 = __VERIFIER_nondet_uchar() [L322] input_854 = __VERIFIER_nondet_uchar() [L323] input_860 = __VERIFIER_nondet_uchar() [L324] input_866 = __VERIFIER_nondet_uchar() [L325] input_872 = __VERIFIER_nondet_uchar() [L326] input_878 = __VERIFIER_nondet_uchar() [L327] input_884 = __VERIFIER_nondet_uchar() [L328] input_890 = __VERIFIER_nondet_uchar() [L329] input_896 = __VERIFIER_nondet_uchar() [L330] input_902 = __VERIFIER_nondet_uchar() [L331] input_908 = __VERIFIER_nondet_uchar() [L332] input_914 = __VERIFIER_nondet_uchar() [L333] input_920 = __VERIFIER_nondet_uchar() [L336] SORT_21 var_25_arg_0 = state_23; [L337] SORT_21 var_25_arg_1 = var_22; [L338] SORT_3 var_25 = var_25_arg_0 == var_25_arg_1; [L339] SORT_21 var_27_arg_0 = state_23; [L340] SORT_21 var_27_arg_1 = var_26; [L341] SORT_3 var_27 = var_27_arg_0 == var_27_arg_1; [L342] SORT_3 var_28_arg_0 = var_25; [L343] SORT_3 var_28_arg_1 = var_27; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_28_arg_0=1, var_28_arg_1=0, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L344] EXPR var_28_arg_0 | var_28_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L344] SORT_3 var_28 = var_28_arg_0 | var_28_arg_1; [L345] SORT_21 var_30_arg_0 = state_23; [L346] SORT_21 var_30_arg_1 = var_29; [L347] SORT_3 var_30 = var_30_arg_0 == var_30_arg_1; [L348] SORT_3 var_31_arg_0 = var_28; [L349] SORT_3 var_31_arg_1 = var_30; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_31_arg_0=1, var_31_arg_1=0, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L350] EXPR var_31_arg_0 | var_31_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L350] SORT_3 var_31 = var_31_arg_0 | var_31_arg_1; [L351] SORT_21 var_33_arg_0 = state_23; [L352] SORT_21 var_33_arg_1 = var_32; [L353] SORT_3 var_33 = var_33_arg_0 == var_33_arg_1; [L354] SORT_3 var_34_arg_0 = var_31; [L355] SORT_3 var_34_arg_1 = var_33; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_34_arg_0=1, var_34_arg_1=0, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L356] EXPR var_34_arg_0 | var_34_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L356] SORT_3 var_34 = var_34_arg_0 | var_34_arg_1; [L357] SORT_21 var_36_arg_0 = state_23; [L358] SORT_21 var_36_arg_1 = var_35; [L359] SORT_3 var_36 = var_36_arg_0 == var_36_arg_1; [L360] SORT_3 var_37_arg_0 = var_34; [L361] SORT_3 var_37_arg_1 = var_36; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_37_arg_0=1, var_37_arg_1=0, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L362] EXPR var_37_arg_0 | var_37_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L362] SORT_3 var_37 = var_37_arg_0 | var_37_arg_1; [L363] SORT_21 var_39_arg_0 = state_23; [L364] SORT_21 var_39_arg_1 = var_38; [L365] SORT_3 var_39 = var_39_arg_0 == var_39_arg_1; [L366] SORT_3 var_40_arg_0 = var_37; [L367] SORT_3 var_40_arg_1 = var_39; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_40_arg_0=1, var_40_arg_1=0, var_41=64, var_44=0, var_47=1, var_51=0] [L368] EXPR var_40_arg_0 | var_40_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L368] SORT_3 var_40 = var_40_arg_0 | var_40_arg_1; [L369] SORT_21 var_42_arg_0 = state_23; [L370] SORT_21 var_42_arg_1 = var_41; [L371] SORT_3 var_42 = var_42_arg_0 == var_42_arg_1; [L372] SORT_3 var_43_arg_0 = var_40; [L373] SORT_3 var_43_arg_1 = var_42; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_43_arg_0=1, var_43_arg_1=0, var_44=0, var_47=1, var_51=0] [L374] EXPR var_43_arg_0 | var_43_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L374] SORT_3 var_43 = var_43_arg_0 | var_43_arg_1; [L375] SORT_21 var_45_arg_0 = state_23; [L376] SORT_21 var_45_arg_1 = var_44; [L377] SORT_3 var_45 = var_45_arg_0 == var_45_arg_1; [L378] SORT_3 var_46_arg_0 = var_43; [L379] SORT_3 var_46_arg_1 = var_45; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46_arg_0=1, var_46_arg_1=0, var_47=1, var_51=0] [L380] EXPR var_46_arg_0 | var_46_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L380] SORT_3 var_46 = var_46_arg_0 | var_46_arg_1; [L381] SORT_3 var_48_arg_0 = var_46; [L382] SORT_3 var_48 = ~var_48_arg_0; [L383] SORT_3 var_49_arg_0 = var_47; [L384] SORT_3 var_49_arg_1 = var_48; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_49_arg_0=1, var_49_arg_1=-2, var_51=0] [L385] EXPR var_49_arg_0 & var_49_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L385] SORT_3 var_49 = var_49_arg_0 & var_49_arg_1; [L386] EXPR var_49 & mask_SORT_3 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L386] var_49 = var_49 & mask_SORT_3 [L387] SORT_3 bad_50_arg_0 = var_49; [L388] CALL __VERIFIER_assert(!(bad_50_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23248 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23248 mSDsluCounter, 121651 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 95341 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2094 IncrementalHoareTripleChecker+Invalid, 2100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 26310 mSDtfsCounter, 2094 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1168occurred in iteration=15, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 172 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 1510 NumberOfCodeBlocks, 1510 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1401 ConstructedInterpolants, 0 QuantifiedInterpolants, 7353 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 08:17:28,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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.vcegar_QF_BV_pj_icu_icctl_p1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 c8208b6c8f4a2ac058115c356d3ca9113d648f4f67e8abc6f1ec7c44bb7ab63f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:17:31,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:17:31,321 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-01-09 08:17:31,331 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:17:31,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:17:31,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:17:31,400 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:17:31,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:17:31,400 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:17:31,400 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:17:31,400 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:17:31,400 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:17:31,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:17:31,401 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:17:31,401 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:17:31,401 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:17:31,402 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:17:31,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:17:31,402 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:17:31,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:17:31,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:17:31,403 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 08:17:31,404 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 08:17:31,404 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 08:17:31,404 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:17:31,404 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:17:31,404 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:17:31,404 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:17:31,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:17:31,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:17:31,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:17:31,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:17:31,405 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:17:31,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:17:31,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:17:31,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:17:31,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:17:31,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:17:31,409 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:17:31,409 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:17:31,409 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:17:31,410 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 08:17:31,410 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 08:17:31,410 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:17:31,410 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:17:31,410 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:17:31,410 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:17:31,410 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 -> c8208b6c8f4a2ac058115c356d3ca9113d648f4f67e8abc6f1ec7c44bb7ab63f [2025-01-09 08:17:31,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:17:31,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:17:31,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:17:31,663 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:17:31,663 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:17:31,664 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.vcegar_QF_BV_pj_icu_icctl_p1.c [2025-01-09 08:17:33,091 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/03f7f835e/6839480b25a74da7b8dd47708c0c58e3/FLAG91db1bf11 [2025-01-09 08:17:33,498 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:17:33,499 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2025-01-09 08:17:33,514 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/03f7f835e/6839480b25a74da7b8dd47708c0c58e3/FLAG91db1bf11 [2025-01-09 08:17:33,692 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/03f7f835e/6839480b25a74da7b8dd47708c0c58e3 [2025-01-09 08:17:33,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:17:33,695 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:17:33,696 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:17:33,696 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:17:33,699 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:17:33,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:17:33" (1/1) ... [2025-01-09 08:17:33,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@569231d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:33, skipping insertion in model container [2025-01-09 08:17:33,700 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:17:33" (1/1) ... [2025-01-09 08:17:33,756 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:17:33,903 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.vcegar_QF_BV_pj_icu_icctl_p1.c[1268,1281] [2025-01-09 08:17:34,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:17:34,133 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:17:34,140 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.vcegar_QF_BV_pj_icu_icctl_p1.c[1268,1281] [2025-01-09 08:17:34,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:17:34,295 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:17:34,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:34 WrapperNode [2025-01-09 08:17:34,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:17:34,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:17:34,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:17:34,298 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:17:34,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:34" (1/1) ... [2025-01-09 08:17:34,332 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:34" (1/1) ... [2025-01-09 08:17:34,418 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2616 [2025-01-09 08:17:34,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:17:34,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:17:34,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:17:34,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:17:34,426 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:34" (1/1) ... [2025-01-09 08:17:34,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:34" (1/1) ... [2025-01-09 08:17:34,441 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:34" (1/1) ... [2025-01-09 08:17:34,486 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 08:17:34,487 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:34" (1/1) ... [2025-01-09 08:17:34,487 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:34" (1/1) ... [2025-01-09 08:17:34,530 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:34" (1/1) ... [2025-01-09 08:17:34,536 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:34" (1/1) ... [2025-01-09 08:17:34,540 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:34" (1/1) ... [2025-01-09 08:17:34,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:34" (1/1) ... [2025-01-09 08:17:34,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:34" (1/1) ... [2025-01-09 08:17:34,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:17:34,580 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:17:34,580 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:17:34,581 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:17:34,581 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:34" (1/1) ... [2025-01-09 08:17:34,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:17:34,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:17:34,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 08:17:34,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 08:17:34,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:17:34,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 08:17:34,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:17:34,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:17:35,065 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:17:35,066 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:17:37,443 INFO L? ?]: Removed 159 outVars from TransFormulas that were not future-live. [2025-01-09 08:17:37,443 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:17:37,451 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:17:37,452 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:17:37,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:17:37 BoogieIcfgContainer [2025-01-09 08:17:37,452 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:17:37,454 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:17:37,455 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:17:37,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:17:37,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:17:33" (1/3) ... [2025-01-09 08:17:37,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105ca2f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:17:37, skipping insertion in model container [2025-01-09 08:17:37,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:34" (2/3) ... [2025-01-09 08:17:37,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105ca2f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:17:37, skipping insertion in model container [2025-01-09 08:17:37,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:17:37" (3/3) ... [2025-01-09 08:17:37,463 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2025-01-09 08:17:37,476 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:17:37,479 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:17:37,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:17:37,536 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;@65dbbe2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:17:37,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:17:37,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:37,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 08:17:37,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:37,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 08:17:37,546 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:37,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:37,552 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2025-01-09 08:17:37,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:17:37,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [349665078] [2025-01-09 08:17:37,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:37,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:17:37,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:17:37,570 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:17:37,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 08:17:38,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 08:17:38,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 08:17:38,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:38,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:38,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 08:17:38,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:17:38,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:38,263 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:17:38,264 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:17:38,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349665078] [2025-01-09 08:17:38,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349665078] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:38,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:38,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:17:38,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568447821] [2025-01-09 08:17:38,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:38,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:17:38,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:17:38,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:17:38,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:17:38,289 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:38,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:38,388 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-01-09 08:17:38,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:17:38,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2025-01-09 08:17:38,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:38,395 INFO L225 Difference]: With dead ends: 17 [2025-01-09 08:17:38,395 INFO L226 Difference]: Without dead ends: 9 [2025-01-09 08:17:38,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:17:38,399 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:38,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:17:38,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-01-09 08:17:38,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-01-09 08:17:38,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:38,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-01-09 08:17:38,426 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-01-09 08:17:38,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:38,427 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-01-09 08:17:38,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:38,427 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-01-09 08:17:38,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 08:17:38,429 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:38,429 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-09 08:17:38,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 08:17:38,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:17:38,630 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:38,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:38,631 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2025-01-09 08:17:38,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:17:38,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1320130861] [2025-01-09 08:17:38,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:38,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:17:38,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:17:38,639 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:17:38,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 08:17:39,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 08:17:39,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 08:17:39,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:39,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:39,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 08:17:39,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:17:39,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:39,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:17:43,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:43,845 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:17:43,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320130861] [2025-01-09 08:17:43,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320130861] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:17:43,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 08:17:43,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-01-09 08:17:43,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767770172] [2025-01-09 08:17:43,846 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 08:17:43,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 08:17:43,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:17:43,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 08:17:43,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=64, Unknown=1, NotChecked=0, Total=90 [2025-01-09 08:17:43,848 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:44,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:44,157 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-01-09 08:17:44,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:17:44,157 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 8 [2025-01-09 08:17:44,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:44,158 INFO L225 Difference]: With dead ends: 14 [2025-01-09 08:17:44,158 INFO L226 Difference]: Without dead ends: 12 [2025-01-09 08:17:44,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=40, Invalid=91, Unknown=1, NotChecked=0, Total=132 [2025-01-09 08:17:44,159 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:44,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:17:44,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-01-09 08:17:44,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-01-09 08:17:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:44,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-01-09 08:17:44,162 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-01-09 08:17:44,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:44,162 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-01-09 08:17:44,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:44,162 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-01-09 08:17:44,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 08:17:44,163 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:44,163 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-01-09 08:17:44,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 08:17:44,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:17:44,364 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:44,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:44,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2025-01-09 08:17:44,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:17:44,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [623089927] [2025-01-09 08:17:44,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 08:17:44,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:17:44,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:17:44,377 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:17:44,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 08:17:45,115 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-09 08:17:45,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 08:17:45,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 08:17:45,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:45,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-01-09 08:17:45,445 INFO L279 TraceCheckSpWp]: Computing forward predicates...