./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_p4.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_p4.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 ec4ad5c3087d33b41ea5a98e18a71d9d74f551b4f0d4a83a1cb74449f522f78e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:17:29,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:17:29,062 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:29,069 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:17:29,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:17:29,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:17:29,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:17:29,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:17:29,093 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:17:29,093 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:17:29,094 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:17:29,094 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:17:29,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:17:29,094 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:17:29,094 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:17:29,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:17:29,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:17:29,095 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:17:29,095 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:17:29,095 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:17:29,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:17:29,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:17:29,095 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:17:29,095 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:17:29,095 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:17:29,095 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:17:29,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:17:29,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:17:29,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:17:29,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:17:29,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:17:29,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:17:29,096 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:17:29,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:17:29,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:17:29,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:17:29,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:17:29,096 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:17:29,096 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:17:29,096 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:17:29,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:17:29,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:17:29,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:17:29,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:17:29,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:17:29,096 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 -> ec4ad5c3087d33b41ea5a98e18a71d9d74f551b4f0d4a83a1cb74449f522f78e [2025-01-09 08:17:29,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:17:29,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:17:29,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:17:29,317 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:17:29,318 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:17:29,318 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_p4.c [2025-01-09 08:17:30,452 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a38bd38c/7e88f070913149728279e886c503b2f9/FLAGe6eebac19 [2025-01-09 08:17:30,857 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:17:30,857 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c [2025-01-09 08:17:30,876 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a38bd38c/7e88f070913149728279e886c503b2f9/FLAGe6eebac19 [2025-01-09 08:17:30,890 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a38bd38c/7e88f070913149728279e886c503b2f9 [2025-01-09 08:17:30,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:17:30,893 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:17:30,895 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:17:30,895 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:17:30,897 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:17:30,898 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:17:30" (1/1) ... [2025-01-09 08:17:30,898 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f307df2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:30, skipping insertion in model container [2025-01-09 08:17:30,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:17:30" (1/1) ... [2025-01-09 08:17:30,952 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:17:31,099 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_p4.c[1268,1281] [2025-01-09 08:17:31,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:17:31,451 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:17:31,459 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_p4.c[1268,1281] [2025-01-09 08:17:31,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:17:31,634 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:17:31,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:31 WrapperNode [2025-01-09 08:17:31,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:17:31,636 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:17:31,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:17:31,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:17:31,642 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:31" (1/1) ... [2025-01-09 08:17:31,679 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:31" (1/1) ... [2025-01-09 08:17:32,127 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4812 [2025-01-09 08:17:32,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:17:32,132 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:17:32,132 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:17:32,132 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:17:32,143 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:31" (1/1) ... [2025-01-09 08:17:32,146 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:31" (1/1) ... [2025-01-09 08:17:32,209 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:31" (1/1) ... [2025-01-09 08:17:32,396 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:32,396 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:31" (1/1) ... [2025-01-09 08:17:32,397 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:31" (1/1) ... [2025-01-09 08:17:32,499 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:31" (1/1) ... [2025-01-09 08:17:32,513 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:31" (1/1) ... [2025-01-09 08:17:32,536 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:31" (1/1) ... [2025-01-09 08:17:32,582 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:31" (1/1) ... [2025-01-09 08:17:32,605 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:31" (1/1) ... [2025-01-09 08:17:32,650 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:17:32,652 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:17:32,652 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:17:32,653 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:17:32,653 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:31" (1/1) ... [2025-01-09 08:17:32,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:17:32,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:17:32,680 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:32,684 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:32,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:17:32,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:17:32,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:17:32,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:17:33,062 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:17:33,063 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:17:36,574 INFO L? ?]: Removed 3115 outVars from TransFormulas that were not future-live. [2025-01-09 08:17:36,575 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:17:36,612 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:17:36,616 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:17:36,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:17:36 BoogieIcfgContainer [2025-01-09 08:17:36,617 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:17:36,618 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:17:36,618 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:17:36,622 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:17:36,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:17:30" (1/3) ... [2025-01-09 08:17:36,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1702c920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:17:36, skipping insertion in model container [2025-01-09 08:17:36,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:31" (2/3) ... [2025-01-09 08:17:36,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1702c920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:17:36, skipping insertion in model container [2025-01-09 08:17:36,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:17:36" (3/3) ... [2025-01-09 08:17:36,626 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c [2025-01-09 08:17:36,637 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:17:36,640 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c that has 1 procedures, 1110 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:17:36,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:17:36,725 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;@12ad641, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:17:36,725 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:17:36,733 INFO L276 IsEmpty]: Start isEmpty. Operand has 1110 states, 1108 states have (on average 1.4990974729241877) internal successors, (1661), 1109 states have internal predecessors, (1661), 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:36,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 08:17:36,740 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:36,741 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] [2025-01-09 08:17:36,741 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:36,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:36,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1132341910, now seen corresponding path program 1 times [2025-01-09 08:17:36,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:36,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565471903] [2025-01-09 08:17:36,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:36,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:36,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 08:17:37,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 08:17:37,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:37,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:37,528 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:37,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:37,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565471903] [2025-01-09 08:17:37,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565471903] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:37,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:37,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:17:37,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315971464] [2025-01-09 08:17:37,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:37,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:17:37,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:37,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:17:37,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:17:37,556 INFO L87 Difference]: Start difference. First operand has 1110 states, 1108 states have (on average 1.4990974729241877) internal successors, (1661), 1109 states have internal predecessors, (1661), 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.25) internal successors, (81), 4 states have internal predecessors, (81), 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,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:37,691 INFO L93 Difference]: Finished difference Result 2101 states and 3147 transitions. [2025-01-09 08:17:37,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:17:37,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 81 [2025-01-09 08:17:37,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:37,706 INFO L225 Difference]: With dead ends: 2101 [2025-01-09 08:17:37,707 INFO L226 Difference]: Without dead ends: 1109 [2025-01-09 08:17:37,710 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:37,712 INFO L435 NwaCegarLoop]: 1655 mSDtfsCounter, 0 mSDsluCounter, 3304 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4959 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:37,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4959 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:37,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2025-01-09 08:17:37,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2025-01-09 08:17:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 1108 states have (on average 1.4972924187725631) internal successors, (1659), 1108 states have internal predecessors, (1659), 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,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1659 transitions. [2025-01-09 08:17:37,795 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1659 transitions. Word has length 81 [2025-01-09 08:17:37,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:37,796 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1659 transitions. [2025-01-09 08:17:37,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1659 transitions. [2025-01-09 08:17:37,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 08:17:37,799 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:37,799 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] [2025-01-09 08:17:37,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 08:17:37,799 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:37,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:37,801 INFO L85 PathProgramCache]: Analyzing trace with hash 744556489, now seen corresponding path program 1 times [2025-01-09 08:17:37,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:37,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059414908] [2025-01-09 08:17:37,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:37,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:37,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 08:17:37,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 08:17:37,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:37,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:38,126 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,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:38,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059414908] [2025-01-09 08:17:38,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059414908] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:38,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:38,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:17:38,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256985034] [2025-01-09 08:17:38,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:38,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:17:38,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:38,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:17:38,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:17:38,130 INFO L87 Difference]: Start difference. First operand 1109 states and 1659 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:38,188 INFO L93 Difference]: Finished difference Result 2102 states and 3145 transitions. [2025-01-09 08:17:38,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:17:38,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 82 [2025-01-09 08:17:38,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:38,193 INFO L225 Difference]: With dead ends: 2102 [2025-01-09 08:17:38,193 INFO L226 Difference]: Without dead ends: 1111 [2025-01-09 08:17:38,196 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:38,197 INFO L435 NwaCegarLoop]: 1655 mSDtfsCounter, 0 mSDsluCounter, 3300 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4955 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:38,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4955 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:38,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2025-01-09 08:17:38,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1111. [2025-01-09 08:17:38,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 1110 states have (on average 1.4963963963963964) internal successors, (1661), 1110 states have internal predecessors, (1661), 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,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1661 transitions. [2025-01-09 08:17:38,224 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1661 transitions. Word has length 82 [2025-01-09 08:17:38,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:38,224 INFO L471 AbstractCegarLoop]: Abstraction has 1111 states and 1661 transitions. [2025-01-09 08:17:38,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1661 transitions. [2025-01-09 08:17:38,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 08:17:38,227 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:38,228 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:38,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:17:38,230 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:38,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:38,230 INFO L85 PathProgramCache]: Analyzing trace with hash 508449231, now seen corresponding path program 1 times [2025-01-09 08:17:38,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:38,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282786198] [2025-01-09 08:17:38,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:38,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:38,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 08:17:38,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 08:17:38,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:38,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:39,404 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:39,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:39,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282786198] [2025-01-09 08:17:39,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282786198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:39,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:39,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 08:17:39,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811141455] [2025-01-09 08:17:39,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:39,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 08:17:39,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:39,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 08:17:39,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:17:39,407 INFO L87 Difference]: Start difference. First operand 1111 states and 1661 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 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:39,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:39,799 INFO L93 Difference]: Finished difference Result 2997 states and 4481 transitions. [2025-01-09 08:17:39,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 08:17:39,800 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 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:39,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:39,807 INFO L225 Difference]: With dead ends: 2997 [2025-01-09 08:17:39,808 INFO L226 Difference]: Without dead ends: 2004 [2025-01-09 08:17:39,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-01-09 08:17:39,811 INFO L435 NwaCegarLoop]: 1623 mSDtfsCounter, 2930 mSDsluCounter, 9736 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2930 SdHoareTripleChecker+Valid, 11359 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:39,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2930 Valid, 11359 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:17:39,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2025-01-09 08:17:39,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1123. [2025-01-09 08:17:39,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1122 states have (on average 1.4955436720142603) internal successors, (1678), 1122 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:39,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1678 transitions. [2025-01-09 08:17:39,839 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1678 transitions. Word has length 83 [2025-01-09 08:17:39,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:39,839 INFO L471 AbstractCegarLoop]: Abstraction has 1123 states and 1678 transitions. [2025-01-09 08:17:39,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 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:39,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1678 transitions. [2025-01-09 08:17:39,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 08:17:39,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:39,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:17:39,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:17:39,841 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:39,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:39,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1954969637, now seen corresponding path program 1 times [2025-01-09 08:17:39,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:39,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926195892] [2025-01-09 08:17:39,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:39,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:39,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 08:17:39,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 08:17:39,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:39,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:40,378 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:40,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:40,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926195892] [2025-01-09 08:17:40,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926195892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:40,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:40,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:17:40,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833190098] [2025-01-09 08:17:40,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:40,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:17:40,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:40,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:17:40,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:17:40,383 INFO L87 Difference]: Start difference. First operand 1123 states and 1678 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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:40,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:40,654 INFO L93 Difference]: Finished difference Result 2998 states and 4481 transitions. [2025-01-09 08:17:40,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:17:40,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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:40,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:40,662 INFO L225 Difference]: With dead ends: 2998 [2025-01-09 08:17:40,662 INFO L226 Difference]: Without dead ends: 2005 [2025-01-09 08:17:40,664 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:40,665 INFO L435 NwaCegarLoop]: 1629 mSDtfsCounter, 4237 mSDsluCounter, 5838 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4237 SdHoareTripleChecker+Valid, 7467 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:40,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4237 Valid, 7467 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:17:40,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2025-01-09 08:17:40,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1133. [2025-01-09 08:17:40,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1132 states have (on average 1.4946996466431095) internal successors, (1692), 1132 states have internal predecessors, (1692), 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:40,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1692 transitions. [2025-01-09 08:17:40,692 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1692 transitions. Word has length 84 [2025-01-09 08:17:40,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:40,693 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1692 transitions. [2025-01-09 08:17:40,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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:40,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1692 transitions. [2025-01-09 08:17:40,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 08:17:40,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:40,695 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:40,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 08:17:40,695 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:40,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:40,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1044690580, now seen corresponding path program 1 times [2025-01-09 08:17:40,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:40,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189930269] [2025-01-09 08:17:40,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:40,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:40,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 08:17:40,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 08:17:40,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:40,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:41,084 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:41,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:41,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189930269] [2025-01-09 08:17:41,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189930269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:41,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:41,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:17:41,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262213261] [2025-01-09 08:17:41,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:41,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:17:41,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:41,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:17:41,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:17:41,086 INFO L87 Difference]: Start difference. First operand 1133 states and 1692 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 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:41,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:41,249 INFO L93 Difference]: Finished difference Result 3002 states and 4485 transitions. [2025-01-09 08:17:41,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:17:41,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 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:41,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:41,255 INFO L225 Difference]: With dead ends: 3002 [2025-01-09 08:17:41,255 INFO L226 Difference]: Without dead ends: 1998 [2025-01-09 08:17:41,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:17:41,258 INFO L435 NwaCegarLoop]: 1634 mSDtfsCounter, 4225 mSDsluCounter, 3263 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4225 SdHoareTripleChecker+Valid, 4897 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:41,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4225 Valid, 4897 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:17:41,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2025-01-09 08:17:41,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1128. [2025-01-09 08:17:41,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1127 states have (on average 1.4942324755989351) internal successors, (1684), 1127 states have internal predecessors, (1684), 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:41,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1684 transitions. [2025-01-09 08:17:41,282 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1684 transitions. Word has length 85 [2025-01-09 08:17:41,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:41,282 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1684 transitions. [2025-01-09 08:17:41,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 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:41,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1684 transitions. [2025-01-09 08:17:41,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 08:17:41,284 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:41,284 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:41,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 08:17:41,284 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:41,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:41,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1979140564, now seen corresponding path program 1 times [2025-01-09 08:17:41,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:41,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212130680] [2025-01-09 08:17:41,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:41,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:41,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 08:17:41,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 08:17:41,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:41,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:41,788 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:41,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:41,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212130680] [2025-01-09 08:17:41,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212130680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:41,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:41,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:17:41,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4303307] [2025-01-09 08:17:41,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:41,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:17:41,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:41,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:17:41,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:17:41,790 INFO L87 Difference]: Start difference. First operand 1128 states and 1684 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 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:42,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:42,037 INFO L93 Difference]: Finished difference Result 2996 states and 4475 transitions. [2025-01-09 08:17:42,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:17:42,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 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:42,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:42,047 INFO L225 Difference]: With dead ends: 2996 [2025-01-09 08:17:42,047 INFO L226 Difference]: Without dead ends: 1995 [2025-01-09 08:17:42,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:17:42,050 INFO L435 NwaCegarLoop]: 1632 mSDtfsCounter, 4220 mSDsluCounter, 6518 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4220 SdHoareTripleChecker+Valid, 8150 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:42,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4220 Valid, 8150 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:17:42,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2025-01-09 08:17:42,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1125. [2025-01-09 08:17:42,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.49288256227758) internal successors, (1678), 1124 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:42,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1678 transitions. [2025-01-09 08:17:42,084 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1678 transitions. Word has length 85 [2025-01-09 08:17:42,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:42,085 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1678 transitions. [2025-01-09 08:17:42,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 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:42,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1678 transitions. [2025-01-09 08:17:42,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 08:17:42,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:42,086 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:42,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 08:17:42,086 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:42,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:42,087 INFO L85 PathProgramCache]: Analyzing trace with hash -357824823, now seen corresponding path program 1 times [2025-01-09 08:17:42,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:42,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027820243] [2025-01-09 08:17:42,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:42,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:42,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 08:17:42,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 08:17:42,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:42,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:42,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:42,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:42,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027820243] [2025-01-09 08:17:42,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027820243] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:42,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:42,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:17:42,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699953351] [2025-01-09 08:17:42,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:42,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:17:42,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:42,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:17:42,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:17:42,365 INFO L87 Difference]: Start difference. First operand 1125 states and 1678 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:42,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:42,547 INFO L93 Difference]: Finished difference Result 2985 states and 4459 transitions. [2025-01-09 08:17:42,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:17:42,548 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:42,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:42,554 INFO L225 Difference]: With dead ends: 2985 [2025-01-09 08:17:42,554 INFO L226 Difference]: Without dead ends: 1992 [2025-01-09 08:17:42,556 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:42,557 INFO L435 NwaCegarLoop]: 1633 mSDtfsCounter, 4206 mSDsluCounter, 3262 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4206 SdHoareTripleChecker+Valid, 4895 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:42,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4206 Valid, 4895 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:17:42,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2025-01-09 08:17:42,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1125. [2025-01-09 08:17:42,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.4919928825622777) internal successors, (1677), 1124 states have internal predecessors, (1677), 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:42,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1677 transitions. [2025-01-09 08:17:42,611 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1677 transitions. Word has length 86 [2025-01-09 08:17:42,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:42,611 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1677 transitions. [2025-01-09 08:17:42,611 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:42,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1677 transitions. [2025-01-09 08:17:42,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 08:17:42,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:42,612 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:42,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 08:17:42,612 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:42,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:42,613 INFO L85 PathProgramCache]: Analyzing trace with hash 924453349, now seen corresponding path program 1 times [2025-01-09 08:17:42,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:42,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499074807] [2025-01-09 08:17:42,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:42,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:42,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 08:17:42,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 08:17:42,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:42,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:43,139 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:43,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:43,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499074807] [2025-01-09 08:17:43,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499074807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:43,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:43,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 08:17:43,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229336823] [2025-01-09 08:17:43,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:43,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:17:43,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:43,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:17:43,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:17:43,141 INFO L87 Difference]: Start difference. First operand 1125 states and 1677 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 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:43,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:43,339 INFO L93 Difference]: Finished difference Result 2129 states and 3178 transitions. [2025-01-09 08:17:43,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:17:43,340 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 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:43,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:43,345 INFO L225 Difference]: With dead ends: 2129 [2025-01-09 08:17:43,345 INFO L226 Difference]: Without dead ends: 1136 [2025-01-09 08:17:43,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-09 08:17:43,349 INFO L435 NwaCegarLoop]: 1639 mSDtfsCounter, 1659 mSDsluCounter, 4936 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1659 SdHoareTripleChecker+Valid, 6575 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:43,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1659 Valid, 6575 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:17:43,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2025-01-09 08:17:43,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1128. [2025-01-09 08:17:43,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1127 states have (on average 1.4915705412599822) internal successors, (1681), 1127 states have internal predecessors, (1681), 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:43,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1681 transitions. [2025-01-09 08:17:43,376 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1681 transitions. Word has length 86 [2025-01-09 08:17:43,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:43,376 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1681 transitions. [2025-01-09 08:17:43,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 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:43,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1681 transitions. [2025-01-09 08:17:43,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 08:17:43,377 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:43,377 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:43,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 08:17:43,377 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:43,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:43,377 INFO L85 PathProgramCache]: Analyzing trace with hash -352659839, now seen corresponding path program 1 times [2025-01-09 08:17:43,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:43,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342094151] [2025-01-09 08:17:43,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:43,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:43,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 08:17:43,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 08:17:43,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:43,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:43,968 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:43,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:43,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342094151] [2025-01-09 08:17:43,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342094151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:43,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:43,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 08:17:43,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195008553] [2025-01-09 08:17:43,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:43,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 08:17:43,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:43,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 08:17:43,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:17:43,970 INFO L87 Difference]: Start difference. First operand 1128 states and 1681 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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:44,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:44,098 INFO L93 Difference]: Finished difference Result 2129 states and 3178 transitions. [2025-01-09 08:17:44,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 08:17:44,099 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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:44,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:44,102 INFO L225 Difference]: With dead ends: 2129 [2025-01-09 08:17:44,102 INFO L226 Difference]: Without dead ends: 1136 [2025-01-09 08:17:44,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:17:44,104 INFO L435 NwaCegarLoop]: 1641 mSDtfsCounter, 1590 mSDsluCounter, 9811 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 11452 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:44,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 11452 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:17:44,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2025-01-09 08:17:44,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1134. [2025-01-09 08:17:44,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 1133 states have (on average 1.4907325684024713) internal successors, (1689), 1133 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:44,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1689 transitions. [2025-01-09 08:17:44,120 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1689 transitions. Word has length 87 [2025-01-09 08:17:44,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:44,120 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1689 transitions. [2025-01-09 08:17:44,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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:44,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1689 transitions. [2025-01-09 08:17:44,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 08:17:44,121 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:44,121 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:44,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 08:17:44,121 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:44,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:44,121 INFO L85 PathProgramCache]: Analyzing trace with hash 200195173, now seen corresponding path program 1 times [2025-01-09 08:17:44,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:44,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832834743] [2025-01-09 08:17:44,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:44,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:44,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 08:17:44,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 08:17:44,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:44,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:44,498 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:44,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:44,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832834743] [2025-01-09 08:17:44,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832834743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:44,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:44,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:17:44,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373684079] [2025-01-09 08:17:44,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:44,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:17:44,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:44,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:17:44,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:17:44,501 INFO L87 Difference]: Start difference. First operand 1134 states and 1689 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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:44,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:44,749 INFO L93 Difference]: Finished difference Result 3002 states and 4480 transitions. [2025-01-09 08:17:44,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:17:44,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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:44,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:44,755 INFO L225 Difference]: With dead ends: 3002 [2025-01-09 08:17:44,755 INFO L226 Difference]: Without dead ends: 2003 [2025-01-09 08:17:44,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:17:44,758 INFO L435 NwaCegarLoop]: 1633 mSDtfsCounter, 4197 mSDsluCounter, 3262 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4197 SdHoareTripleChecker+Valid, 4895 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:44,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4197 Valid, 4895 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:17:44,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2025-01-09 08:17:44,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1134. [2025-01-09 08:17:44,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 1133 states have (on average 1.4898499558693734) internal successors, (1688), 1133 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:44,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1688 transitions. [2025-01-09 08:17:44,783 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1688 transitions. Word has length 87 [2025-01-09 08:17:44,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:44,784 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1688 transitions. [2025-01-09 08:17:44,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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:44,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1688 transitions. [2025-01-09 08:17:44,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 08:17:44,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:44,784 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:44,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 08:17:44,785 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:44,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:44,785 INFO L85 PathProgramCache]: Analyzing trace with hash -777974822, now seen corresponding path program 1 times [2025-01-09 08:17:44,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:44,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884329059] [2025-01-09 08:17:44,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:44,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:44,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 08:17:44,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 08:17:44,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:44,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:45,379 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:45,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:45,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884329059] [2025-01-09 08:17:45,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884329059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:45,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:45,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 08:17:45,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234858553] [2025-01-09 08:17:45,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:45,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 08:17:45,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:45,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 08:17:45,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-01-09 08:17:45,381 INFO L87 Difference]: Start difference. First operand 1134 states and 1688 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 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:45,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:45,665 INFO L93 Difference]: Finished difference Result 2153 states and 3211 transitions. [2025-01-09 08:17:45,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 08:17:45,665 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 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:45,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:45,669 INFO L225 Difference]: With dead ends: 2153 [2025-01-09 08:17:45,669 INFO L226 Difference]: Without dead ends: 1154 [2025-01-09 08:17:45,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-01-09 08:17:45,671 INFO L435 NwaCegarLoop]: 1633 mSDtfsCounter, 8 mSDsluCounter, 19562 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 21195 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:45,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 21195 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:17:45,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2025-01-09 08:17:45,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1148. [2025-01-09 08:17:45,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1147 states have (on average 1.4908456843940714) internal successors, (1710), 1147 states have internal predecessors, (1710), 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:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1710 transitions. [2025-01-09 08:17:45,693 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1710 transitions. Word has length 88 [2025-01-09 08:17:45,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:45,694 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1710 transitions. [2025-01-09 08:17:45,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 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:45,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1710 transitions. [2025-01-09 08:17:45,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 08:17:45,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:45,695 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:45,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 08:17:45,695 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:45,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:45,695 INFO L85 PathProgramCache]: Analyzing trace with hash -901214846, now seen corresponding path program 1 times [2025-01-09 08:17:45,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:45,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693016125] [2025-01-09 08:17:45,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:45,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:45,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 08:17:45,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 08:17:45,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:45,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:46,801 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:46,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:46,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693016125] [2025-01-09 08:17:46,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693016125] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:46,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:46,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 08:17:46,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270734678] [2025-01-09 08:17:46,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:46,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 08:17:46,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:46,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 08:17:46,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-01-09 08:17:46,803 INFO L87 Difference]: Start difference. First operand 1148 states and 1710 transitions. Second operand has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 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:47,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:47,033 INFO L93 Difference]: Finished difference Result 2164 states and 3228 transitions. [2025-01-09 08:17:47,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 08:17:47,033 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 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:47,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:47,037 INFO L225 Difference]: With dead ends: 2164 [2025-01-09 08:17:47,037 INFO L226 Difference]: Without dead ends: 1151 [2025-01-09 08:17:47,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-01-09 08:17:47,039 INFO L435 NwaCegarLoop]: 1640 mSDtfsCounter, 6 mSDsluCounter, 14721 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 16361 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:47,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 16361 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:17:47,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2025-01-09 08:17:47,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1148. [2025-01-09 08:17:47,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1147 states have (on average 1.4899738448125546) internal successors, (1709), 1147 states have internal predecessors, (1709), 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:47,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1709 transitions. [2025-01-09 08:17:47,060 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1709 transitions. Word has length 88 [2025-01-09 08:17:47,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:47,061 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1709 transitions. [2025-01-09 08:17:47,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 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:47,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1709 transitions. [2025-01-09 08:17:47,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 08:17:47,063 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:47,063 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:47,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 08:17:47,064 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:47,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:47,064 INFO L85 PathProgramCache]: Analyzing trace with hash 71591773, now seen corresponding path program 1 times [2025-01-09 08:17:47,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:47,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338551179] [2025-01-09 08:17:47,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:47,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:47,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 08:17:47,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 08:17:47,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:47,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:47,302 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:47,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:47,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338551179] [2025-01-09 08:17:47,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338551179] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:47,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:47,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 08:17:47,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810629503] [2025-01-09 08:17:47,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:47,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 08:17:47,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:47,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 08:17:47,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 08:17:47,304 INFO L87 Difference]: Start difference. First operand 1148 states and 1709 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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:47,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:47,340 INFO L93 Difference]: Finished difference Result 2161 states and 3223 transitions. [2025-01-09 08:17:47,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 08:17:47,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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:47,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:47,344 INFO L225 Difference]: With dead ends: 2161 [2025-01-09 08:17:47,345 INFO L226 Difference]: Without dead ends: 1148 [2025-01-09 08:17:47,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 08:17:47,347 INFO L435 NwaCegarLoop]: 1652 mSDtfsCounter, 1 mSDsluCounter, 1649 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3301 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:47,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3301 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:17:47,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2025-01-09 08:17:47,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1147. [2025-01-09 08:17:47,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 1146 states have (on average 1.4886561954624782) internal successors, (1706), 1146 states have internal predecessors, (1706), 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:47,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1706 transitions. [2025-01-09 08:17:47,372 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1706 transitions. Word has length 89 [2025-01-09 08:17:47,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:47,374 INFO L471 AbstractCegarLoop]: Abstraction has 1147 states and 1706 transitions. [2025-01-09 08:17:47,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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:47,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1706 transitions. [2025-01-09 08:17:47,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 08:17:47,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:47,376 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:47,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 08:17:47,376 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:47,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:47,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1173607042, now seen corresponding path program 1 times [2025-01-09 08:17:47,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:47,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106340588] [2025-01-09 08:17:47,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:47,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:47,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 08:17:47,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 08:17:47,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:47,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:17:47,432 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 08:17:47,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 08:17:47,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 08:17:47,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:47,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:17:47,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 08:17:47,530 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 08:17:47,531 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 08:17:47,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 08:17:47,534 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:17:47,594 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 08:17:47,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 08:17:47 BoogieIcfgContainer [2025-01-09 08:17:47,596 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 08:17:47,596 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 08:17:47,596 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 08:17:47,597 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 08:17:47,597 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:36" (3/4) ... [2025-01-09 08:17:47,598 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 08:17:47,599 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 08:17:47,599 INFO L158 Benchmark]: Toolchain (without parser) took 16706.45ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 111.2MB in the beginning and 245.3MB in the end (delta: -134.1MB). Peak memory consumption was 208.1MB. Max. memory is 16.1GB. [2025-01-09 08:17:47,600 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 226.5MB. Free memory is still 145.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:17:47,600 INFO L158 Benchmark]: CACSL2BoogieTranslator took 741.53ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 80.3MB in the end (delta: 30.4MB). Peak memory consumption was 97.7MB. Max. memory is 16.1GB. [2025-01-09 08:17:47,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 491.37ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 80.3MB in the beginning and 254.6MB in the end (delta: -174.3MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. [2025-01-09 08:17:47,600 INFO L158 Benchmark]: Boogie Preprocessor took 517.97ms. Allocated memory is still 369.1MB. Free memory was 254.6MB in the beginning and 216.2MB in the end (delta: 38.4MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2025-01-09 08:17:47,600 INFO L158 Benchmark]: RCFGBuilder took 3964.38ms. Allocated memory is still 369.1MB. Free memory was 216.2MB in the beginning and 82.0MB in the end (delta: 134.2MB). Peak memory consumption was 168.5MB. Max. memory is 16.1GB. [2025-01-09 08:17:47,601 INFO L158 Benchmark]: TraceAbstraction took 10977.52ms. Allocated memory was 369.1MB in the beginning and 478.2MB in the end (delta: 109.1MB). Free memory was 78.8MB in the beginning and 245.3MB in the end (delta: -166.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:17:47,601 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 478.2MB. Free memory was 245.3MB in the beginning and 245.3MB in the end (delta: 16.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:17:47,602 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.14ms. Allocated memory is still 226.5MB. Free memory is still 145.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 741.53ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 80.3MB in the end (delta: 30.4MB). Peak memory consumption was 97.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 491.37ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 80.3MB in the beginning and 254.6MB in the end (delta: -174.3MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 517.97ms. Allocated memory is still 369.1MB. Free memory was 254.6MB in the beginning and 216.2MB in the end (delta: 38.4MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. * RCFGBuilder took 3964.38ms. Allocated memory is still 369.1MB. Free memory was 216.2MB in the beginning and 82.0MB in the end (delta: 134.2MB). Peak memory consumption was 168.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10977.52ms. Allocated memory was 369.1MB in the beginning and 478.2MB in the end (delta: 109.1MB). Free memory was 78.8MB in the beginning and 245.3MB in the end (delta: -166.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 478.2MB. Free memory was 245.3MB in the beginning and 245.3MB in the end (delta: 16.7kB). 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 bitwiseOr at line 376. 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_28 = 0; [L46] const SORT_21 var_32 = 2; [L47] const SORT_21 var_35 = 4; [L48] const SORT_21 var_38 = 64; [L49] const SORT_3 var_45 = 1; [L50] const SORT_3 var_49 = 0; [L51] const SORT_6 var_134 = 0; [L52] const SORT_21 var_728 = 8; [L53] const SORT_21 var_748 = 16; [L54] const SORT_21 var_763 = 32; [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_356; [L72] SORT_3 input_378; [L73] SORT_3 input_393; [L74] SORT_3 input_408; [L75] SORT_3 input_423; [L76] SORT_3 input_438; [L77] SORT_3 input_453; [L78] SORT_3 input_468; [L79] SORT_3 input_483; [L80] SORT_3 input_498; [L81] SORT_3 input_513; [L82] SORT_3 input_528; [L83] SORT_3 input_543; [L84] SORT_3 input_558; [L85] SORT_3 input_573; [L86] SORT_3 input_588; [L87] SORT_3 input_604; [L88] SORT_3 input_606; [L89] SORT_3 input_608; [L90] SORT_3 input_610; [L91] SORT_3 input_612; [L92] SORT_3 input_614; [L93] SORT_3 input_616; [L94] SORT_3 input_618; [L95] SORT_3 input_623; [L96] SORT_21 input_664; [L97] SORT_21 input_665; [L98] SORT_21 input_666; [L99] SORT_21 input_667; [L100] SORT_21 input_670; [L101] SORT_21 input_674; [L102] SORT_21 input_678; [L103] SORT_21 input_686; [L104] SORT_21 input_690; [L105] SORT_21 input_692; [L106] SORT_21 input_696; [L107] SORT_21 input_699; [L108] SORT_21 input_703; [L109] SORT_21 input_708; [L110] SORT_21 input_712; [L111] SORT_21 input_717; [L112] SORT_21 input_719; [L113] SORT_21 input_720; [L114] SORT_21 input_722; [L115] SORT_21 input_726; [L116] SORT_21 input_732; [L117] SORT_21 input_739; [L118] SORT_21 input_740; [L119] SORT_21 input_742; [L120] SORT_21 input_746; [L121] SORT_21 input_752; [L122] SORT_21 input_754; [L123] SORT_21 input_755; [L124] SORT_21 input_757; [L125] SORT_21 input_761; [L126] SORT_21 input_767; [L127] SORT_21 input_771; [L128] SORT_21 input_776; [L129] SORT_21 input_778; [L130] SORT_21 input_784; [L131] SORT_21 input_796; [L132] SORT_3 input_801; [L133] SORT_3 input_810; [L134] SORT_3 input_829; [L135] SORT_3 input_836; [L136] SORT_3 input_847; [L137] SORT_3 input_853; [L138] SORT_3 input_859; [L139] SORT_3 input_865; [L140] SORT_3 input_871; [L141] SORT_3 input_877; [L142] SORT_3 input_883; [L143] SORT_3 input_889; [L144] SORT_3 input_895; [L145] SORT_3 input_901; [L146] SORT_3 input_907; [L147] SORT_3 input_913; [L148] SORT_3 input_919; [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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L150] SORT_21 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_21; [L151] 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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L151] SORT_21 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_21; [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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L152] SORT_3 state_50 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L153] SORT_3 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L154] 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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L154] SORT_3 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_3; [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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L155] SORT_3 state_58 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L156] SORT_3 state_62 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L157] SORT_3 state_66 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L158] SORT_3 state_82 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L159] SORT_3 state_99 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L160] SORT_3 state_102 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L161] SORT_3 state_104 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L162] SORT_3 state_108 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L163] SORT_3 state_112 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L164] SORT_3 state_117 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L165] SORT_3 state_120 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L166] SORT_3 state_130 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L167] SORT_3 state_137 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L168] SORT_3 state_140 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L169] SORT_3 state_149 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L170] SORT_3 state_154 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L171] SORT_3 state_157 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L172] SORT_3 state_169 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L173] SORT_3 state_179 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L174] SORT_3 state_184 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L175] SORT_3 state_187 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L176] SORT_3 state_196 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L177] SORT_3 state_209 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L178] SORT_3 state_222 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L180] SORT_21 init_24_arg_1 = var_22; [L181] state_23 = init_24_arg_1 [L182] SORT_21 init_27_arg_1 = var_22; [L183] state_26 = init_27_arg_1 [L184] SORT_3 init_51_arg_1 = var_49; [L185] state_50 = init_51_arg_1 [L186] SORT_3 init_53_arg_1 = var_49; [L187] state_52 = init_53_arg_1 [L188] SORT_3 init_55_arg_1 = var_49; [L189] state_54 = init_55_arg_1 [L190] SORT_3 init_59_arg_1 = var_49; [L191] state_58 = init_59_arg_1 [L192] SORT_3 init_63_arg_1 = var_49; [L193] state_62 = init_63_arg_1 [L194] SORT_3 init_67_arg_1 = var_49; [L195] state_66 = init_67_arg_1 [L196] SORT_3 init_83_arg_1 = var_49; [L197] state_82 = init_83_arg_1 [L198] SORT_3 init_100_arg_1 = var_49; [L199] state_99 = init_100_arg_1 [L200] SORT_3 init_103_arg_1 = var_49; [L201] state_102 = init_103_arg_1 [L202] SORT_3 init_105_arg_1 = var_49; [L203] state_104 = init_105_arg_1 [L204] SORT_3 init_109_arg_1 = var_49; [L205] state_108 = init_109_arg_1 [L206] SORT_3 init_113_arg_1 = var_49; [L207] state_112 = init_113_arg_1 [L208] SORT_3 init_118_arg_1 = var_49; [L209] state_117 = init_118_arg_1 [L210] SORT_3 init_121_arg_1 = var_49; [L211] state_120 = init_121_arg_1 [L212] SORT_3 init_131_arg_1 = var_49; [L213] state_130 = init_131_arg_1 [L214] SORT_3 init_138_arg_1 = var_49; [L215] state_137 = init_138_arg_1 [L216] SORT_3 init_141_arg_1 = var_49; [L217] state_140 = init_141_arg_1 [L218] SORT_3 init_150_arg_1 = var_49; [L219] state_149 = init_150_arg_1 [L220] SORT_3 init_155_arg_1 = var_49; [L221] state_154 = init_155_arg_1 [L222] SORT_3 init_158_arg_1 = var_49; [L223] state_157 = init_158_arg_1 [L224] SORT_3 init_170_arg_1 = var_49; [L225] state_169 = init_170_arg_1 [L226] SORT_3 init_180_arg_1 = var_49; [L227] state_179 = init_180_arg_1 [L228] SORT_3 init_185_arg_1 = var_49; [L229] state_184 = init_185_arg_1 [L230] SORT_3 init_188_arg_1 = var_49; [L231] state_187 = init_188_arg_1 [L232] SORT_3 init_197_arg_1 = var_49; [L233] state_196 = init_197_arg_1 [L234] SORT_3 init_210_arg_1 = var_49; [L235] state_209 = init_210_arg_1 [L236] SORT_3 init_223_arg_1 = var_49; [L237] state_222 = init_223_arg_1 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [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_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [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_356 = __VERIFIER_nondet_uchar() [L257] input_378 = __VERIFIER_nondet_uchar() [L258] input_393 = __VERIFIER_nondet_uchar() [L259] input_408 = __VERIFIER_nondet_uchar() [L260] input_423 = __VERIFIER_nondet_uchar() [L261] input_438 = __VERIFIER_nondet_uchar() [L262] input_453 = __VERIFIER_nondet_uchar() [L263] input_468 = __VERIFIER_nondet_uchar() [L264] input_483 = __VERIFIER_nondet_uchar() [L265] input_498 = __VERIFIER_nondet_uchar() [L266] input_513 = __VERIFIER_nondet_uchar() [L267] input_528 = __VERIFIER_nondet_uchar() [L268] input_543 = __VERIFIER_nondet_uchar() [L269] input_558 = __VERIFIER_nondet_uchar() [L270] input_573 = __VERIFIER_nondet_uchar() [L271] input_588 = __VERIFIER_nondet_uchar() [L272] input_604 = __VERIFIER_nondet_uchar() [L273] input_606 = __VERIFIER_nondet_uchar() [L274] input_608 = __VERIFIER_nondet_uchar() [L275] input_610 = __VERIFIER_nondet_uchar() [L276] input_612 = __VERIFIER_nondet_uchar() [L277] input_614 = __VERIFIER_nondet_uchar() [L278] input_616 = __VERIFIER_nondet_uchar() [L279] input_618 = __VERIFIER_nondet_uchar() [L280] input_623 = __VERIFIER_nondet_uchar() [L281] input_664 = __VERIFIER_nondet_uchar() [L282] input_665 = __VERIFIER_nondet_uchar() [L283] input_666 = __VERIFIER_nondet_uchar() [L284] input_667 = __VERIFIER_nondet_uchar() [L285] input_670 = __VERIFIER_nondet_uchar() [L286] input_674 = __VERIFIER_nondet_uchar() [L287] input_678 = __VERIFIER_nondet_uchar() [L288] input_686 = __VERIFIER_nondet_uchar() [L289] input_690 = __VERIFIER_nondet_uchar() [L290] input_692 = __VERIFIER_nondet_uchar() [L291] input_696 = __VERIFIER_nondet_uchar() [L292] input_699 = __VERIFIER_nondet_uchar() [L293] input_703 = __VERIFIER_nondet_uchar() [L294] input_708 = __VERIFIER_nondet_uchar() [L295] input_712 = __VERIFIER_nondet_uchar() [L296] input_717 = __VERIFIER_nondet_uchar() [L297] input_719 = __VERIFIER_nondet_uchar() [L298] input_720 = __VERIFIER_nondet_uchar() [L299] input_722 = __VERIFIER_nondet_uchar() [L300] input_726 = __VERIFIER_nondet_uchar() [L301] input_732 = __VERIFIER_nondet_uchar() [L302] input_739 = __VERIFIER_nondet_uchar() [L303] input_740 = __VERIFIER_nondet_uchar() [L304] input_742 = __VERIFIER_nondet_uchar() [L305] input_746 = __VERIFIER_nondet_uchar() [L306] input_752 = __VERIFIER_nondet_uchar() [L307] input_754 = __VERIFIER_nondet_uchar() [L308] input_755 = __VERIFIER_nondet_uchar() [L309] input_757 = __VERIFIER_nondet_uchar() [L310] input_761 = __VERIFIER_nondet_uchar() [L311] input_767 = __VERIFIER_nondet_uchar() [L312] input_771 = __VERIFIER_nondet_uchar() [L313] input_776 = __VERIFIER_nondet_uchar() [L314] input_778 = __VERIFIER_nondet_uchar() [L315] input_784 = __VERIFIER_nondet_uchar() [L316] input_796 = __VERIFIER_nondet_uchar() [L317] input_801 = __VERIFIER_nondet_uchar() [L318] input_810 = __VERIFIER_nondet_uchar() [L319] input_829 = __VERIFIER_nondet_uchar() [L320] input_836 = __VERIFIER_nondet_uchar() [L321] input_847 = __VERIFIER_nondet_uchar() [L322] input_853 = __VERIFIER_nondet_uchar() [L323] input_859 = __VERIFIER_nondet_uchar() [L324] input_865 = __VERIFIER_nondet_uchar() [L325] input_871 = __VERIFIER_nondet_uchar() [L326] input_877 = __VERIFIER_nondet_uchar() [L327] input_883 = __VERIFIER_nondet_uchar() [L328] input_889 = __VERIFIER_nondet_uchar() [L329] input_895 = __VERIFIER_nondet_uchar() [L330] input_901 = __VERIFIER_nondet_uchar() [L331] input_907 = __VERIFIER_nondet_uchar() [L332] input_913 = __VERIFIER_nondet_uchar() [L333] input_919 = __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_29_arg_0 = state_26; [L340] SORT_21 var_29_arg_1 = var_28; [L341] SORT_3 var_29 = var_29_arg_0 == var_29_arg_1; [L342] SORT_21 var_30_arg_0 = state_26; [L343] SORT_21 var_30_arg_1 = var_22; [L344] SORT_3 var_30 = var_30_arg_0 == var_30_arg_1; [L345] SORT_3 var_31_arg_0 = var_29; [L346] 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_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_31_arg_0=0, var_31_arg_1=1, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L347] 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_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L347] SORT_3 var_31 = var_31_arg_0 | var_31_arg_1; [L348] SORT_21 var_33_arg_0 = state_26; [L349] SORT_21 var_33_arg_1 = var_32; [L350] SORT_3 var_33 = var_33_arg_0 == var_33_arg_1; [L351] SORT_3 var_34_arg_0 = var_31; [L352] 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_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_34_arg_0=1, var_34_arg_1=0, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L353] 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_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L353] SORT_3 var_34 = var_34_arg_0 | var_34_arg_1; [L354] SORT_21 var_36_arg_0 = state_26; [L355] SORT_21 var_36_arg_1 = var_35; [L356] SORT_3 var_36 = var_36_arg_0 == var_36_arg_1; [L357] SORT_3 var_37_arg_0 = var_34; [L358] 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_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_37_arg_0=1, var_37_arg_1=0, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L359] 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_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L359] SORT_3 var_37 = var_37_arg_0 | var_37_arg_1; [L360] SORT_21 var_39_arg_0 = state_26; [L361] SORT_21 var_39_arg_1 = var_38; [L362] SORT_3 var_39 = var_39_arg_0 == var_39_arg_1; [L363] SORT_3 var_40_arg_0 = var_37; [L364] 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_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_38=64, var_40_arg_0=1, var_40_arg_1=0, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L365] 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_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L365] SORT_3 var_40 = var_40_arg_0 | var_40_arg_1; [L366] SORT_3 var_41_arg_0 = var_25; [L367] SORT_3 var_41_arg_1 = var_40; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_41_arg_0=1, var_41_arg_1=1, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L368] EXPR var_41_arg_0 & var_41_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L368] SORT_3 var_41 = var_41_arg_0 & var_41_arg_1; [L369] SORT_21 var_42_arg_0 = state_23; [L370] SORT_21 var_42_arg_1 = var_22; [L371] SORT_3 var_42 = var_42_arg_0 == var_42_arg_1; [L372] SORT_3 var_43_arg_0 = var_42; [L373] SORT_3 var_43 = ~var_43_arg_0; [L374] SORT_3 var_44_arg_0 = var_41; [L375] SORT_3 var_44_arg_1 = var_43; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_44_arg_0=1, var_44_arg_1=-2, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L376] EXPR var_44_arg_0 | var_44_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L376] SORT_3 var_44 = var_44_arg_0 | var_44_arg_1; [L377] SORT_3 var_46_arg_0 = var_44; [L378] SORT_3 var_46 = ~var_46_arg_0; [L379] SORT_3 var_47_arg_0 = var_45; [L380] SORT_3 var_47_arg_1 = var_46; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_47_arg_0=1, var_47_arg_1=-255, var_49=0, var_728=8, var_748=16, var_763=32] [L381] EXPR var_47_arg_0 & var_47_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L381] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L382] EXPR var_47 & mask_SORT_3 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L382] var_47 = var_47 & mask_SORT_3 [L383] SORT_3 bad_48_arg_0 = var_47; [L384] CALL __VERIFIER_assert(!(bad_48_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27279 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27279 mSDsluCounter, 110461 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89162 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1674 IncrementalHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 21299 mSDtfsCounter, 1674 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1148occurred in iteration=11, InterpolantAutomatonStates: 94, 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, 13 MinimizatonAttempts, 5249 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 1200 NumberOfCodeBlocks, 1200 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1098 ConstructedInterpolants, 0 QuantifiedInterpolants, 4484 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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:47,642 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_p4.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 ec4ad5c3087d33b41ea5a98e18a71d9d74f551b4f0d4a83a1cb74449f522f78e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:17:49,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:17:49,940 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:49,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:17:49,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:17:49,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:17:49,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:17:49,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:17:49,973 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:17:49,973 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:17:49,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:17:49,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:17:49,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:17:49,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:17:49,974 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:17:49,974 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:17:49,974 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:17:49,974 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:17:49,974 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:17:49,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:17:49,974 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:17:49,974 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 08:17:49,974 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 08:17:49,975 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 08:17:49,975 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:17:49,975 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:17:49,975 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:17:49,975 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:17:49,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:17:49,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:17:49,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:17:49,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:17:49,975 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:17:49,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:17:49,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:17:49,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:17:49,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:17:49,976 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:17:49,976 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:17:49,976 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:17:49,976 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:17:49,976 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 08:17:49,977 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 08:17:49,977 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:17:49,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:17:49,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:17:49,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:17:49,977 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 -> ec4ad5c3087d33b41ea5a98e18a71d9d74f551b4f0d4a83a1cb74449f522f78e [2025-01-09 08:17:50,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:17:50,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:17:50,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:17:50,297 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:17:50,297 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:17:50,299 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_p4.c [2025-01-09 08:17:51,534 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f34a458a5/bfdb43e470354ad18ac584ef58599011/FLAG1578e231e [2025-01-09 08:17:51,872 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:17:51,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c [2025-01-09 08:17:51,892 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f34a458a5/bfdb43e470354ad18ac584ef58599011/FLAG1578e231e [2025-01-09 08:17:52,112 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f34a458a5/bfdb43e470354ad18ac584ef58599011 [2025-01-09 08:17:52,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:17:52,115 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:17:52,117 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:17:52,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:17:52,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:17:52,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:17:52" (1/1) ... [2025-01-09 08:17:52,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be6132d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:52, skipping insertion in model container [2025-01-09 08:17:52,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:17:52" (1/1) ... [2025-01-09 08:17:52,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:17:52,332 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_p4.c[1268,1281] [2025-01-09 08:17:52,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:17:52,602 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:17:52,609 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_p4.c[1268,1281] [2025-01-09 08:17:52,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:17:52,790 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:17:52,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:52 WrapperNode [2025-01-09 08:17:52,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:17:52,793 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:17:52,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:17:52,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:17:52,798 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:52" (1/1) ... [2025-01-09 08:17:52,828 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:52" (1/1) ... [2025-01-09 08:17:52,923 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2612 [2025-01-09 08:17:52,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:17:52,924 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:17:52,924 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:17:52,924 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:17:52,931 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:52" (1/1) ... [2025-01-09 08:17:52,931 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:52" (1/1) ... [2025-01-09 08:17:52,946 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:52" (1/1) ... [2025-01-09 08:17:52,989 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:52,989 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:52" (1/1) ... [2025-01-09 08:17:52,989 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:52" (1/1) ... [2025-01-09 08:17:53,028 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:52" (1/1) ... [2025-01-09 08:17:53,032 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:52" (1/1) ... [2025-01-09 08:17:53,036 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:52" (1/1) ... [2025-01-09 08:17:53,042 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:52" (1/1) ... [2025-01-09 08:17:53,086 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:52" (1/1) ... [2025-01-09 08:17:53,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:17:53,098 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:17:53,098 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:17:53,098 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:17:53,099 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:52" (1/1) ... [2025-01-09 08:17:53,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:17:53,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:17:53,128 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:53,132 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:53,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:17:53,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 08:17:53,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:17:53,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:17:53,479 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:17:53,480 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:17:55,434 INFO L? ?]: Removed 155 outVars from TransFormulas that were not future-live. [2025-01-09 08:17:55,434 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:17:55,441 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:17:55,441 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:17:55,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:17:55 BoogieIcfgContainer [2025-01-09 08:17:55,441 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:17:55,443 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:17:55,443 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:17:55,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:17:55,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:17:52" (1/3) ... [2025-01-09 08:17:55,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4771ef32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:17:55, skipping insertion in model container [2025-01-09 08:17:55,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:52" (2/3) ... [2025-01-09 08:17:55,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4771ef32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:17:55, skipping insertion in model container [2025-01-09 08:17:55,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:17:55" (3/3) ... [2025-01-09 08:17:55,450 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c [2025-01-09 08:17:55,460 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:17:55,462 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:17:55,496 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:17:55,503 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;@a8ddeed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:17:55,504 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:17:55,507 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:55,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 08:17:55,509 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:55,509 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 08:17:55,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:55,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:55,513 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2025-01-09 08:17:55,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:17:55,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [538509999] [2025-01-09 08:17:55,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:55,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:17:55,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:17:55,524 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:55,526 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:55,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 08:17:55,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 08:17:55,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:55,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:55,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 08:17:55,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:17:56,154 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:56,154 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:17:56,155 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:17:56,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538509999] [2025-01-09 08:17:56,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538509999] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:56,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:56,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:17:56,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391206951] [2025-01-09 08:17:56,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:56,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:17:56,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:17:56,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:17:56,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:17:56,170 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:56,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:56,221 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-01-09 08:17:56,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:17:56,223 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:56,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:56,226 INFO L225 Difference]: With dead ends: 17 [2025-01-09 08:17:56,226 INFO L226 Difference]: Without dead ends: 9 [2025-01-09 08:17:56,228 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:56,229 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:56,230 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.0s Time] [2025-01-09 08:17:56,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-01-09 08:17:56,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-01-09 08:17:56,258 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:56,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-01-09 08:17:56,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-01-09 08:17:56,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:56,265 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-01-09 08:17:56,265 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:56,265 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-01-09 08:17:56,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 08:17:56,266 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:56,266 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-09 08:17:56,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 08:17:56,470 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:56,470 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:56,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:56,471 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2025-01-09 08:17:56,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:17:56,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [802372146] [2025-01-09 08:17:56,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:56,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:17:56,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:17:56,476 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:56,477 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:56,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 08:17:57,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 08:17:57,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:57,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:57,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-01-09 08:17:57,086 INFO L279 TraceCheckSpWp]: Computing forward predicates...