./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_p2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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_p2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7eccc5bbdbaf49f286af1eaa6e037aac70bd43bbdd029365a1ddd6424cc3712f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:10:18,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:10:18,601 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 20:10:18,606 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:10:18,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:10:18,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:10:18,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:10:18,623 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:10:18,623 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:10:18,623 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:10:18,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:10:18,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:10:18,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:10:18,624 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:10:18,624 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:10:18,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:10:18,625 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:10:18,625 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:10:18,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:10:18,625 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:10:18,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:10:18,625 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:10:18,625 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:10:18,625 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:10:18,625 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:10:18,625 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:10:18,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:10:18,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:10:18,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:10:18,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:10:18,626 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:10:18,626 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:10:18,626 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:10:18,626 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:10:18,627 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:10:18,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:10:18,627 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:10:18,627 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:10:18,627 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:10:18,627 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:10:18,627 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 -> 7eccc5bbdbaf49f286af1eaa6e037aac70bd43bbdd029365a1ddd6424cc3712f [2025-02-05 20:10:18,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:10:18,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:10:18,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:10:18,841 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:10:18,841 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:10:18,843 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_p2.c [2025-02-05 20:10:19,995 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc1220c04/24a2592d06e74fd5b68701490ba49a5e/FLAG66cb0951f [2025-02-05 20:10:20,374 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:10:20,375 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c [2025-02-05 20:10:20,395 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc1220c04/24a2592d06e74fd5b68701490ba49a5e/FLAG66cb0951f [2025-02-05 20:10:20,411 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc1220c04/24a2592d06e74fd5b68701490ba49a5e [2025-02-05 20:10:20,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:10:20,414 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:10:20,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:10:20,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:10:20,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:10:20,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:10:20" (1/1) ... [2025-02-05 20:10:20,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6030ab17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:20, skipping insertion in model container [2025-02-05 20:10:20,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:10:20" (1/1) ... [2025-02-05 20:10:20,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:10:20,608 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_p2.c[1268,1281] [2025-02-05 20:10:20,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:10:20,876 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:10:20,883 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_p2.c[1268,1281] [2025-02-05 20:10:21,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:10:21,057 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:10:21,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:21 WrapperNode [2025-02-05 20:10:21,057 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:10:21,058 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:10:21,058 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:10:21,058 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:10:21,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:21" (1/1) ... [2025-02-05 20:10:21,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:21" (1/1) ... [2025-02-05 20:10:21,427 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4880 [2025-02-05 20:10:21,427 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:10:21,428 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:10:21,428 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:10:21,428 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:10:21,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:21" (1/1) ... [2025-02-05 20:10:21,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:21" (1/1) ... [2025-02-05 20:10:21,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:21" (1/1) ... [2025-02-05 20:10:21,669 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-02-05 20:10:21,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:21" (1/1) ... [2025-02-05 20:10:21,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:21" (1/1) ... [2025-02-05 20:10:21,797 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:21" (1/1) ... [2025-02-05 20:10:21,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:21" (1/1) ... [2025-02-05 20:10:21,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:21" (1/1) ... [2025-02-05 20:10:21,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:21" (1/1) ... [2025-02-05 20:10:21,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:10:21,968 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:10:21,968 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:10:21,968 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:10:21,969 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:21" (1/1) ... [2025-02-05 20:10:21,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:10:21,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:10:21,996 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-02-05 20:10:21,999 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-02-05 20:10:22,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:10:22,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:10:22,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:10:22,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:10:22,374 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:10:22,376 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:10:25,662 INFO L? ?]: Removed 3163 outVars from TransFormulas that were not future-live. [2025-02-05 20:10:25,662 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:10:25,788 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:10:25,788 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:10:25,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:10:25 BoogieIcfgContainer [2025-02-05 20:10:25,788 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:10:25,790 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:10:25,790 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:10:25,831 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:10:25,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:10:20" (1/3) ... [2025-02-05 20:10:25,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b38367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:10:25, skipping insertion in model container [2025-02-05 20:10:25,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:21" (2/3) ... [2025-02-05 20:10:25,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b38367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:10:25, skipping insertion in model container [2025-02-05 20:10:25,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:10:25" (3/3) ... [2025-02-05 20:10:25,835 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c [2025-02-05 20:10:25,846 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:10:25,848 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c that has 1 procedures, 1130 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:10:25,908 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:10:25,917 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;@2c5f0976, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:10:25,917 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:10:25,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 1130 states, 1128 states have (on average 1.499113475177305) internal successors, (1691), 1129 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:25,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 20:10:25,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:25,932 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:25,933 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:25,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:25,937 INFO L85 PathProgramCache]: Analyzing trace with hash -890080077, now seen corresponding path program 1 times [2025-02-05 20:10:25,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:25,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326533742] [2025-02-05 20:10:25,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:25,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:26,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 20:10:26,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 20:10:26,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:26,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:26,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:26,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:26,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326533742] [2025-02-05 20:10:26,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326533742] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:26,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:26,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:10:26,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338398921] [2025-02-05 20:10:26,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:26,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:10:26,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:26,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:10:26,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:10:26,685 INFO L87 Difference]: Start difference. First operand has 1130 states, 1128 states have (on average 1.499113475177305) internal successors, (1691), 1129 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:27,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:27,216 INFO L93 Difference]: Finished difference Result 2141 states and 3207 transitions. [2025-02-05 20:10:27,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:10:27,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-02-05 20:10:27,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:27,230 INFO L225 Difference]: With dead ends: 2141 [2025-02-05 20:10:27,234 INFO L226 Difference]: Without dead ends: 1129 [2025-02-05 20:10:27,241 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-02-05 20:10:27,243 INFO L435 NwaCegarLoop]: 1405 mSDtfsCounter, 0 mSDsluCounter, 2805 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4210 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:27,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4210 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:10:27,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2025-02-05 20:10:27,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1129. [2025-02-05 20:10:27,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 1128 states have (on average 1.497340425531915) internal successors, (1689), 1128 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-02-05 20:10:27,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1689 transitions. [2025-02-05 20:10:27,311 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1689 transitions. Word has length 91 [2025-02-05 20:10:27,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:27,312 INFO L471 AbstractCegarLoop]: Abstraction has 1129 states and 1689 transitions. [2025-02-05 20:10:27,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:27,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1689 transitions. [2025-02-05 20:10:27,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 20:10:27,316 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:27,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:27,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 20:10:27,316 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:27,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:27,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1817997807, now seen corresponding path program 1 times [2025-02-05 20:10:27,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:27,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308017189] [2025-02-05 20:10:27,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:27,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:27,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 20:10:27,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 20:10:27,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:27,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:27,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:27,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:27,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308017189] [2025-02-05 20:10:27,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308017189] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:27,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:27,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:10:27,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397260645] [2025-02-05 20:10:27,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:27,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:10:27,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:27,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:10:27,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:10:27,640 INFO L87 Difference]: Start difference. First operand 1129 states and 1689 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:28,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:28,128 INFO L93 Difference]: Finished difference Result 2142 states and 3205 transitions. [2025-02-05 20:10:28,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:10:28,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-02-05 20:10:28,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:28,134 INFO L225 Difference]: With dead ends: 2142 [2025-02-05 20:10:28,134 INFO L226 Difference]: Without dead ends: 1131 [2025-02-05 20:10:28,136 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-02-05 20:10:28,137 INFO L435 NwaCegarLoop]: 1405 mSDtfsCounter, 0 mSDsluCounter, 2802 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4207 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:28,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4207 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:10:28,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2025-02-05 20:10:28,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1131. [2025-02-05 20:10:28,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 1130 states have (on average 1.4964601769911505) internal successors, (1691), 1130 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:28,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1691 transitions. [2025-02-05 20:10:28,160 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1691 transitions. Word has length 92 [2025-02-05 20:10:28,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:28,161 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 1691 transitions. [2025-02-05 20:10:28,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:28,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1691 transitions. [2025-02-05 20:10:28,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 20:10:28,164 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:28,164 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:28,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:10:28,165 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:28,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:28,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1408153710, now seen corresponding path program 1 times [2025-02-05 20:10:28,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:28,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828944675] [2025-02-05 20:10:28,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:28,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:28,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 20:10:28,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 20:10:28,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:28,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:28,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:28,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:28,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828944675] [2025-02-05 20:10:28,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828944675] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:28,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:28,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:10:28,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905414981] [2025-02-05 20:10:28,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:28,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:10:28,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:28,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:10:28,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:10:28,730 INFO L87 Difference]: Start difference. First operand 1131 states and 1691 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:29,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:29,411 INFO L93 Difference]: Finished difference Result 2148 states and 3212 transitions. [2025-02-05 20:10:29,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:10:29,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-02-05 20:10:29,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:29,416 INFO L225 Difference]: With dead ends: 2148 [2025-02-05 20:10:29,416 INFO L226 Difference]: Without dead ends: 1135 [2025-02-05 20:10:29,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:10:29,419 INFO L435 NwaCegarLoop]: 1399 mSDtfsCounter, 1610 mSDsluCounter, 4188 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1610 SdHoareTripleChecker+Valid, 5587 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:29,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1610 Valid, 5587 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:10:29,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2025-02-05 20:10:29,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1134. [2025-02-05 20:10:29,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 1133 states have (on average 1.4951456310679612) internal successors, (1694), 1133 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:29,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1694 transitions. [2025-02-05 20:10:29,440 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1694 transitions. Word has length 93 [2025-02-05 20:10:29,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:29,441 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1694 transitions. [2025-02-05 20:10:29,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:29,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1694 transitions. [2025-02-05 20:10:29,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 20:10:29,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:29,443 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:29,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:10:29,443 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:29,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:29,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1723994197, now seen corresponding path program 1 times [2025-02-05 20:10:29,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:29,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860779497] [2025-02-05 20:10:29,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:29,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:29,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 20:10:29,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 20:10:29,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:29,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:30,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:30,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:30,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860779497] [2025-02-05 20:10:30,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860779497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:30,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:30,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:10:30,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428964201] [2025-02-05 20:10:30,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:30,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:10:30,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:30,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:10:30,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:10:30,157 INFO L87 Difference]: Start difference. First operand 1134 states and 1694 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 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-02-05 20:10:30,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:30,771 INFO L93 Difference]: Finished difference Result 2195 states and 3279 transitions. [2025-02-05 20:10:30,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:10:30,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-02-05 20:10:30,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:30,777 INFO L225 Difference]: With dead ends: 2195 [2025-02-05 20:10:30,777 INFO L226 Difference]: Without dead ends: 1179 [2025-02-05 20:10:30,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:10:30,779 INFO L435 NwaCegarLoop]: 1388 mSDtfsCounter, 1756 mSDsluCounter, 2774 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1756 SdHoareTripleChecker+Valid, 4162 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:30,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1756 Valid, 4162 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:10:30,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2025-02-05 20:10:30,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1140. [2025-02-05 20:10:30,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1139 states have (on average 1.4942932396839332) internal successors, (1702), 1139 states have internal predecessors, (1702), 0 states have call successors, (0), 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-02-05 20:10:30,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1702 transitions. [2025-02-05 20:10:30,796 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1702 transitions. Word has length 94 [2025-02-05 20:10:30,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:30,796 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1702 transitions. [2025-02-05 20:10:30,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 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-02-05 20:10:30,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1702 transitions. [2025-02-05 20:10:30,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 20:10:30,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:30,797 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:30,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:10:30,798 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:30,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:30,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1008409467, now seen corresponding path program 1 times [2025-02-05 20:10:30,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:30,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957624307] [2025-02-05 20:10:30,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:30,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:30,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 20:10:30,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 20:10:30,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:30,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:31,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:31,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:31,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957624307] [2025-02-05 20:10:31,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957624307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:31,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:31,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:10:31,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616503173] [2025-02-05 20:10:31,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:31,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:10:31,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:31,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:10:31,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:10:31,243 INFO L87 Difference]: Start difference. First operand 1140 states and 1702 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 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-02-05 20:10:31,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:31,990 INFO L93 Difference]: Finished difference Result 2176 states and 3250 transitions. [2025-02-05 20:10:31,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:10:31,991 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-02-05 20:10:31,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:31,995 INFO L225 Difference]: With dead ends: 2176 [2025-02-05 20:10:31,995 INFO L226 Difference]: Without dead ends: 1160 [2025-02-05 20:10:31,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:10:31,997 INFO L435 NwaCegarLoop]: 1400 mSDtfsCounter, 19 mSDsluCounter, 5606 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 7006 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:31,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 7006 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:10:31,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2025-02-05 20:10:32,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1157. [2025-02-05 20:10:32,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.4930795847750864) internal successors, (1726), 1156 states have internal predecessors, (1726), 0 states have call successors, (0), 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-02-05 20:10:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1726 transitions. [2025-02-05 20:10:32,017 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1726 transitions. Word has length 95 [2025-02-05 20:10:32,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:32,017 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1726 transitions. [2025-02-05 20:10:32,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 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-02-05 20:10:32,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1726 transitions. [2025-02-05 20:10:32,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 20:10:32,018 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:32,018 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:32,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 20:10:32,018 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:32,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:32,019 INFO L85 PathProgramCache]: Analyzing trace with hash -227194711, now seen corresponding path program 1 times [2025-02-05 20:10:32,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:32,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653063139] [2025-02-05 20:10:32,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:32,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:32,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 20:10:32,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 20:10:32,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:32,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:32,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:32,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:32,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653063139] [2025-02-05 20:10:32,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653063139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:32,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:32,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:10:32,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494505620] [2025-02-05 20:10:32,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:32,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:10:32,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:32,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:10:32,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:10:32,695 INFO L87 Difference]: Start difference. First operand 1157 states and 1726 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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-02-05 20:10:33,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:33,520 INFO L93 Difference]: Finished difference Result 2244 states and 3347 transitions. [2025-02-05 20:10:33,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:10:33,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-02-05 20:10:33,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:33,525 INFO L225 Difference]: With dead ends: 2244 [2025-02-05 20:10:33,525 INFO L226 Difference]: Without dead ends: 1211 [2025-02-05 20:10:33,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:10:33,527 INFO L435 NwaCegarLoop]: 1388 mSDtfsCounter, 1758 mSDsluCounter, 5541 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1758 SdHoareTripleChecker+Valid, 6929 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:33,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1758 Valid, 6929 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 20:10:33,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2025-02-05 20:10:33,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1187. [2025-02-05 20:10:33,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 1186 states have (on average 1.4915682967959527) internal successors, (1769), 1186 states have internal predecessors, (1769), 0 states have call successors, (0), 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-02-05 20:10:33,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1769 transitions. [2025-02-05 20:10:33,546 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1769 transitions. Word has length 96 [2025-02-05 20:10:33,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:33,547 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 1769 transitions. [2025-02-05 20:10:33,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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-02-05 20:10:33,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1769 transitions. [2025-02-05 20:10:33,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 20:10:33,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:33,548 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:33,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 20:10:33,548 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:33,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:33,549 INFO L85 PathProgramCache]: Analyzing trace with hash -132282706, now seen corresponding path program 1 times [2025-02-05 20:10:33,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:33,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023991744] [2025-02-05 20:10:33,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:33,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:33,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 20:10:33,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 20:10:33,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:33,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:34,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:34,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:34,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023991744] [2025-02-05 20:10:34,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023991744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:34,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:34,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 20:10:34,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919662596] [2025-02-05 20:10:34,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:34,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:10:34,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:34,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:10:34,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:10:34,143 INFO L87 Difference]: Start difference. First operand 1187 states and 1769 transitions. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 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-02-05 20:10:34,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:34,841 INFO L93 Difference]: Finished difference Result 2248 states and 3351 transitions. [2025-02-05 20:10:34,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 20:10:34,841 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-02-05 20:10:34,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:34,845 INFO L225 Difference]: With dead ends: 2248 [2025-02-05 20:10:34,845 INFO L226 Difference]: Without dead ends: 1215 [2025-02-05 20:10:34,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-02-05 20:10:34,847 INFO L435 NwaCegarLoop]: 1382 mSDtfsCounter, 1806 mSDsluCounter, 2950 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1806 SdHoareTripleChecker+Valid, 4332 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:34,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1806 Valid, 4332 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:10:34,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2025-02-05 20:10:34,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1192. [2025-02-05 20:10:34,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 1191 states have (on average 1.489504617968094) internal successors, (1774), 1191 states have internal predecessors, (1774), 0 states have call successors, (0), 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-02-05 20:10:34,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1774 transitions. [2025-02-05 20:10:34,866 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1774 transitions. Word has length 96 [2025-02-05 20:10:34,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:34,867 INFO L471 AbstractCegarLoop]: Abstraction has 1192 states and 1774 transitions. [2025-02-05 20:10:34,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 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-02-05 20:10:34,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1774 transitions. [2025-02-05 20:10:34,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 20:10:34,868 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:34,868 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:34,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 20:10:34,868 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:34,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:34,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1417813231, now seen corresponding path program 1 times [2025-02-05 20:10:34,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:34,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802876428] [2025-02-05 20:10:34,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:34,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:34,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 20:10:34,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 20:10:34,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:34,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:35,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:35,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:35,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802876428] [2025-02-05 20:10:35,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802876428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:35,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:35,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:10:35,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370882090] [2025-02-05 20:10:35,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:35,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:10:35,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:35,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:10:35,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:10:35,243 INFO L87 Difference]: Start difference. First operand 1192 states and 1774 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 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-02-05 20:10:35,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:35,798 INFO L93 Difference]: Finished difference Result 2240 states and 3338 transitions. [2025-02-05 20:10:35,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:10:35,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-02-05 20:10:35,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:35,801 INFO L225 Difference]: With dead ends: 2240 [2025-02-05 20:10:35,802 INFO L226 Difference]: Without dead ends: 1192 [2025-02-05 20:10:35,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:10:35,804 INFO L435 NwaCegarLoop]: 1389 mSDtfsCounter, 1737 mSDsluCounter, 2775 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1737 SdHoareTripleChecker+Valid, 4164 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:35,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1737 Valid, 4164 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:10:35,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2025-02-05 20:10:35,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1177. [2025-02-05 20:10:35,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1176 states have (on average 1.489795918367347) internal successors, (1752), 1176 states have internal predecessors, (1752), 0 states have call successors, (0), 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-02-05 20:10:35,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1752 transitions. [2025-02-05 20:10:35,821 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1752 transitions. Word has length 96 [2025-02-05 20:10:35,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:35,822 INFO L471 AbstractCegarLoop]: Abstraction has 1177 states and 1752 transitions. [2025-02-05 20:10:35,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 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-02-05 20:10:35,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1752 transitions. [2025-02-05 20:10:35,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 20:10:35,823 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:35,824 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:35,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 20:10:35,824 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:35,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:35,826 INFO L85 PathProgramCache]: Analyzing trace with hash -392004320, now seen corresponding path program 1 times [2025-02-05 20:10:35,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:35,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553748556] [2025-02-05 20:10:35,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:35,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:35,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 20:10:35,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 20:10:35,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:35,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:36,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:36,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:36,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553748556] [2025-02-05 20:10:36,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553748556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:36,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:36,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 20:10:36,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305945249] [2025-02-05 20:10:36,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:36,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 20:10:36,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:36,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 20:10:36,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-02-05 20:10:36,675 INFO L87 Difference]: Start difference. First operand 1177 states and 1752 transitions. Second operand has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 15 states have internal predecessors, (97), 0 states have call successors, (0), 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-02-05 20:10:37,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:37,869 INFO L93 Difference]: Finished difference Result 2232 states and 3327 transitions. [2025-02-05 20:10:37,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 20:10:37,869 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 15 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-02-05 20:10:37,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:37,872 INFO L225 Difference]: With dead ends: 2232 [2025-02-05 20:10:37,873 INFO L226 Difference]: Without dead ends: 1199 [2025-02-05 20:10:37,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2025-02-05 20:10:37,875 INFO L435 NwaCegarLoop]: 1378 mSDtfsCounter, 1751 mSDsluCounter, 7046 mSDsCounter, 0 mSdLazyCounter, 2011 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1751 SdHoareTripleChecker+Valid, 8424 SdHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:37,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1751 Valid, 8424 Invalid, 2014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2011 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 20:10:37,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2025-02-05 20:10:37,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1184. [2025-02-05 20:10:37,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1183 states have (on average 1.4894336432797972) internal successors, (1762), 1183 states have internal predecessors, (1762), 0 states have call successors, (0), 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-02-05 20:10:37,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1762 transitions. [2025-02-05 20:10:37,893 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1762 transitions. Word has length 97 [2025-02-05 20:10:37,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:37,893 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1762 transitions. [2025-02-05 20:10:37,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 15 states have internal predecessors, (97), 0 states have call successors, (0), 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-02-05 20:10:37,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1762 transitions. [2025-02-05 20:10:37,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 20:10:37,894 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:37,894 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:37,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 20:10:37,895 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:37,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:37,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1533973439, now seen corresponding path program 1 times [2025-02-05 20:10:37,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:37,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015394493] [2025-02-05 20:10:37,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:37,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:37,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 20:10:37,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 20:10:37,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:37,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:38,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:38,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:38,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015394493] [2025-02-05 20:10:38,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015394493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:38,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:38,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:10:38,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92051932] [2025-02-05 20:10:38,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:38,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:10:38,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:38,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:10:38,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:10:38,253 INFO L87 Difference]: Start difference. First operand 1184 states and 1762 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 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-02-05 20:10:38,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:38,856 INFO L93 Difference]: Finished difference Result 2227 states and 3318 transitions. [2025-02-05 20:10:38,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:10:38,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-02-05 20:10:38,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:38,859 INFO L225 Difference]: With dead ends: 2227 [2025-02-05 20:10:38,860 INFO L226 Difference]: Without dead ends: 1194 [2025-02-05 20:10:38,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:10:38,861 INFO L435 NwaCegarLoop]: 1388 mSDtfsCounter, 1719 mSDsluCounter, 2773 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1719 SdHoareTripleChecker+Valid, 4161 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:38,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1719 Valid, 4161 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:10:38,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2025-02-05 20:10:38,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1184. [2025-02-05 20:10:38,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1183 states have (on average 1.4885883347421809) internal successors, (1761), 1183 states have internal predecessors, (1761), 0 states have call successors, (0), 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-02-05 20:10:38,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1761 transitions. [2025-02-05 20:10:38,879 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1761 transitions. Word has length 98 [2025-02-05 20:10:38,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:38,879 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1761 transitions. [2025-02-05 20:10:38,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 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-02-05 20:10:38,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1761 transitions. [2025-02-05 20:10:38,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 20:10:38,880 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:38,880 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:38,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 20:10:38,880 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:38,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:38,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1936900920, now seen corresponding path program 1 times [2025-02-05 20:10:38,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:38,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84416346] [2025-02-05 20:10:38,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:38,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:38,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 20:10:38,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 20:10:38,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:38,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:39,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:39,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:39,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84416346] [2025-02-05 20:10:39,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84416346] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:39,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:39,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:10:39,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103085793] [2025-02-05 20:10:39,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:39,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:10:39,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:39,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:10:39,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:10:39,232 INFO L87 Difference]: Start difference. First operand 1184 states and 1761 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 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-02-05 20:10:39,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:39,818 INFO L93 Difference]: Finished difference Result 2230 states and 3320 transitions. [2025-02-05 20:10:39,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:10:39,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-02-05 20:10:39,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:39,822 INFO L225 Difference]: With dead ends: 2230 [2025-02-05 20:10:39,822 INFO L226 Difference]: Without dead ends: 1194 [2025-02-05 20:10:39,823 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-02-05 20:10:39,824 INFO L435 NwaCegarLoop]: 1386 mSDtfsCounter, 1716 mSDsluCounter, 2841 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1716 SdHoareTripleChecker+Valid, 4227 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:39,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1716 Valid, 4227 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:10:39,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2025-02-05 20:10:39,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1184. [2025-02-05 20:10:39,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1183 states have (on average 1.4877430262045646) internal successors, (1760), 1183 states have internal predecessors, (1760), 0 states have call successors, (0), 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-02-05 20:10:39,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1760 transitions. [2025-02-05 20:10:39,839 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1760 transitions. Word has length 98 [2025-02-05 20:10:39,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:39,839 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1760 transitions. [2025-02-05 20:10:39,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 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-02-05 20:10:39,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1760 transitions. [2025-02-05 20:10:39,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 20:10:39,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:39,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:39,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 20:10:39,841 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:39,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:39,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1060826437, now seen corresponding path program 1 times [2025-02-05 20:10:39,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:39,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172116892] [2025-02-05 20:10:39,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:39,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:39,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 20:10:39,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 20:10:39,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:39,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:40,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:40,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172116892] [2025-02-05 20:10:40,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172116892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:40,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:40,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 20:10:40,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439970739] [2025-02-05 20:10:40,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:40,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:10:40,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:40,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:10:40,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:10:40,338 INFO L87 Difference]: Start difference. First operand 1184 states and 1760 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 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-02-05 20:10:41,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:41,263 INFO L93 Difference]: Finished difference Result 2231 states and 3322 transitions. [2025-02-05 20:10:41,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:10:41,263 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-02-05 20:10:41,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:41,266 INFO L225 Difference]: With dead ends: 2231 [2025-02-05 20:10:41,266 INFO L226 Difference]: Without dead ends: 1198 [2025-02-05 20:10:41,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-02-05 20:10:41,267 INFO L435 NwaCegarLoop]: 1383 mSDtfsCounter, 1726 mSDsluCounter, 8287 mSDsCounter, 0 mSdLazyCounter, 2139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1726 SdHoareTripleChecker+Valid, 9670 SdHoareTripleChecker+Invalid, 2139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:41,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1726 Valid, 9670 Invalid, 2139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2139 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 20:10:41,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2025-02-05 20:10:41,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1186. [2025-02-05 20:10:41,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 1185 states have (on average 1.4869198312236287) internal successors, (1762), 1185 states have internal predecessors, (1762), 0 states have call successors, (0), 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-02-05 20:10:41,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1762 transitions. [2025-02-05 20:10:41,281 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1762 transitions. Word has length 99 [2025-02-05 20:10:41,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:41,282 INFO L471 AbstractCegarLoop]: Abstraction has 1186 states and 1762 transitions. [2025-02-05 20:10:41,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 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-02-05 20:10:41,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1762 transitions. [2025-02-05 20:10:41,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 20:10:41,283 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:41,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:41,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 20:10:41,283 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:41,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:41,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1501562545, now seen corresponding path program 1 times [2025-02-05 20:10:41,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:41,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561035336] [2025-02-05 20:10:41,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:41,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:41,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 20:10:41,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 20:10:41,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:41,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:41,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:41,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:41,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561035336] [2025-02-05 20:10:41,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561035336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:41,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:41,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:10:41,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293030983] [2025-02-05 20:10:41,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:41,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:10:41,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:41,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:10:41,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:10:41,546 INFO L87 Difference]: Start difference. First operand 1186 states and 1762 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 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-02-05 20:10:42,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:42,091 INFO L93 Difference]: Finished difference Result 2222 states and 3308 transitions. [2025-02-05 20:10:42,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:10:42,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-02-05 20:10:42,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:42,094 INFO L225 Difference]: With dead ends: 2222 [2025-02-05 20:10:42,094 INFO L226 Difference]: Without dead ends: 1189 [2025-02-05 20:10:42,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:10:42,096 INFO L435 NwaCegarLoop]: 1388 mSDtfsCounter, 1702 mSDsluCounter, 2773 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1702 SdHoareTripleChecker+Valid, 4161 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:42,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1702 Valid, 4161 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:10:42,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2025-02-05 20:10:42,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1186. [2025-02-05 20:10:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 1185 states have (on average 1.4860759493670885) internal successors, (1761), 1185 states have internal predecessors, (1761), 0 states have call successors, (0), 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-02-05 20:10:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1761 transitions. [2025-02-05 20:10:42,111 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1761 transitions. Word has length 99 [2025-02-05 20:10:42,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:42,111 INFO L471 AbstractCegarLoop]: Abstraction has 1186 states and 1761 transitions. [2025-02-05 20:10:42,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 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-02-05 20:10:42,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1761 transitions. [2025-02-05 20:10:42,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 20:10:42,112 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:42,112 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:42,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 20:10:42,113 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:42,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:42,113 INFO L85 PathProgramCache]: Analyzing trace with hash -520262984, now seen corresponding path program 1 times [2025-02-05 20:10:42,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:42,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709400623] [2025-02-05 20:10:42,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:42,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:42,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 20:10:42,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 20:10:42,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:42,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:42,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:42,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:42,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709400623] [2025-02-05 20:10:42,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709400623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:42,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:42,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:10:42,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86770830] [2025-02-05 20:10:42,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:42,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:10:42,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:42,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:10:42,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:10:42,541 INFO L87 Difference]: Start difference. First operand 1186 states and 1761 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 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-02-05 20:10:43,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:43,032 INFO L93 Difference]: Finished difference Result 2226 states and 3313 transitions. [2025-02-05 20:10:43,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:10:43,033 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-02-05 20:10:43,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:43,035 INFO L225 Difference]: With dead ends: 2226 [2025-02-05 20:10:43,035 INFO L226 Difference]: Without dead ends: 1193 [2025-02-05 20:10:43,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:10:43,036 INFO L435 NwaCegarLoop]: 1386 mSDtfsCounter, 1701 mSDsluCounter, 2833 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1701 SdHoareTripleChecker+Valid, 4219 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:43,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1701 Valid, 4219 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:10:43,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2025-02-05 20:10:43,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1189. [2025-02-05 20:10:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 1188 states have (on average 1.4856902356902357) internal successors, (1765), 1188 states have internal predecessors, (1765), 0 states have call successors, (0), 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-02-05 20:10:43,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1765 transitions. [2025-02-05 20:10:43,047 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1765 transitions. Word has length 100 [2025-02-05 20:10:43,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:43,048 INFO L471 AbstractCegarLoop]: Abstraction has 1189 states and 1765 transitions. [2025-02-05 20:10:43,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 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-02-05 20:10:43,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1765 transitions. [2025-02-05 20:10:43,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 20:10:43,048 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:43,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:43,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 20:10:43,048 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:43,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:43,049 INFO L85 PathProgramCache]: Analyzing trace with hash 347199033, now seen corresponding path program 1 times [2025-02-05 20:10:43,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:43,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345691748] [2025-02-05 20:10:43,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:43,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:43,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 20:10:43,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 20:10:43,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:43,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:43,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:43,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345691748] [2025-02-05 20:10:43,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345691748] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:43,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:43,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-05 20:10:43,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036629426] [2025-02-05 20:10:43,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:43,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 20:10:43,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:43,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 20:10:43,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-02-05 20:10:43,856 INFO L87 Difference]: Start difference. First operand 1189 states and 1765 transitions. Second operand has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 states have internal predecessors, (100), 0 states have call successors, (0), 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-02-05 20:10:45,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:45,609 INFO L93 Difference]: Finished difference Result 2252 states and 3352 transitions. [2025-02-05 20:10:45,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 20:10:45,609 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-02-05 20:10:45,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:45,612 INFO L225 Difference]: With dead ends: 2252 [2025-02-05 20:10:45,612 INFO L226 Difference]: Without dead ends: 1219 [2025-02-05 20:10:45,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2025-02-05 20:10:45,615 INFO L435 NwaCegarLoop]: 1388 mSDtfsCounter, 1653 mSDsluCounter, 22152 mSDsCounter, 0 mSdLazyCounter, 5425 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1653 SdHoareTripleChecker+Valid, 23540 SdHoareTripleChecker+Invalid, 5426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:45,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1653 Valid, 23540 Invalid, 5426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5425 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 20:10:45,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2025-02-05 20:10:45,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1209. [2025-02-05 20:10:45,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 1208 states have (on average 1.4884105960264902) internal successors, (1798), 1208 states have internal predecessors, (1798), 0 states have call successors, (0), 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-02-05 20:10:45,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1798 transitions. [2025-02-05 20:10:45,627 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1798 transitions. Word has length 100 [2025-02-05 20:10:45,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:45,627 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1798 transitions. [2025-02-05 20:10:45,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 states have internal predecessors, (100), 0 states have call successors, (0), 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-02-05 20:10:45,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1798 transitions. [2025-02-05 20:10:45,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 20:10:45,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:45,628 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:45,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 20:10:45,628 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:45,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:45,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1100829718, now seen corresponding path program 1 times [2025-02-05 20:10:45,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:45,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236428694] [2025-02-05 20:10:45,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:45,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:45,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 20:10:45,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 20:10:45,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:45,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:46,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:46,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:46,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236428694] [2025-02-05 20:10:46,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236428694] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:46,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:46,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 20:10:46,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137729315] [2025-02-05 20:10:46,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:46,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:10:46,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:46,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:10:46,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:10:46,255 INFO L87 Difference]: Start difference. First operand 1209 states and 1798 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 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-02-05 20:10:47,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:47,371 INFO L93 Difference]: Finished difference Result 3162 states and 4709 transitions. [2025-02-05 20:10:47,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:10:47,372 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-02-05 20:10:47,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:47,376 INFO L225 Difference]: With dead ends: 3162 [2025-02-05 20:10:47,376 INFO L226 Difference]: Without dead ends: 2082 [2025-02-05 20:10:47,377 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-02-05 20:10:47,378 INFO L435 NwaCegarLoop]: 1378 mSDtfsCounter, 2964 mSDsluCounter, 8261 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2964 SdHoareTripleChecker+Valid, 9639 SdHoareTripleChecker+Invalid, 2173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:47,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2964 Valid, 9639 Invalid, 2173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2170 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 20:10:47,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2025-02-05 20:10:47,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 1215. [2025-02-05 20:10:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 1214 states have (on average 1.486820428336079) internal successors, (1805), 1214 states have internal predecessors, (1805), 0 states have call successors, (0), 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-02-05 20:10:47,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1805 transitions. [2025-02-05 20:10:47,391 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1805 transitions. Word has length 101 [2025-02-05 20:10:47,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:47,391 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1805 transitions. [2025-02-05 20:10:47,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 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-02-05 20:10:47,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1805 transitions. [2025-02-05 20:10:47,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 20:10:47,392 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:47,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:47,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 20:10:47,392 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:47,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:47,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1831163283, now seen corresponding path program 1 times [2025-02-05 20:10:47,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:47,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368297795] [2025-02-05 20:10:47,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:47,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:47,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 20:10:47,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 20:10:47,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:47,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:47,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:47,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:47,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368297795] [2025-02-05 20:10:47,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368297795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:47,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:47,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:10:47,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902884690] [2025-02-05 20:10:47,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:47,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:10:47,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:47,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:10:47,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:10:47,683 INFO L87 Difference]: Start difference. First operand 1215 states and 1805 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 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-02-05 20:10:48,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:48,516 INFO L93 Difference]: Finished difference Result 3162 states and 4705 transitions. [2025-02-05 20:10:48,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:10:48,516 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2025-02-05 20:10:48,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:48,522 INFO L225 Difference]: With dead ends: 3162 [2025-02-05 20:10:48,522 INFO L226 Difference]: Without dead ends: 2082 [2025-02-05 20:10:48,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:10:48,525 INFO L435 NwaCegarLoop]: 1381 mSDtfsCounter, 4277 mSDsluCounter, 5519 mSDsCounter, 0 mSdLazyCounter, 1535 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4277 SdHoareTripleChecker+Valid, 6900 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:48,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4277 Valid, 6900 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1535 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 20:10:48,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2025-02-05 20:10:48,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 1216. [2025-02-05 20:10:48,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 1215 states have (on average 1.4839506172839507) internal successors, (1803), 1215 states have internal predecessors, (1803), 0 states have call successors, (0), 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-02-05 20:10:48,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1803 transitions. [2025-02-05 20:10:48,544 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1803 transitions. Word has length 102 [2025-02-05 20:10:48,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:48,544 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1803 transitions. [2025-02-05 20:10:48,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 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-02-05 20:10:48,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1803 transitions. [2025-02-05 20:10:48,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 20:10:48,545 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:48,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:48,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 20:10:48,545 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:48,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:48,546 INFO L85 PathProgramCache]: Analyzing trace with hash 148546607, now seen corresponding path program 1 times [2025-02-05 20:10:48,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:48,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297155770] [2025-02-05 20:10:48,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:48,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:48,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 20:10:48,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 20:10:48,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:48,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:10:48,611 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:10:48,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 20:10:48,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 20:10:48,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:48,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:10:48,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:10:48,726 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:10:48,727 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:10:48,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 20:10:48,732 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:48,782 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-05 20:10:48,800 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:10:48,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:10:48 BoogieIcfgContainer [2025-02-05 20:10:48,803 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:10:48,803 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:10:48,803 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:10:48,803 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:10:48,804 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:10:25" (3/4) ... [2025-02-05 20:10:48,805 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:10:48,806 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:10:48,807 INFO L158 Benchmark]: Toolchain (without parser) took 28392.34ms. Allocated memory was 167.8MB in the beginning and 604.0MB in the end (delta: 436.2MB). Free memory was 117.8MB in the beginning and 208.8MB in the end (delta: -91.1MB). Peak memory consumption was 348.4MB. Max. memory is 16.1GB. [2025-02-05 20:10:48,807 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:10:48,807 INFO L158 Benchmark]: CACSL2BoogieTranslator took 642.51ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 117.6MB in the beginning and 105.9MB in the end (delta: 11.7MB). Peak memory consumption was 119.2MB. Max. memory is 16.1GB. [2025-02-05 20:10:48,807 INFO L158 Benchmark]: Boogie Procedure Inliner took 369.33ms. Allocated memory is still 176.2MB. Free memory was 105.9MB in the beginning and 58.7MB in the end (delta: 47.2MB). Peak memory consumption was 98.4MB. Max. memory is 16.1GB. [2025-02-05 20:10:48,807 INFO L158 Benchmark]: Boogie Preprocessor took 538.11ms. Allocated memory was 176.2MB in the beginning and 427.8MB in the end (delta: 251.7MB). Free memory was 58.7MB in the beginning and 280.5MB in the end (delta: -221.7MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. [2025-02-05 20:10:48,807 INFO L158 Benchmark]: IcfgBuilder took 3820.69ms. Allocated memory is still 427.8MB. Free memory was 280.5MB in the beginning and 73.3MB in the end (delta: 207.2MB). Peak memory consumption was 218.5MB. Max. memory is 16.1GB. [2025-02-05 20:10:48,808 INFO L158 Benchmark]: TraceAbstraction took 23012.43ms. Allocated memory was 427.8MB in the beginning and 604.0MB in the end (delta: 176.2MB). Free memory was 72.7MB in the beginning and 208.9MB in the end (delta: -136.2MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. [2025-02-05 20:10:48,809 INFO L158 Benchmark]: Witness Printer took 2.90ms. Allocated memory is still 604.0MB. Free memory was 208.9MB in the beginning and 208.8MB in the end (delta: 52.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:10:48,810 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.54ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 642.51ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 117.6MB in the beginning and 105.9MB in the end (delta: 11.7MB). Peak memory consumption was 119.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 369.33ms. Allocated memory is still 176.2MB. Free memory was 105.9MB in the beginning and 58.7MB in the end (delta: 47.2MB). Peak memory consumption was 98.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 538.11ms. Allocated memory was 176.2MB in the beginning and 427.8MB in the end (delta: 251.7MB). Free memory was 58.7MB in the beginning and 280.5MB in the end (delta: -221.7MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. * IcfgBuilder took 3820.69ms. Allocated memory is still 427.8MB. Free memory was 280.5MB in the beginning and 73.3MB in the end (delta: 207.2MB). Peak memory consumption was 218.5MB. Max. memory is 16.1GB. * TraceAbstraction took 23012.43ms. Allocated memory was 427.8MB in the beginning and 604.0MB in the end (delta: 176.2MB). Free memory was 72.7MB in the beginning and 208.9MB in the end (delta: -136.2MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. * Witness Printer took 2.90ms. Allocated memory is still 604.0MB. Free memory was 208.9MB in the beginning and 208.8MB in the end (delta: 52.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 409. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 2); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (2 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 3); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (3 - 1); [L35] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 4); [L36] const SORT_12 msb_SORT_12 = (SORT_12)1 << (4 - 1); [L38] const SORT_16 mask_SORT_16 = (SORT_16)-1 >> (sizeof(SORT_16) * 8 - 8); [L39] const SORT_16 msb_SORT_16 = (SORT_16)1 << (8 - 1); [L41] const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 7); [L42] const SORT_21 msb_SORT_21 = (SORT_21)1 << (7 - 1); [L44] const SORT_21 var_22 = 1; [L45] const SORT_21 var_26 = 2; [L46] const SORT_21 var_29 = 4; [L47] const SORT_21 var_33 = 8; [L48] const SORT_21 var_37 = 0; [L49] const SORT_21 var_46 = 16; [L50] const SORT_21 var_49 = 32; [L51] const SORT_21 var_52 = 64; [L52] const SORT_3 var_57 = 1; [L53] const SORT_3 var_61 = 0; [L54] const SORT_6 var_146 = 0; [L56] SORT_1 input_2; [L57] SORT_3 input_4; [L58] SORT_3 input_5; [L59] SORT_6 input_7; [L60] SORT_3 input_8; [L61] SORT_3 input_9; [L62] SORT_3 input_10; [L63] SORT_3 input_11; [L64] SORT_12 input_13; [L65] SORT_3 input_14; [L66] SORT_3 input_15; [L67] SORT_16 input_17; [L68] SORT_3 input_18; [L69] SORT_3 input_19; [L70] SORT_3 input_20; [L71] SORT_3 input_368; [L72] SORT_3 input_390; [L73] SORT_3 input_405; [L74] SORT_3 input_420; [L75] SORT_3 input_435; [L76] SORT_3 input_450; [L77] SORT_3 input_465; [L78] SORT_3 input_480; [L79] SORT_3 input_495; [L80] SORT_3 input_510; [L81] SORT_3 input_525; [L82] SORT_3 input_540; [L83] SORT_3 input_555; [L84] SORT_3 input_570; [L85] SORT_3 input_585; [L86] SORT_3 input_600; [L87] SORT_3 input_616; [L88] SORT_3 input_618; [L89] SORT_3 input_620; [L90] SORT_3 input_622; [L91] SORT_3 input_624; [L92] SORT_3 input_626; [L93] SORT_3 input_628; [L94] SORT_3 input_630; [L95] SORT_3 input_635; [L96] SORT_21 input_676; [L97] SORT_21 input_677; [L98] SORT_21 input_678; [L99] SORT_21 input_679; [L100] SORT_21 input_682; [L101] SORT_21 input_686; [L102] SORT_21 input_690; [L103] SORT_21 input_698; [L104] SORT_21 input_702; [L105] SORT_21 input_704; [L106] SORT_21 input_708; [L107] SORT_21 input_711; [L108] SORT_21 input_715; [L109] SORT_21 input_720; [L110] SORT_21 input_724; [L111] SORT_21 input_729; [L112] SORT_21 input_731; [L113] SORT_21 input_732; [L114] SORT_21 input_734; [L115] SORT_21 input_738; [L116] SORT_21 input_743; [L117] SORT_21 input_750; [L118] SORT_21 input_751; [L119] SORT_21 input_753; [L120] SORT_21 input_757; [L121] SORT_21 input_762; [L122] SORT_21 input_764; [L123] SORT_21 input_765; [L124] SORT_21 input_767; [L125] SORT_21 input_771; [L126] SORT_21 input_776; [L127] SORT_21 input_780; [L128] SORT_21 input_785; [L129] SORT_21 input_787; [L130] SORT_21 input_793; [L131] SORT_21 input_805; [L132] SORT_3 input_810; [L133] SORT_3 input_819; [L134] SORT_3 input_838; [L135] SORT_3 input_845; [L136] SORT_3 input_856; [L137] SORT_3 input_862; [L138] SORT_3 input_868; [L139] SORT_3 input_874; [L140] SORT_3 input_880; [L141] SORT_3 input_886; [L142] SORT_3 input_892; [L143] SORT_3 input_898; [L144] SORT_3 input_904; [L145] SORT_3 input_910; [L146] SORT_3 input_916; [L147] SORT_3 input_922; [L148] SORT_3 input_928; [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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L151] SORT_21 state_31 = __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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L152] SORT_3 state_62 = __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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L153] SORT_3 state_64 = __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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L154] SORT_3 state_66 = __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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L155] SORT_3 state_70 = __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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L156] SORT_3 state_74 = __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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L157] SORT_3 state_78 = __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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L158] SORT_3 state_94 = __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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L159] SORT_3 state_111 = __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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L160] SORT_3 state_114 = __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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L161] SORT_3 state_116 = __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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L162] SORT_3 state_120 = __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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L163] SORT_3 state_124 = __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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L164] SORT_3 state_129 = __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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L165] SORT_3 state_132 = __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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L166] SORT_3 state_142 = __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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L167] SORT_3 state_149 = __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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L168] SORT_3 state_152 = __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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L169] SORT_3 state_161 = __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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L170] SORT_3 state_166 = __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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L171] SORT_3 state_169 = __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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L172] SORT_3 state_181 = __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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L173] SORT_3 state_191 = __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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L174] SORT_3 state_196 = __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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L175] SORT_3 state_199 = __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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L176] SORT_3 state_208 = __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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L177] SORT_3 state_221 = __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_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L178] SORT_3 state_234 = __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_32_arg_1 = var_22; [L183] state_31 = init_32_arg_1 [L184] SORT_3 init_63_arg_1 = var_61; [L185] state_62 = init_63_arg_1 [L186] SORT_3 init_65_arg_1 = var_61; [L187] state_64 = init_65_arg_1 [L188] SORT_3 init_67_arg_1 = var_61; [L189] state_66 = init_67_arg_1 [L190] SORT_3 init_71_arg_1 = var_61; [L191] state_70 = init_71_arg_1 [L192] SORT_3 init_75_arg_1 = var_61; [L193] state_74 = init_75_arg_1 [L194] SORT_3 init_79_arg_1 = var_61; [L195] state_78 = init_79_arg_1 [L196] SORT_3 init_95_arg_1 = var_61; [L197] state_94 = init_95_arg_1 [L198] SORT_3 init_112_arg_1 = var_61; [L199] state_111 = init_112_arg_1 [L200] SORT_3 init_115_arg_1 = var_61; [L201] state_114 = init_115_arg_1 [L202] SORT_3 init_117_arg_1 = var_61; [L203] state_116 = init_117_arg_1 [L204] SORT_3 init_121_arg_1 = var_61; [L205] state_120 = init_121_arg_1 [L206] SORT_3 init_125_arg_1 = var_61; [L207] state_124 = init_125_arg_1 [L208] SORT_3 init_130_arg_1 = var_61; [L209] state_129 = init_130_arg_1 [L210] SORT_3 init_133_arg_1 = var_61; [L211] state_132 = init_133_arg_1 [L212] SORT_3 init_143_arg_1 = var_61; [L213] state_142 = init_143_arg_1 [L214] SORT_3 init_150_arg_1 = var_61; [L215] state_149 = init_150_arg_1 [L216] SORT_3 init_153_arg_1 = var_61; [L217] state_152 = init_153_arg_1 [L218] SORT_3 init_162_arg_1 = var_61; [L219] state_161 = init_162_arg_1 [L220] SORT_3 init_167_arg_1 = var_61; [L221] state_166 = init_167_arg_1 [L222] SORT_3 init_170_arg_1 = var_61; [L223] state_169 = init_170_arg_1 [L224] SORT_3 init_182_arg_1 = var_61; [L225] state_181 = init_182_arg_1 [L226] SORT_3 init_192_arg_1 = var_61; [L227] state_191 = init_192_arg_1 [L228] SORT_3 init_197_arg_1 = var_61; [L229] state_196 = init_197_arg_1 [L230] SORT_3 init_200_arg_1 = var_61; [L231] state_199 = init_200_arg_1 [L232] SORT_3 init_209_arg_1 = var_61; [L233] state_208 = init_209_arg_1 [L234] SORT_3 init_222_arg_1 = var_61; [L235] state_221 = init_222_arg_1 [L236] SORT_3 init_235_arg_1 = var_61; [L237] state_234 = init_235_arg_1 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L240] input_2 = __VERIFIER_nondet_uchar() [L241] input_4 = __VERIFIER_nondet_uchar() [L242] input_5 = __VERIFIER_nondet_uchar() [L243] input_7 = __VERIFIER_nondet_uchar() [L244] EXPR input_7 & mask_SORT_6 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L244] input_7 = input_7 & mask_SORT_6 [L245] input_8 = __VERIFIER_nondet_uchar() [L246] input_9 = __VERIFIER_nondet_uchar() [L247] input_10 = __VERIFIER_nondet_uchar() [L248] input_11 = __VERIFIER_nondet_uchar() [L249] input_13 = __VERIFIER_nondet_uchar() [L250] input_14 = __VERIFIER_nondet_uchar() [L251] input_15 = __VERIFIER_nondet_uchar() [L252] input_17 = __VERIFIER_nondet_uchar() [L253] input_18 = __VERIFIER_nondet_uchar() [L254] input_19 = __VERIFIER_nondet_uchar() [L255] input_20 = __VERIFIER_nondet_uchar() [L256] input_368 = __VERIFIER_nondet_uchar() [L257] input_390 = __VERIFIER_nondet_uchar() [L258] input_405 = __VERIFIER_nondet_uchar() [L259] input_420 = __VERIFIER_nondet_uchar() [L260] input_435 = __VERIFIER_nondet_uchar() [L261] input_450 = __VERIFIER_nondet_uchar() [L262] input_465 = __VERIFIER_nondet_uchar() [L263] input_480 = __VERIFIER_nondet_uchar() [L264] input_495 = __VERIFIER_nondet_uchar() [L265] input_510 = __VERIFIER_nondet_uchar() [L266] input_525 = __VERIFIER_nondet_uchar() [L267] input_540 = __VERIFIER_nondet_uchar() [L268] input_555 = __VERIFIER_nondet_uchar() [L269] input_570 = __VERIFIER_nondet_uchar() [L270] input_585 = __VERIFIER_nondet_uchar() [L271] input_600 = __VERIFIER_nondet_uchar() [L272] input_616 = __VERIFIER_nondet_uchar() [L273] input_618 = __VERIFIER_nondet_uchar() [L274] input_620 = __VERIFIER_nondet_uchar() [L275] input_622 = __VERIFIER_nondet_uchar() [L276] input_624 = __VERIFIER_nondet_uchar() [L277] input_626 = __VERIFIER_nondet_uchar() [L278] input_628 = __VERIFIER_nondet_uchar() [L279] input_630 = __VERIFIER_nondet_uchar() [L280] input_635 = __VERIFIER_nondet_uchar() [L281] input_676 = __VERIFIER_nondet_uchar() [L282] input_677 = __VERIFIER_nondet_uchar() [L283] input_678 = __VERIFIER_nondet_uchar() [L284] input_679 = __VERIFIER_nondet_uchar() [L285] input_682 = __VERIFIER_nondet_uchar() [L286] input_686 = __VERIFIER_nondet_uchar() [L287] input_690 = __VERIFIER_nondet_uchar() [L288] input_698 = __VERIFIER_nondet_uchar() [L289] input_702 = __VERIFIER_nondet_uchar() [L290] input_704 = __VERIFIER_nondet_uchar() [L291] input_708 = __VERIFIER_nondet_uchar() [L292] input_711 = __VERIFIER_nondet_uchar() [L293] input_715 = __VERIFIER_nondet_uchar() [L294] input_720 = __VERIFIER_nondet_uchar() [L295] input_724 = __VERIFIER_nondet_uchar() [L296] input_729 = __VERIFIER_nondet_uchar() [L297] input_731 = __VERIFIER_nondet_uchar() [L298] input_732 = __VERIFIER_nondet_uchar() [L299] input_734 = __VERIFIER_nondet_uchar() [L300] input_738 = __VERIFIER_nondet_uchar() [L301] input_743 = __VERIFIER_nondet_uchar() [L302] input_750 = __VERIFIER_nondet_uchar() [L303] input_751 = __VERIFIER_nondet_uchar() [L304] input_753 = __VERIFIER_nondet_uchar() [L305] input_757 = __VERIFIER_nondet_uchar() [L306] input_762 = __VERIFIER_nondet_uchar() [L307] input_764 = __VERIFIER_nondet_uchar() [L308] input_765 = __VERIFIER_nondet_uchar() [L309] input_767 = __VERIFIER_nondet_uchar() [L310] input_771 = __VERIFIER_nondet_uchar() [L311] input_776 = __VERIFIER_nondet_uchar() [L312] input_780 = __VERIFIER_nondet_uchar() [L313] input_785 = __VERIFIER_nondet_uchar() [L314] input_787 = __VERIFIER_nondet_uchar() [L315] input_793 = __VERIFIER_nondet_uchar() [L316] input_805 = __VERIFIER_nondet_uchar() [L317] input_810 = __VERIFIER_nondet_uchar() [L318] input_819 = __VERIFIER_nondet_uchar() [L319] input_838 = __VERIFIER_nondet_uchar() [L320] input_845 = __VERIFIER_nondet_uchar() [L321] input_856 = __VERIFIER_nondet_uchar() [L322] input_862 = __VERIFIER_nondet_uchar() [L323] input_868 = __VERIFIER_nondet_uchar() [L324] input_874 = __VERIFIER_nondet_uchar() [L325] input_880 = __VERIFIER_nondet_uchar() [L326] input_886 = __VERIFIER_nondet_uchar() [L327] input_892 = __VERIFIER_nondet_uchar() [L328] input_898 = __VERIFIER_nondet_uchar() [L329] input_904 = __VERIFIER_nondet_uchar() [L330] input_910 = __VERIFIER_nondet_uchar() [L331] input_916 = __VERIFIER_nondet_uchar() [L332] input_922 = __VERIFIER_nondet_uchar() [L333] input_928 = __VERIFIER_nondet_uchar() [L336] SORT_21 var_25_arg_0 = state_23; [L337] SORT_21 var_25_arg_1 = var_22; [L338] SORT_3 var_25 = var_25_arg_0 == var_25_arg_1; [L339] SORT_21 var_27_arg_0 = state_23; [L340] SORT_21 var_27_arg_1 = var_26; [L341] SORT_3 var_27 = var_27_arg_0 == var_27_arg_1; [L342] SORT_3 var_28_arg_0 = var_25; [L343] SORT_3 var_28_arg_1 = var_27; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28_arg_0=1, var_28_arg_1=0, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L344] EXPR var_28_arg_0 | var_28_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L344] SORT_3 var_28 = var_28_arg_0 | var_28_arg_1; [L345] SORT_21 var_30_arg_0 = state_23; [L346] SORT_21 var_30_arg_1 = var_29; [L347] SORT_3 var_30 = var_30_arg_0 == var_30_arg_1; [L348] SORT_21 var_34_arg_0 = state_31; [L349] SORT_21 var_34_arg_1 = var_33; [L350] SORT_3 var_34 = var_34_arg_0 == var_34_arg_1; [L351] SORT_21 var_35_arg_0 = state_31; [L352] SORT_21 var_35_arg_1 = var_22; [L353] SORT_3 var_35 = var_35_arg_0 == var_35_arg_1; [L354] SORT_3 var_36_arg_0 = var_34; [L355] SORT_3 var_36_arg_1 = var_35; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_36_arg_0=0, var_36_arg_1=1, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L356] EXPR var_36_arg_0 | var_36_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L356] SORT_3 var_36 = var_36_arg_0 | var_36_arg_1; [L357] SORT_21 var_38_arg_0 = state_31; [L358] SORT_21 var_38_arg_1 = var_37; [L359] SORT_3 var_38 = var_38_arg_0 == var_38_arg_1; [L360] SORT_3 var_39_arg_0 = var_36; [L361] SORT_3 var_39_arg_1 = var_38; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_37=0, var_39_arg_0=1, var_39_arg_1=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L362] EXPR var_39_arg_0 | var_39_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L362] SORT_3 var_39 = var_39_arg_0 | var_39_arg_1; [L363] SORT_21 var_40_arg_0 = state_31; [L364] SORT_21 var_40_arg_1 = var_29; [L365] SORT_3 var_40 = var_40_arg_0 == var_40_arg_1; [L366] SORT_3 var_41_arg_0 = var_39; [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_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_37=0, var_41_arg_0=1, var_41_arg_1=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [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_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L368] SORT_3 var_41 = var_41_arg_0 | var_41_arg_1; [L369] SORT_3 var_42_arg_0 = var_30; [L370] SORT_3 var_42_arg_1 = var_41; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_33=8, var_37=0, var_42_arg_0=0, var_42_arg_1=1, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L371] EXPR var_42_arg_0 & var_42_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L371] SORT_3 var_42 = var_42_arg_0 & var_42_arg_1; [L372] SORT_3 var_43_arg_0 = var_28; [L373] SORT_3 var_43_arg_1 = var_42; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_43_arg_0=1, var_43_arg_1=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L374] EXPR var_43_arg_0 | var_43_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L374] SORT_3 var_43 = var_43_arg_0 | var_43_arg_1; [L375] SORT_21 var_44_arg_0 = state_23; [L376] SORT_21 var_44_arg_1 = var_33; [L377] SORT_3 var_44 = var_44_arg_0 == var_44_arg_1; [L378] SORT_3 var_45_arg_0 = var_43; [L379] SORT_3 var_45_arg_1 = var_44; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_45_arg_0=1, var_45_arg_1=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L380] EXPR var_45_arg_0 | var_45_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L380] SORT_3 var_45 = var_45_arg_0 | var_45_arg_1; [L381] SORT_21 var_47_arg_0 = state_23; [L382] SORT_21 var_47_arg_1 = var_46; [L383] SORT_3 var_47 = var_47_arg_0 == var_47_arg_1; [L384] SORT_3 var_48_arg_0 = var_45; [L385] SORT_3 var_48_arg_1 = var_47; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_48_arg_0=1, var_48_arg_1=0, var_49=32, var_52=64, var_57=1, var_61=0] [L386] EXPR var_48_arg_0 | var_48_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L386] SORT_3 var_48 = var_48_arg_0 | var_48_arg_1; [L387] SORT_21 var_50_arg_0 = state_23; [L388] SORT_21 var_50_arg_1 = var_49; [L389] SORT_3 var_50 = var_50_arg_0 == var_50_arg_1; [L390] SORT_3 var_51_arg_0 = var_48; [L391] SORT_3 var_51_arg_1 = var_50; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_51_arg_0=1, var_51_arg_1=0, var_52=64, var_57=1, var_61=0] [L392] EXPR var_51_arg_0 | var_51_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L392] SORT_3 var_51 = var_51_arg_0 | var_51_arg_1; [L393] SORT_21 var_53_arg_0 = state_23; [L394] SORT_21 var_53_arg_1 = var_52; [L395] SORT_3 var_53 = var_53_arg_0 == var_53_arg_1; [L396] SORT_3 var_54_arg_0 = var_51; [L397] SORT_3 var_54_arg_1 = var_53; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_54_arg_0=1, var_54_arg_1=0, var_57=1, var_61=0] [L398] EXPR var_54_arg_0 | var_54_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L398] SORT_3 var_54 = var_54_arg_0 | var_54_arg_1; [L399] SORT_21 var_55_arg_0 = state_23; [L400] SORT_21 var_55_arg_1 = var_37; [L401] SORT_3 var_55 = var_55_arg_0 == var_55_arg_1; [L402] SORT_3 var_56_arg_0 = var_54; [L403] SORT_3 var_56_arg_1 = var_55; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_56_arg_0=1, var_56_arg_1=0, var_57=1, var_61=0] [L404] EXPR var_56_arg_0 | var_56_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L404] SORT_3 var_56 = var_56_arg_0 | var_56_arg_1; [L405] SORT_3 var_58_arg_0 = var_56; [L406] SORT_3 var_58 = ~var_58_arg_0; [L407] SORT_3 var_59_arg_0 = var_57; [L408] SORT_3 var_59_arg_1 = var_58; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_59_arg_0=1, var_59_arg_1=-2, var_61=0] [L409] EXPR var_59_arg_0 & var_59_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L409] SORT_3 var_59 = var_59_arg_0 & var_59_arg_1; [L410] EXPR var_59 & mask_SORT_3 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L410] var_59 = var_59 & mask_SORT_3 [L411] SORT_3 bad_60_arg_0 = var_59; [L412] CALL __VERIFIER_assert(!(bad_60_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1130 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.8s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27895 SdHoareTripleChecker+Valid, 11.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27895 mSDsluCounter, 115538 SdHoareTripleChecker+Invalid, 9.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 91926 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25595 IncrementalHoareTripleChecker+Invalid, 25607 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 23612 mSDtfsCounter, 25595 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1216occurred in iteration=17, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 1902 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 1750 NumberOfCodeBlocks, 1750 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1630 ConstructedInterpolants, 0 QuantifiedInterpolants, 8350 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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-02-05 20:10:48,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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_p2.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 7eccc5bbdbaf49f286af1eaa6e037aac70bd43bbdd029365a1ddd6424cc3712f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:10:50,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:10:50,845 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-05 20:10:50,854 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:10:50,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:10:50,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:10:50,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:10:50,880 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:10:50,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:10:50,881 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:10:50,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:10:50,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:10:50,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:10:50,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:10:50,882 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:10:50,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:10:50,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:10:50,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:10:50,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:10:50,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:10:50,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:10:50,883 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:10:50,883 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:10:50,883 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:10:50,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:10:50,883 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:10:50,883 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:10:50,883 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:10:50,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:10:50,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:10:50,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:10:50,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:10:50,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:10:50,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:10:50,883 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:10:50,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:10:50,883 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:10:50,883 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:10:50,883 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:10:50,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:10:50,883 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:10:50,883 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:10:50,883 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 -> 7eccc5bbdbaf49f286af1eaa6e037aac70bd43bbdd029365a1ddd6424cc3712f [2025-02-05 20:10:51,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:10:51,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:10:51,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:10:51,126 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:10:51,126 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:10:51,127 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_p2.c [2025-02-05 20:10:52,390 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/767f5d500/5390121debd64fcda7eba35df43fbb88/FLAG3c5e7b667 [2025-02-05 20:10:52,687 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:10:52,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c [2025-02-05 20:10:52,709 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/767f5d500/5390121debd64fcda7eba35df43fbb88/FLAG3c5e7b667 [2025-02-05 20:10:52,726 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/767f5d500/5390121debd64fcda7eba35df43fbb88 [2025-02-05 20:10:52,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:10:52,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:10:52,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:10:52,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:10:52,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:10:52,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:10:52" (1/1) ... [2025-02-05 20:10:52,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@186b9c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:52, skipping insertion in model container [2025-02-05 20:10:52,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:10:52" (1/1) ... [2025-02-05 20:10:52,792 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:10:52,935 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_p2.c[1268,1281] [2025-02-05 20:10:53,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:10:53,207 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:10:53,215 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_p2.c[1268,1281] [2025-02-05 20:10:53,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:10:53,372 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:10:53,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:53 WrapperNode [2025-02-05 20:10:53,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:10:53,374 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:10:53,374 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:10:53,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:10:53,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:53" (1/1) ... [2025-02-05 20:10:53,411 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:53" (1/1) ... [2025-02-05 20:10:53,492 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2640 [2025-02-05 20:10:53,492 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:10:53,494 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:10:53,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:10:53,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:10:53,501 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:53" (1/1) ... [2025-02-05 20:10:53,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:53" (1/1) ... [2025-02-05 20:10:53,518 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:53" (1/1) ... [2025-02-05 20:10:53,580 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-02-05 20:10:53,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:53" (1/1) ... [2025-02-05 20:10:53,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:53" (1/1) ... [2025-02-05 20:10:53,619 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:53" (1/1) ... [2025-02-05 20:10:53,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:53" (1/1) ... [2025-02-05 20:10:53,639 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:53" (1/1) ... [2025-02-05 20:10:53,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:53" (1/1) ... [2025-02-05 20:10:53,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:10:53,668 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:10:53,668 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:10:53,668 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:10:53,670 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:53" (1/1) ... [2025-02-05 20:10:53,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:10:53,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:10:53,697 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-02-05 20:10:53,700 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-02-05 20:10:53,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:10:53,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:10:53,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:10:53,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:10:54,066 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:10:54,068 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:10:56,092 INFO L? ?]: Removed 183 outVars from TransFormulas that were not future-live. [2025-02-05 20:10:56,092 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:10:56,098 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:10:56,099 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:10:56,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:10:56 BoogieIcfgContainer [2025-02-05 20:10:56,099 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:10:56,101 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:10:56,101 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:10:56,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:10:56,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:10:52" (1/3) ... [2025-02-05 20:10:56,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f2cd1fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:10:56, skipping insertion in model container [2025-02-05 20:10:56,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:53" (2/3) ... [2025-02-05 20:10:56,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f2cd1fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:10:56, skipping insertion in model container [2025-02-05 20:10:56,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:10:56" (3/3) ... [2025-02-05 20:10:56,107 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c [2025-02-05 20:10:56,119 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:10:56,121 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:10:56,158 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:10:56,166 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;@11963dd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:10:56,166 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:10:56,170 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-02-05 20:10:56,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-05 20:10:56,174 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:56,174 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-05 20:10:56,175 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:56,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:56,178 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-02-05 20:10:56,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:10:56,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1736222377] [2025-02-05 20:10:56,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:56,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:10:56,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:10:56,188 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-02-05 20:10:56,189 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-02-05 20:10:56,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-05 20:10:56,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-05 20:10:56,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:56,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:56,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-05 20:10:56,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:10:56,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:56,782 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:10:56,782 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:10:56,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736222377] [2025-02-05 20:10:56,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736222377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:56,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:56,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:10:56,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767745262] [2025-02-05 20:10:56,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:56,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:10:56,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:10:56,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:10:56,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:10:56,804 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-02-05 20:10:56,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:56,878 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-02-05 20:10:56,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:10:56,882 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-02-05 20:10:56,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:56,886 INFO L225 Difference]: With dead ends: 17 [2025-02-05 20:10:56,887 INFO L226 Difference]: Without dead ends: 9 [2025-02-05 20:10:56,889 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-02-05 20:10:56,891 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:56,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:10:56,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-05 20:10:56,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-02-05 20:10:56,909 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-02-05 20:10:56,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-02-05 20:10:56,913 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-02-05 20:10:56,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:56,913 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-02-05 20:10:56,913 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-02-05 20:10:56,913 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-02-05 20:10:56,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 20:10:56,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:56,914 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:56,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 20:10:57,114 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-02-05 20:10:57,116 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:57,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:57,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-02-05 20:10:57,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:10:57,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1694080208] [2025-02-05 20:10:57,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:57,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:10:57,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:10:57,121 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-02-05 20:10:57,137 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-02-05 20:10:57,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 20:10:57,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 20:10:57,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:57,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:57,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-05 20:10:57,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:10:57,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:57,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:11:02,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:11:02,301 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:11:02,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694080208] [2025-02-05 20:11:02,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694080208] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:11:02,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:11:02,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-02-05 20:11:02,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306149288] [2025-02-05 20:11:02,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 20:11:02,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:11:02,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:11:02,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:11:02,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=64, Unknown=1, NotChecked=0, Total=90 [2025-02-05 20:11:02,303 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:02,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:02,480 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-02-05 20:11:02,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:11:02,480 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-05 20:11:02,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:02,480 INFO L225 Difference]: With dead ends: 14 [2025-02-05 20:11:02,480 INFO L226 Difference]: Without dead ends: 12 [2025-02-05 20:11:02,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=40, Invalid=91, Unknown=1, NotChecked=0, Total=132 [2025-02-05 20:11:02,481 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:11:02,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:11:02,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-02-05 20:11:02,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-02-05 20:11:02,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:02,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-02-05 20:11:02,483 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-02-05 20:11:02,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:02,483 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-02-05 20:11:02,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:02,483 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-02-05 20:11:02,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 20:11:02,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:02,483 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-02-05 20:11:02,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 20:11:02,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:11:02,685 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:02,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:02,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1791040441, now seen corresponding path program 2 times [2025-02-05 20:11:02,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:11:02,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [231961695] [2025-02-05 20:11:02,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 20:11:02,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:11:02,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:11:02,693 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:11:02,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 20:11:03,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-05 20:11:03,415 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 20:11:03,415 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 20:11:03,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:03,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-02-05 20:11:03,449 INFO L279 TraceCheckSpWp]: Computing forward predicates...