./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee1d4ab2254e09ab1c7ffa7d0c8fe840fd7239014a5c1c2ca5c976023f5a71b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:04:27,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:04:27,348 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:04:27,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:04:27,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:04:27,376 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:04:27,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:04:27,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:04:27,378 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:04:27,378 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:04:27,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:04:27,379 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:04:27,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:04:27,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:04:27,380 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:04:27,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:04:27,380 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:04:27,380 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:04:27,380 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:04:27,380 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:04:27,381 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:04:27,381 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:04:27,381 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:04:27,381 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:04:27,381 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:04:27,381 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:04:27,381 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:04:27,381 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:04:27,381 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:04:27,381 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:04:27,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:04:27,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:04:27,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:04:27,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:04:27,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:04:27,382 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:04:27,382 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:04:27,382 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:04:27,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:04:27,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:04:27,383 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:04:27,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:04:27,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:04:27,383 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ee1d4ab2254e09ab1c7ffa7d0c8fe840fd7239014a5c1c2ca5c976023f5a71b5 [2025-03-03 22:04:27,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:04:27,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:04:27,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:04:27,594 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:04:27,594 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:04:27,595 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2025-03-03 22:04:28,730 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4adc8952/f878ec3ebf2c47d1b1cb754bb73d8b57/FLAG5b641a3ef [2025-03-03 22:04:28,989 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:04:28,990 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2025-03-03 22:04:28,998 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4adc8952/f878ec3ebf2c47d1b1cb754bb73d8b57/FLAG5b641a3ef [2025-03-03 22:04:29,298 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4adc8952/f878ec3ebf2c47d1b1cb754bb73d8b57 [2025-03-03 22:04:29,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:04:29,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:04:29,301 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:04:29,301 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:04:29,304 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:04:29,304 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:04:29" (1/1) ... [2025-03-03 22:04:29,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d839858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:04:29, skipping insertion in model container [2025-03-03 22:04:29,305 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:04:29" (1/1) ... [2025-03-03 22:04:29,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:04:29,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i[919,932] [2025-03-03 22:04:29,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:04:29,459 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:04:29,465 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i[919,932] [2025-03-03 22:04:29,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:04:29,497 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:04:29,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:04:29 WrapperNode [2025-03-03 22:04:29,499 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:04:29,499 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:04:29,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:04:29,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:04:29,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:04:29" (1/1) ... [2025-03-03 22:04:29,511 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:04:29" (1/1) ... [2025-03-03 22:04:29,531 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-03-03 22:04:29,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:04:29,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:04:29,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:04:29,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:04:29,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:04:29" (1/1) ... [2025-03-03 22:04:29,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:04:29" (1/1) ... [2025-03-03 22:04:29,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:04:29" (1/1) ... [2025-03-03 22:04:29,554 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:04:29,554 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:04:29" (1/1) ... [2025-03-03 22:04:29,554 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:04:29" (1/1) ... [2025-03-03 22:04:29,562 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:04:29" (1/1) ... [2025-03-03 22:04:29,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:04:29" (1/1) ... [2025-03-03 22:04:29,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:04:29" (1/1) ... [2025-03-03 22:04:29,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:04:29" (1/1) ... [2025-03-03 22:04:29,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:04:29,568 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:04:29,568 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:04:29,568 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:04:29,568 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:04:29" (1/1) ... [2025-03-03 22:04:29,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:04:29,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:04:29,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:04:29,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:04:29,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:04:29,612 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:04:29,612 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:04:29,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:04:29,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:04:29,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:04:29,679 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:04:29,681 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:04:29,966 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 22:04:29,968 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:04:29,977 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:04:29,978 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:04:29,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:04:29 BoogieIcfgContainer [2025-03-03 22:04:29,978 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:04:29,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:04:29,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:04:29,983 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:04:29,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:04:29" (1/3) ... [2025-03-03 22:04:29,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@559dce1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:04:29, skipping insertion in model container [2025-03-03 22:04:29,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:04:29" (2/3) ... [2025-03-03 22:04:29,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@559dce1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:04:29, skipping insertion in model container [2025-03-03 22:04:29,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:04:29" (3/3) ... [2025-03-03 22:04:29,985 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2025-03-03 22:04:29,995 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:04:29,996 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:04:30,033 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:04:30,049 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;@5a1413f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:04:30,049 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:04:30,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 22:04:30,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 22:04:30,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:04:30,064 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:04:30,064 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:04:30,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:04:30,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1226635345, now seen corresponding path program 1 times [2025-03-03 22:04:30,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:04:30,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143801541] [2025-03-03 22:04:30,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:04:30,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:04:30,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 22:04:30,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 22:04:30,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:04:30,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:04:30,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-03 22:04:30,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:04:30,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143801541] [2025-03-03 22:04:30,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143801541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:04:30,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561905603] [2025-03-03 22:04:30,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:04:30,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:04:30,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:04:30,351 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:04:30,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 22:04:30,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 22:04:30,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 22:04:30,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:04:30,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:04:30,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:04:30,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:04:30,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-03 22:04:30,501 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:04:30,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561905603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:04:30,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:04:30,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:04:30,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214748007] [2025-03-03 22:04:30,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:04:30,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:04:30,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:04:30,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:04:30,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:04:30,525 INFO L87 Difference]: Start difference. First operand has 84 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 22:04:30,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:04:30,542 INFO L93 Difference]: Finished difference Result 162 states and 283 transitions. [2025-03-03 22:04:30,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:04:30,544 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2025-03-03 22:04:30,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:04:30,548 INFO L225 Difference]: With dead ends: 162 [2025-03-03 22:04:30,548 INFO L226 Difference]: Without dead ends: 81 [2025-03-03 22:04:30,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:04:30,554 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:04:30,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:04:30,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-03 22:04:30,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-03 22:04:30,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 55 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 22:04:30,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 127 transitions. [2025-03-03 22:04:30,582 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 127 transitions. Word has length 161 [2025-03-03 22:04:30,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:04:30,582 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 127 transitions. [2025-03-03 22:04:30,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 22:04:30,582 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 127 transitions. [2025-03-03 22:04:30,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 22:04:30,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:04:30,584 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:04:30,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 22:04:30,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 22:04:30,785 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:04:30,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:04:30,785 INFO L85 PathProgramCache]: Analyzing trace with hash -773531213, now seen corresponding path program 1 times [2025-03-03 22:04:30,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:04:30,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048245458] [2025-03-03 22:04:30,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:04:30,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:04:30,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 22:04:30,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 22:04:30,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:04:30,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:04:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:04:31,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:04:31,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048245458] [2025-03-03 22:04:31,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048245458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:04:31,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:04:31,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:04:31,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034334163] [2025-03-03 22:04:31,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:04:31,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:04:31,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:04:31,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:04:31,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:04:31,050 INFO L87 Difference]: Start difference. First operand 81 states and 127 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:04:31,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:04:31,105 INFO L93 Difference]: Finished difference Result 237 states and 375 transitions. [2025-03-03 22:04:31,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:04:31,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2025-03-03 22:04:31,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:04:31,108 INFO L225 Difference]: With dead ends: 237 [2025-03-03 22:04:31,109 INFO L226 Difference]: Without dead ends: 159 [2025-03-03 22:04:31,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:04:31,110 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 81 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:04:31,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 248 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:04:31,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-03 22:04:31,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2025-03-03 22:04:31,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 106 states have (on average 1.4433962264150944) internal successors, (153), 106 states have internal predecessors, (153), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 22:04:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 249 transitions. [2025-03-03 22:04:31,133 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 249 transitions. Word has length 161 [2025-03-03 22:04:31,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:04:31,134 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 249 transitions. [2025-03-03 22:04:31,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:04:31,134 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 249 transitions. [2025-03-03 22:04:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 22:04:31,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:04:31,135 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:04:31,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:04:31,136 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:04:31,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:04:31,136 INFO L85 PathProgramCache]: Analyzing trace with hash -562180300, now seen corresponding path program 1 times [2025-03-03 22:04:31,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:04:31,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544797502] [2025-03-03 22:04:31,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:04:31,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:04:31,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 22:04:31,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 22:04:31,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:04:31,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:04:31,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:04:31,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:04:31,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544797502] [2025-03-03 22:04:31,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544797502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:04:31,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:04:31,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:04:31,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416541488] [2025-03-03 22:04:31,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:04:31,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:04:31,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:04:31,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:04:31,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:04:31,406 INFO L87 Difference]: Start difference. First operand 157 states and 249 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:04:31,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:04:31,695 INFO L93 Difference]: Finished difference Result 562 states and 899 transitions. [2025-03-03 22:04:31,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:04:31,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2025-03-03 22:04:31,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:04:31,699 INFO L225 Difference]: With dead ends: 562 [2025-03-03 22:04:31,699 INFO L226 Difference]: Without dead ends: 408 [2025-03-03 22:04:31,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:04:31,703 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 198 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:04:31,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 429 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:04:31,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-03 22:04:31,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 353. [2025-03-03 22:04:31,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 227 states have (on average 1.3920704845814977) internal successors, (316), 227 states have internal predecessors, (316), 120 states have call successors, (120), 5 states have call predecessors, (120), 5 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-03 22:04:31,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 556 transitions. [2025-03-03 22:04:31,748 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 556 transitions. Word has length 161 [2025-03-03 22:04:31,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:04:31,748 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 556 transitions. [2025-03-03 22:04:31,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:04:31,748 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 556 transitions. [2025-03-03 22:04:31,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 22:04:31,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:04:31,750 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:04:31,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:04:31,750 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:04:31,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:04:31,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1975410223, now seen corresponding path program 1 times [2025-03-03 22:04:31,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:04:31,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765006895] [2025-03-03 22:04:31,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:04:31,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:04:31,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 22:04:31,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 22:04:31,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:04:31,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:04:35,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:04:35,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:04:35,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765006895] [2025-03-03 22:04:35,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765006895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:04:35,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:04:35,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 22:04:35,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741762886] [2025-03-03 22:04:35,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:04:35,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 22:04:35,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:04:35,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 22:04:35,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-03 22:04:35,090 INFO L87 Difference]: Start difference. First operand 353 states and 556 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:04:35,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:04:35,912 INFO L93 Difference]: Finished difference Result 693 states and 1065 transitions. [2025-03-03 22:04:35,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 22:04:35,913 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-03-03 22:04:35,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:04:35,917 INFO L225 Difference]: With dead ends: 693 [2025-03-03 22:04:35,918 INFO L226 Difference]: Without dead ends: 539 [2025-03-03 22:04:35,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-03 22:04:35,920 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 212 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 22:04:35,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 691 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 22:04:35,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-03 22:04:35,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 427. [2025-03-03 22:04:35,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 291 states have (on average 1.4089347079037802) internal successors, (410), 293 states have internal predecessors, (410), 128 states have call successors, (128), 7 states have call predecessors, (128), 7 states have return successors, (128), 126 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-03 22:04:35,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 666 transitions. [2025-03-03 22:04:35,958 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 666 transitions. Word has length 162 [2025-03-03 22:04:35,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:04:35,959 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 666 transitions. [2025-03-03 22:04:35,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:04:35,959 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 666 transitions. [2025-03-03 22:04:35,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 22:04:35,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:04:35,961 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:04:35,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 22:04:35,961 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:04:35,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:04:35,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1976333744, now seen corresponding path program 1 times [2025-03-03 22:04:35,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:04:35,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872772811] [2025-03-03 22:04:35,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:04:35,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:04:35,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 22:04:36,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 22:04:36,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:04:36,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:04:59,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:04:59,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:04:59,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872772811] [2025-03-03 22:04:59,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872772811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:04:59,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:04:59,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 22:04:59,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173982867] [2025-03-03 22:04:59,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:04:59,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 22:04:59,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:04:59,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 22:04:59,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-03 22:04:59,665 INFO L87 Difference]: Start difference. First operand 427 states and 666 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:05:01,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:05:01,891 INFO L93 Difference]: Finished difference Result 499 states and 758 transitions. [2025-03-03 22:05:01,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 22:05:01,892 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-03-03 22:05:01,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:05:01,895 INFO L225 Difference]: With dead ends: 499 [2025-03-03 22:05:01,896 INFO L226 Difference]: Without dead ends: 497 [2025-03-03 22:05:01,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2025-03-03 22:05:01,896 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 138 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 22:05:01,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 798 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 22:05:01,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-03-03 22:05:01,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 430. [2025-03-03 22:05:01,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 294 states have (on average 1.4081632653061225) internal successors, (414), 296 states have internal predecessors, (414), 128 states have call successors, (128), 7 states have call predecessors, (128), 7 states have return successors, (128), 126 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-03 22:05:01,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 670 transitions. [2025-03-03 22:05:01,923 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 670 transitions. Word has length 162 [2025-03-03 22:05:01,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:05:01,925 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 670 transitions. [2025-03-03 22:05:01,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:05:01,926 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 670 transitions. [2025-03-03 22:05:01,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 22:05:01,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:05:01,928 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:01,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 22:05:01,928 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:05:01,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:05:01,929 INFO L85 PathProgramCache]: Analyzing trace with hash 167955760, now seen corresponding path program 1 times [2025-03-03 22:05:01,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:05:01,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523003007] [2025-03-03 22:05:01,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:01,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:05:01,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 22:05:01,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 22:05:01,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:01,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:05:04,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:05:04,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523003007] [2025-03-03 22:05:04,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523003007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:05:04,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:05:04,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 22:05:04,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544610854] [2025-03-03 22:05:04,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:05:04,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 22:05:04,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:05:04,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 22:05:04,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-03 22:05:04,485 INFO L87 Difference]: Start difference. First operand 430 states and 670 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:05:05,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:05:05,111 INFO L93 Difference]: Finished difference Result 537 states and 803 transitions. [2025-03-03 22:05:05,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 22:05:05,112 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-03-03 22:05:05,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:05:05,117 INFO L225 Difference]: With dead ends: 537 [2025-03-03 22:05:05,117 INFO L226 Difference]: Without dead ends: 535 [2025-03-03 22:05:05,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-03 22:05:05,118 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 187 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 22:05:05,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 810 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 22:05:05,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-03 22:05:05,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 434. [2025-03-03 22:05:05,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 298 states have (on average 1.4093959731543624) internal successors, (420), 300 states have internal predecessors, (420), 128 states have call successors, (128), 7 states have call predecessors, (128), 7 states have return successors, (128), 126 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-03 22:05:05,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 676 transitions. [2025-03-03 22:05:05,144 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 676 transitions. Word has length 162 [2025-03-03 22:05:05,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:05:05,144 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 676 transitions. [2025-03-03 22:05:05,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:05:05,144 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 676 transitions. [2025-03-03 22:05:05,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 22:05:05,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:05:05,146 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:05,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 22:05:05,146 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:05:05,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:05:05,147 INFO L85 PathProgramCache]: Analyzing trace with hash 168879281, now seen corresponding path program 1 times [2025-03-03 22:05:05,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:05:05,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120836274] [2025-03-03 22:05:05,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:05,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:05:05,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 22:05:05,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 22:05:05,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:05,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:09,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:05:09,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:05:09,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120836274] [2025-03-03 22:05:09,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120836274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:05:09,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:05:09,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 22:05:09,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112408663] [2025-03-03 22:05:09,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:05:09,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 22:05:09,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:05:09,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 22:05:09,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-03 22:05:09,068 INFO L87 Difference]: Start difference. First operand 434 states and 676 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:05:10,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:05:10,115 INFO L93 Difference]: Finished difference Result 535 states and 801 transitions. [2025-03-03 22:05:10,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 22:05:10,116 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-03-03 22:05:10,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:05:10,118 INFO L225 Difference]: With dead ends: 535 [2025-03-03 22:05:10,118 INFO L226 Difference]: Without dead ends: 533 [2025-03-03 22:05:10,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-03 22:05:10,119 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 171 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 22:05:10,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 815 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 22:05:10,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-03 22:05:10,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 432. [2025-03-03 22:05:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 296 states have (on average 1.4087837837837838) internal successors, (417), 298 states have internal predecessors, (417), 128 states have call successors, (128), 7 states have call predecessors, (128), 7 states have return successors, (128), 126 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-03 22:05:10,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 673 transitions. [2025-03-03 22:05:10,137 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 673 transitions. Word has length 162 [2025-03-03 22:05:10,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:05:10,137 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 673 transitions. [2025-03-03 22:05:10,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:05:10,137 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 673 transitions. [2025-03-03 22:05:10,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 22:05:10,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:05:10,139 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:10,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 22:05:10,139 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:05:10,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:05:10,139 INFO L85 PathProgramCache]: Analyzing trace with hash 2104492942, now seen corresponding path program 1 times [2025-03-03 22:05:10,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:05:10,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489638744] [2025-03-03 22:05:10,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:10,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:05:10,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 22:05:10,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 22:05:10,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:10,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:10,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:05:10,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:05:10,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489638744] [2025-03-03 22:05:10,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489638744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:05:10,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:05:10,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:05:10,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603778067] [2025-03-03 22:05:10,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:05:10,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:05:10,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:05:10,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:05:10,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:05:10,179 INFO L87 Difference]: Start difference. First operand 432 states and 673 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:05:10,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:05:10,221 INFO L93 Difference]: Finished difference Result 881 states and 1377 transitions. [2025-03-03 22:05:10,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:05:10,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-03-03 22:05:10,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:05:10,224 INFO L225 Difference]: With dead ends: 881 [2025-03-03 22:05:10,224 INFO L226 Difference]: Without dead ends: 500 [2025-03-03 22:05:10,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:05:10,226 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 108 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:05:10,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 335 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:05:10,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-03-03 22:05:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 498. [2025-03-03 22:05:10,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 357 states have (on average 1.361344537815126) internal successors, (486), 360 states have internal predecessors, (486), 132 states have call successors, (132), 8 states have call predecessors, (132), 8 states have return successors, (132), 129 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-03 22:05:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 750 transitions. [2025-03-03 22:05:10,252 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 750 transitions. Word has length 162 [2025-03-03 22:05:10,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:05:10,254 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 750 transitions. [2025-03-03 22:05:10,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:05:10,254 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 750 transitions. [2025-03-03 22:05:10,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 22:05:10,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:05:10,255 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:10,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 22:05:10,255 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:05:10,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:05:10,256 INFO L85 PathProgramCache]: Analyzing trace with hash -447664019, now seen corresponding path program 1 times [2025-03-03 22:05:10,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:05:10,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79581476] [2025-03-03 22:05:10,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:10,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:05:10,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 22:05:10,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 22:05:10,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:10,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:10,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:05:10,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:05:10,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79581476] [2025-03-03 22:05:10,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79581476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:05:10,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:05:10,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:05:10,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763946832] [2025-03-03 22:05:10,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:05:10,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:05:10,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:05:10,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:05:10,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:05:10,326 INFO L87 Difference]: Start difference. First operand 498 states and 750 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:05:10,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:05:10,516 INFO L93 Difference]: Finished difference Result 1090 states and 1611 transitions. [2025-03-03 22:05:10,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:05:10,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-03-03 22:05:10,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:05:10,522 INFO L225 Difference]: With dead ends: 1090 [2025-03-03 22:05:10,522 INFO L226 Difference]: Without dead ends: 676 [2025-03-03 22:05:10,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:05:10,524 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 92 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:05:10,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 371 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:05:10,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-03-03 22:05:10,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 630. [2025-03-03 22:05:10,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 453 states have (on average 1.3399558498896247) internal successors, (607), 458 states have internal predecessors, (607), 164 states have call successors, (164), 12 states have call predecessors, (164), 12 states have return successors, (164), 159 states have call predecessors, (164), 164 states have call successors, (164) [2025-03-03 22:05:10,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 935 transitions. [2025-03-03 22:05:10,559 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 935 transitions. Word has length 162 [2025-03-03 22:05:10,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:05:10,559 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 935 transitions. [2025-03-03 22:05:10,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:05:10,560 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 935 transitions. [2025-03-03 22:05:10,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 22:05:10,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:05:10,561 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:10,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 22:05:10,561 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:05:10,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:05:10,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2039848814, now seen corresponding path program 1 times [2025-03-03 22:05:10,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:05:10,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230324288] [2025-03-03 22:05:10,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:10,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:05:10,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 22:05:10,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 22:05:10,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:10,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:11,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:05:11,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:05:11,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230324288] [2025-03-03 22:05:11,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230324288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:05:11,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:05:11,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 22:05:11,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276950151] [2025-03-03 22:05:11,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:05:11,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 22:05:11,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:05:11,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 22:05:11,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-03-03 22:05:11,989 INFO L87 Difference]: Start difference. First operand 630 states and 935 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:05:12,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:05:12,660 INFO L93 Difference]: Finished difference Result 776 states and 1102 transitions. [2025-03-03 22:05:12,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 22:05:12,661 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-03-03 22:05:12,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:05:12,665 INFO L225 Difference]: With dead ends: 776 [2025-03-03 22:05:12,665 INFO L226 Difference]: Without dead ends: 774 [2025-03-03 22:05:12,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-03 22:05:12,666 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 324 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 22:05:12,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 648 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 22:05:12,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2025-03-03 22:05:12,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 686. [2025-03-03 22:05:12,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 498 states have (on average 1.3253012048192772) internal successors, (660), 505 states have internal predecessors, (660), 172 states have call successors, (172), 15 states have call predecessors, (172), 15 states have return successors, (172), 165 states have call predecessors, (172), 172 states have call successors, (172) [2025-03-03 22:05:12,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1004 transitions. [2025-03-03 22:05:12,702 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1004 transitions. Word has length 162 [2025-03-03 22:05:12,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:05:12,702 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 1004 transitions. [2025-03-03 22:05:12,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:05:12,702 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1004 transitions. [2025-03-03 22:05:12,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 22:05:12,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:05:12,707 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:12,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 22:05:12,707 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:05:12,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:05:12,708 INFO L85 PathProgramCache]: Analyzing trace with hash 2040772335, now seen corresponding path program 1 times [2025-03-03 22:05:12,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:05:12,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428361132] [2025-03-03 22:05:12,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:12,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:05:12,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 22:05:12,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 22:05:12,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:12,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:15,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:05:15,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:05:15,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428361132] [2025-03-03 22:05:15,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428361132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:05:15,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:05:15,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 22:05:15,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768717824] [2025-03-03 22:05:15,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:05:15,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 22:05:15,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:05:15,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 22:05:15,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-03-03 22:05:15,083 INFO L87 Difference]: Start difference. First operand 686 states and 1004 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:05:16,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:05:16,036 INFO L93 Difference]: Finished difference Result 774 states and 1100 transitions. [2025-03-03 22:05:16,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 22:05:16,037 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-03-03 22:05:16,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:05:16,040 INFO L225 Difference]: With dead ends: 774 [2025-03-03 22:05:16,040 INFO L226 Difference]: Without dead ends: 772 [2025-03-03 22:05:16,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-03-03 22:05:16,040 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 245 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 22:05:16,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 714 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 22:05:16,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2025-03-03 22:05:16,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 686. [2025-03-03 22:05:16,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 498 states have (on average 1.3253012048192772) internal successors, (660), 505 states have internal predecessors, (660), 172 states have call successors, (172), 15 states have call predecessors, (172), 15 states have return successors, (172), 165 states have call predecessors, (172), 172 states have call successors, (172) [2025-03-03 22:05:16,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1004 transitions. [2025-03-03 22:05:16,074 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1004 transitions. Word has length 162 [2025-03-03 22:05:16,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:05:16,074 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 1004 transitions. [2025-03-03 22:05:16,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:05:16,075 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1004 transitions. [2025-03-03 22:05:16,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 22:05:16,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:05:16,077 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:16,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 22:05:16,078 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:05:16,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:05:16,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1682007216, now seen corresponding path program 1 times [2025-03-03 22:05:16,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:05:16,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104449604] [2025-03-03 22:05:16,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:16,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:05:16,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 22:05:16,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 22:05:16,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:16,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:16,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:05:16,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:05:16,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104449604] [2025-03-03 22:05:16,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104449604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:05:16,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:05:16,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:05:16,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681909223] [2025-03-03 22:05:16,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:05:16,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:05:16,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:05:16,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:05:16,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:05:16,272 INFO L87 Difference]: Start difference. First operand 686 states and 1004 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 22:05:16,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:05:16,483 INFO L93 Difference]: Finished difference Result 1203 states and 1745 transitions. [2025-03-03 22:05:16,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:05:16,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 162 [2025-03-03 22:05:16,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:05:16,487 INFO L225 Difference]: With dead ends: 1203 [2025-03-03 22:05:16,487 INFO L226 Difference]: Without dead ends: 695 [2025-03-03 22:05:16,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:05:16,489 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 147 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:05:16,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 243 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:05:16,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2025-03-03 22:05:16,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 685. [2025-03-03 22:05:16,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 488 states have (on average 1.2950819672131149) internal successors, (632), 495 states have internal predecessors, (632), 178 states have call successors, (178), 18 states have call predecessors, (178), 18 states have return successors, (178), 171 states have call predecessors, (178), 178 states have call successors, (178) [2025-03-03 22:05:16,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 988 transitions. [2025-03-03 22:05:16,522 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 988 transitions. Word has length 162 [2025-03-03 22:05:16,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:05:16,523 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 988 transitions. [2025-03-03 22:05:16,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 22:05:16,523 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 988 transitions. [2025-03-03 22:05:16,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 22:05:16,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:05:16,524 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:16,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 22:05:16,524 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:05:16,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:05:16,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2013120782, now seen corresponding path program 1 times [2025-03-03 22:05:16,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:05:16,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495203609] [2025-03-03 22:05:16,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:16,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:05:16,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 22:05:16,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 22:05:16,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:16,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:16,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-03 22:05:16,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:05:16,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495203609] [2025-03-03 22:05:16,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495203609] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:05:16,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455630203] [2025-03-03 22:05:16,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:16,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:05:16,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:05:16,638 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:05:16,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 22:05:16,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 22:05:16,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 22:05:16,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:16,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:16,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 22:05:16,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:05:16,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 365 proven. 12 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2025-03-03 22:05:16,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:05:17,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-03 22:05:17,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455630203] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:05:17,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:05:17,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 14 [2025-03-03 22:05:17,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343845374] [2025-03-03 22:05:17,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:05:17,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 22:05:17,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:05:17,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 22:05:17,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-03 22:05:17,106 INFO L87 Difference]: Start difference. First operand 685 states and 988 transitions. Second operand has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 6 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) [2025-03-03 22:05:17,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:05:17,586 INFO L93 Difference]: Finished difference Result 1843 states and 2630 transitions. [2025-03-03 22:05:17,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 22:05:17,587 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 6 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) Word has length 163 [2025-03-03 22:05:17,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:05:17,593 INFO L225 Difference]: With dead ends: 1843 [2025-03-03 22:05:17,593 INFO L226 Difference]: Without dead ends: 1227 [2025-03-03 22:05:17,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=240, Invalid=572, Unknown=0, NotChecked=0, Total=812 [2025-03-03 22:05:17,595 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 448 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:05:17,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 422 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 22:05:17,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2025-03-03 22:05:17,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1085. [2025-03-03 22:05:17,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 763 states have (on average 1.2621231979030145) internal successors, (963), 780 states have internal predecessors, (963), 290 states have call successors, (290), 31 states have call predecessors, (290), 31 states have return successors, (290), 273 states have call predecessors, (290), 290 states have call successors, (290) [2025-03-03 22:05:17,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1543 transitions. [2025-03-03 22:05:17,666 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1543 transitions. Word has length 163 [2025-03-03 22:05:17,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:05:17,667 INFO L471 AbstractCegarLoop]: Abstraction has 1085 states and 1543 transitions. [2025-03-03 22:05:17,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 6 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) [2025-03-03 22:05:17,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1543 transitions. [2025-03-03 22:05:17,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 22:05:17,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:05:17,668 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:17,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 22:05:17,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 22:05:17,869 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:05:17,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:05:17,870 INFO L85 PathProgramCache]: Analyzing trace with hash -192789202, now seen corresponding path program 1 times [2025-03-03 22:05:17,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:05:17,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304471364] [2025-03-03 22:05:17,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:17,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:05:17,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 22:05:17,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 22:05:17,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:17,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:17,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:05:17,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:05:17,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304471364] [2025-03-03 22:05:17,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304471364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:05:17,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:05:17,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:05:17,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296734328] [2025-03-03 22:05:17,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:05:17,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:05:17,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:05:17,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:05:17,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:05:17,909 INFO L87 Difference]: Start difference. First operand 1085 states and 1543 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:05:17,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:05:17,978 INFO L93 Difference]: Finished difference Result 2096 states and 2979 transitions. [2025-03-03 22:05:17,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:05:17,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 163 [2025-03-03 22:05:17,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:05:17,983 INFO L225 Difference]: With dead ends: 2096 [2025-03-03 22:05:17,983 INFO L226 Difference]: Without dead ends: 1085 [2025-03-03 22:05:17,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:05:17,986 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 58 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:05:17,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 230 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:05:17,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2025-03-03 22:05:18,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1085. [2025-03-03 22:05:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 763 states have (on average 1.2568807339449541) internal successors, (959), 780 states have internal predecessors, (959), 290 states have call successors, (290), 31 states have call predecessors, (290), 31 states have return successors, (290), 273 states have call predecessors, (290), 290 states have call successors, (290) [2025-03-03 22:05:18,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1539 transitions. [2025-03-03 22:05:18,073 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1539 transitions. Word has length 163 [2025-03-03 22:05:18,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:05:18,073 INFO L471 AbstractCegarLoop]: Abstraction has 1085 states and 1539 transitions. [2025-03-03 22:05:18,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:05:18,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1539 transitions. [2025-03-03 22:05:18,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 22:05:18,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:05:18,074 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:18,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 22:05:18,075 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:05:18,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:05:18,075 INFO L85 PathProgramCache]: Analyzing trace with hash 216035023, now seen corresponding path program 1 times [2025-03-03 22:05:18,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:05:18,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074182787] [2025-03-03 22:05:18,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:18,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:05:18,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 22:05:18,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 22:05:18,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:18,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:18,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:05:18,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:05:18,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074182787] [2025-03-03 22:05:18,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074182787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:05:18,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:05:18,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:05:18,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070859743] [2025-03-03 22:05:18,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:05:18,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:05:18,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:05:18,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:05:18,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:05:18,151 INFO L87 Difference]: Start difference. First operand 1085 states and 1539 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:05:18,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:05:18,230 INFO L93 Difference]: Finished difference Result 1920 states and 2725 transitions. [2025-03-03 22:05:18,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:05:18,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 163 [2025-03-03 22:05:18,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:05:18,235 INFO L225 Difference]: With dead ends: 1920 [2025-03-03 22:05:18,235 INFO L226 Difference]: Without dead ends: 918 [2025-03-03 22:05:18,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:05:18,237 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 57 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:05:18,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 220 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:05:18,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2025-03-03 22:05:18,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 902. [2025-03-03 22:05:18,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 634 states have (on average 1.2602523659305993) internal successors, (799), 648 states have internal predecessors, (799), 240 states have call successors, (240), 27 states have call predecessors, (240), 27 states have return successors, (240), 226 states have call predecessors, (240), 240 states have call successors, (240) [2025-03-03 22:05:18,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1279 transitions. [2025-03-03 22:05:18,292 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1279 transitions. Word has length 163 [2025-03-03 22:05:18,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:05:18,292 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1279 transitions. [2025-03-03 22:05:18,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:05:18,292 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1279 transitions. [2025-03-03 22:05:18,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 22:05:18,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:05:18,294 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:18,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 22:05:18,294 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:05:18,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:05:18,295 INFO L85 PathProgramCache]: Analyzing trace with hash 730862250, now seen corresponding path program 1 times [2025-03-03 22:05:18,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:05:18,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683880258] [2025-03-03 22:05:18,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:18,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:05:18,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 22:05:18,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 22:05:18,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:18,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:05:18,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2122841231] [2025-03-03 22:05:18,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:18,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:05:18,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:05:18,362 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:05:18,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 22:05:18,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 22:05:18,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 22:05:18,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:18,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:18,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 22:05:18,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:05:19,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 625 proven. 132 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2025-03-03 22:05:19,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:05:24,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:05:24,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683880258] [2025-03-03 22:05:24,221 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 22:05:24,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122841231] [2025-03-03 22:05:24,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122841231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:05:24,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:05:24,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2025-03-03 22:05:24,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809022516] [2025-03-03 22:05:24,221 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 22:05:24,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 22:05:24,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:05:24,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 22:05:24,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2025-03-03 22:05:24,222 INFO L87 Difference]: Start difference. First operand 902 states and 1279 transitions. Second operand has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 5 states have call successors, (24), 5 states have call predecessors, (24), 8 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) [2025-03-03 22:05:25,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:05:25,074 INFO L93 Difference]: Finished difference Result 1568 states and 2055 transitions. [2025-03-03 22:05:25,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-03 22:05:25,075 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 5 states have call successors, (24), 5 states have call predecessors, (24), 8 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) Word has length 164 [2025-03-03 22:05:25,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:05:25,080 INFO L225 Difference]: With dead ends: 1568 [2025-03-03 22:05:25,080 INFO L226 Difference]: Without dead ends: 1271 [2025-03-03 22:05:25,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=301, Invalid=1031, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 22:05:25,082 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 157 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 22:05:25,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 570 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 22:05:25,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2025-03-03 22:05:25,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1042. [2025-03-03 22:05:25,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 741 states have (on average 1.214574898785425) internal successors, (900), 755 states have internal predecessors, (900), 236 states have call successors, (236), 64 states have call predecessors, (236), 64 states have return successors, (236), 222 states have call predecessors, (236), 236 states have call successors, (236) [2025-03-03 22:05:25,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1372 transitions. [2025-03-03 22:05:25,176 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1372 transitions. Word has length 164 [2025-03-03 22:05:25,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:05:25,176 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1372 transitions. [2025-03-03 22:05:25,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 5 states have call successors, (24), 5 states have call predecessors, (24), 8 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) [2025-03-03 22:05:25,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1372 transitions. [2025-03-03 22:05:25,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 22:05:25,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:05:25,177 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:25,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 22:05:25,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:05:25,382 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:05:25,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:05:25,382 INFO L85 PathProgramCache]: Analyzing trace with hash 731785771, now seen corresponding path program 1 times [2025-03-03 22:05:25,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:05:25,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490850402] [2025-03-03 22:05:25,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:25,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:05:25,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 22:05:25,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 22:05:25,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:25,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:05:25,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [482676400] [2025-03-03 22:05:25,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:25,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:05:25,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:05:25,449 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:05:25,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 22:05:25,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 22:05:25,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 22:05:25,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:25,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:05:25,531 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:05:25,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 22:05:25,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 22:05:25,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:25,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:05:25,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:05:25,663 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:05:25,664 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:05:25,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 22:05:25,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 22:05:25,873 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:25,963 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:05:25,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:05:25 BoogieIcfgContainer [2025-03-03 22:05:25,968 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:05:25,969 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:05:25,969 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:05:25,969 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:05:25,970 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:04:29" (3/4) ... [2025-03-03 22:05:25,972 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:05:25,972 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:05:25,973 INFO L158 Benchmark]: Toolchain (without parser) took 56672.42ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 111.8MB in the beginning and 161.1MB in the end (delta: -49.3MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. [2025-03-03 22:05:25,973 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:05:25,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.69ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 97.0MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:05:25,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.82ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 94.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:05:25,973 INFO L158 Benchmark]: Boogie Preprocessor took 34.60ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 89.6MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:05:25,973 INFO L158 Benchmark]: IcfgBuilder took 410.43ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 65.5MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 22:05:25,974 INFO L158 Benchmark]: TraceAbstraction took 55988.79ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 65.0MB in the beginning and 161.2MB in the end (delta: -96.2MB). Peak memory consumption was 86.8MB. Max. memory is 16.1GB. [2025-03-03 22:05:25,974 INFO L158 Benchmark]: Witness Printer took 3.03ms. Allocated memory is still 226.5MB. Free memory was 161.2MB in the beginning and 161.1MB in the end (delta: 45.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:05:25,975 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.18ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.69ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 97.0MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.82ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 94.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.60ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 89.6MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 410.43ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 65.5MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 55988.79ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 65.0MB in the beginning and 161.2MB in the end (delta: -96.2MB). Peak memory consumption was 86.8MB. Max. memory is 16.1GB. * Witness Printer took 3.03ms. Allocated memory is still 226.5MB. Free memory was 161.2MB in the beginning and 161.1MB in the end (delta: 45.1kB). 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: 19]: 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 someUnaryDOUBLEoperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 176, overapproximation of someBinaryDOUBLEComparisonOperation at line 174. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 50; [L23] signed char var_1_3 = 8; [L24] signed char var_1_4 = 10; [L25] double var_1_5 = 16.5; [L26] signed char var_1_6 = 64; [L27] signed char var_1_7 = 2; [L28] unsigned short int var_1_8 = 256; [L29] unsigned short int var_1_10 = 63583; [L30] unsigned short int var_1_11 = 33789; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_14 = 0; [L33] signed long int var_1_15 = 8; [L34] signed short int var_1_16 = -16; [L35] signed short int var_1_18 = 16; [L36] signed short int var_1_19 = 25; [L37] signed short int var_1_20 = 25; [L38] signed short int var_1_21 = 50; [L39] signed long int var_1_22 = -8; [L40] unsigned long int var_1_26 = 10; [L41] signed long int var_1_28 = -10000; [L42] signed long int var_1_29 = -1263929197; [L43] signed short int var_1_31 = 1; [L44] unsigned char var_1_36 = 32; [L45] unsigned char var_1_38 = 2; [L46] double var_1_39 = 3.6; [L47] double var_1_40 = 24.25; [L48] double var_1_41 = 31.25; [L49] unsigned long int var_1_42 = 10; [L50] unsigned char last_1_var_1_12 = 1; VAL [isInitial=0, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=8, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L186] isInitial = 1 [L187] FCALL initially() [L188] COND TRUE 1 [L189] CALL updateLastVariables() [L179] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=8, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L189] RET updateLastVariables() [L190] CALL updateVariables() [L140] var_1_3 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L141] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L142] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L142] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L143] var_1_4 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_4 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L144] RET assume_abort_if_not(var_1_4 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L145] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L145] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L146] var_1_6 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=2, var_1_8=256] [L147] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=2, var_1_8=256] [L148] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=2, var_1_8=256] [L148] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=2, var_1_8=256] [L149] var_1_7 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L150] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L151] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L151] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L152] var_1_10 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_10 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L153] RET assume_abort_if_not(var_1_10 >= 49150) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L154] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L154] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L155] var_1_11 = __VERIFIER_nondet_ushort() [L156] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L156] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L157] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L157] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L158] var_1_14 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L159] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L160] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L160] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L161] var_1_20 = __VERIFIER_nondet_short() [L162] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L162] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L163] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L163] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L164] var_1_21 = __VERIFIER_nondet_short() [L165] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L165] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L166] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L166] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L167] var_1_29 = __VERIFIER_nondet_long() [L168] CALL assume_abort_if_not(var_1_29 >= -2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L168] RET assume_abort_if_not(var_1_29 >= -2147483646) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L169] CALL assume_abort_if_not(var_1_29 <= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L169] RET assume_abort_if_not(var_1_29 <= -1073741823) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L170] var_1_38 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L171] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L172] CALL assume_abort_if_not(var_1_38 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L172] RET assume_abort_if_not(var_1_38 <= 254) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L173] var_1_40 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_40 >= -922337.2036854765600e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L174] RET assume_abort_if_not((var_1_40 >= -922337.2036854765600e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L175] var_1_41 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L176] RET assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L190] RET updateVariables() [L191] CALL step() [L54] COND FALSE !(var_1_16 > var_1_18) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L59] var_1_26 = var_1_8 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L60] COND FALSE !(((((-256) < 0 ) ? -(-256) : (-256))) < var_1_19) [L63] var_1_28 = var_1_29 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L65] COND TRUE var_1_8 > var_1_18 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L66] COND TRUE var_1_29 < var_1_18 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L67] COND TRUE var_1_29 <= (-64 & var_1_19) [L68] var_1_31 = ((((var_1_1) > (((((8) < (var_1_1)) ? (8) : (var_1_1))))) ? (var_1_1) : (((((8) < (var_1_1)) ? (8) : (var_1_1)))))) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L74] COND FALSE !(((((((((var_1_8) > (var_1_15)) ? (var_1_8) : (var_1_15)))) > (var_1_1)) ? (((((var_1_8) > (var_1_15)) ? (var_1_8) : (var_1_15)))) : (var_1_1))) > var_1_8) [L79] var_1_36 = var_1_38 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L81] var_1_39 = ((((((((var_1_40) < 0 ) ? -(var_1_40) : (var_1_40)))) > (((((var_1_41) < (100.75)) ? (var_1_41) : (100.75))))) ? (((((var_1_40) < 0 ) ? -(var_1_40) : (var_1_40)))) : (((((var_1_41) < (100.75)) ? (var_1_41) : (100.75)))))) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L82] COND FALSE !(var_1_8 <= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) [L93] var_1_42 = var_1_38 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L95] signed char stepLocal_1 = var_1_6; [L96] unsigned char stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_1=62, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L97] COND FALSE !(-25 == stepLocal_1) [L102] var_1_8 = ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=49151] [L104] signed char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_2=0, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=49151] [L105] COND TRUE var_1_8 >= stepLocal_2 [L106] var_1_12 = (! var_1_14) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=49151] [L108] COND TRUE \read(var_1_12) [L109] var_1_1 = (var_1_3 + var_1_4) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-1, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=49151] [L111] COND TRUE var_1_4 >= (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-1, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=49151] [L112] COND TRUE \read(var_1_12) [L113] var_1_5 = 8.25 VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-1, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/4, var_1_6=62, var_1_7=0, var_1_8=49151] [L116] signed char stepLocal_4 = var_1_6; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_4=62, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-1, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/4, var_1_6=62, var_1_7=0, var_1_8=49151] [L117] COND TRUE var_1_1 < stepLocal_4 [L118] var_1_18 = (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=62, var_1_19=25, var_1_1=-1, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/4, var_1_6=62, var_1_7=0, var_1_8=49151] [L122] COND TRUE \read(var_1_12) [L123] var_1_19 = ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=62, var_1_19=-127, var_1_1=-1, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/4, var_1_6=62, var_1_7=0, var_1_8=49151] [L125] COND TRUE -64 > (var_1_6 + var_1_19) [L126] var_1_15 = (var_1_11 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=62, var_1_19=-127, var_1_1=-1, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/4, var_1_6=62, var_1_7=0, var_1_8=49151] [L134] signed long int stepLocal_3 = ((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10); VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_3=49152, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=62, var_1_19=-127, var_1_1=-1, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/4, var_1_6=62, var_1_7=0, var_1_8=49151] [L135] COND FALSE !(var_1_19 > stepLocal_3) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=62, var_1_19=-127, var_1_1=-1, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/4, var_1_6=62, var_1_7=0, var_1_8=49151] [L191] RET step() [L192] CALL, EXPR property() [L182-L183] return (((((((var_1_12 ? (var_1_1 == ((signed char) (var_1_3 + var_1_4))) : 1) && ((var_1_4 >= (var_1_6 - var_1_7)) ? (var_1_12 ? (var_1_5 == ((double) 8.25)) : 1) : 1)) && ((-25 == var_1_6) ? ((last_1_var_1_12 && last_1_var_1_12) ? (var_1_8 == ((unsigned short int) ((((((var_1_10 - 10) - 16)) > ((var_1_11 - var_1_7))) ? (((var_1_10 - 10) - 16)) : ((var_1_11 - var_1_7)))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))))))) && ((var_1_8 >= var_1_7) ? (var_1_12 == ((unsigned char) (! var_1_14))) : 1)) && ((-64 > (var_1_6 + var_1_19)) ? (var_1_15 == ((signed long int) (var_1_11 - var_1_7))) : ((! var_1_12) ? (var_1_12 ? (var_1_15 == ((signed long int) 4)) : 1) : 1))) && ((var_1_19 > (((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10))) ? (var_1_16 == ((signed short int) var_1_4)) : 1)) && ((var_1_1 < var_1_6) ? (var_1_18 == ((signed short int) (var_1_6 - var_1_7))) : (var_1_18 == ((signed short int) (((((var_1_6 + var_1_4)) < (var_1_1)) ? ((var_1_6 + var_1_4)) : (var_1_1))))))) && (var_1_12 ? (var_1_19 == ((signed short int) ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=62, var_1_19=-127, var_1_1=-1, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/4, var_1_6=62, var_1_7=0, var_1_8=49151] [L192] RET, EXPR property() [L192] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=62, var_1_19=-127, var_1_1=-1, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/4, var_1_6=62, var_1_7=0, var_1_8=49151] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=62, var_1_19=-127, var_1_1=-1, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/4, var_1_6=62, var_1_7=0, var_1_8=49151] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 55.9s, OverallIterations: 17, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2651 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2623 mSDsluCounter, 7671 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5527 mSDsCounter, 304 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4892 IncrementalHoareTripleChecker+Invalid, 5196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 304 mSolverCounterUnsat, 2144 mSDtfsCounter, 4892 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 859 GetRequests, 691 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1085occurred in iteration=13, InterpolantAutomatonStates: 170, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 1057 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 44.2s InterpolantComputationTime, 3410 NumberOfCodeBlocks, 3410 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3062 ConstructedInterpolants, 1 QuantifiedInterpolants, 18404 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1160 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 19 InterpolantComputations, 14 PerfectInterpolantSequences, 20762/20976 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-03-03 22:05:26,183 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-03-03 22:05:26,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee1d4ab2254e09ab1c7ffa7d0c8fe840fd7239014a5c1c2ca5c976023f5a71b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:05:27,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:05:27,813 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:05:27,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:05:27,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:05:27,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:05:27,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:05:27,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:05:27,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:05:27,860 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:05:27,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:05:27,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:05:27,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:05:27,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:05:27,860 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:05:27,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:05:27,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:05:27,860 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:05:27,860 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:05:27,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:05:27,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:05:27,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:05:27,861 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:05:27,861 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:05:27,861 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:05:27,861 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:05:27,861 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:05:27,861 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:05:27,861 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:05:27,861 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:05:27,861 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:05:27,861 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:05:27,861 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:05:27,861 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:05:27,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:05:27,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:05:27,872 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:05:27,873 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:05:27,873 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:05:27,873 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:05:27,873 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:05:27,873 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:05:27,873 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:05:27,873 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:05:27,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:05:27,873 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ee1d4ab2254e09ab1c7ffa7d0c8fe840fd7239014a5c1c2ca5c976023f5a71b5 [2025-03-03 22:05:28,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:05:28,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:05:28,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:05:28,112 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:05:28,113 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:05:28,114 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2025-03-03 22:05:29,292 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b138049ee/5d9c2392e53d42568d28a854b0e446af/FLAG67fa2cac0 [2025-03-03 22:05:29,501 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:05:29,503 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2025-03-03 22:05:29,514 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b138049ee/5d9c2392e53d42568d28a854b0e446af/FLAG67fa2cac0 [2025-03-03 22:05:29,529 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b138049ee/5d9c2392e53d42568d28a854b0e446af [2025-03-03 22:05:29,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:05:29,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:05:29,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:05:29,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:05:29,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:05:29,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:05:29" (1/1) ... [2025-03-03 22:05:29,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b329399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:29, skipping insertion in model container [2025-03-03 22:05:29,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:05:29" (1/1) ... [2025-03-03 22:05:29,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:05:29,668 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i[919,932] [2025-03-03 22:05:29,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:05:29,745 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:05:29,753 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i[919,932] [2025-03-03 22:05:29,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:05:29,810 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:05:29,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:29 WrapperNode [2025-03-03 22:05:29,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:05:29,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:05:29,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:05:29,812 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:05:29,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:29" (1/1) ... [2025-03-03 22:05:29,827 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:29" (1/1) ... [2025-03-03 22:05:29,856 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2025-03-03 22:05:29,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:05:29,857 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:05:29,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:05:29,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:05:29,863 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:29" (1/1) ... [2025-03-03 22:05:29,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:29" (1/1) ... [2025-03-03 22:05:29,866 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:29" (1/1) ... [2025-03-03 22:05:29,882 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:05:29,883 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:29" (1/1) ... [2025-03-03 22:05:29,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:29" (1/1) ... [2025-03-03 22:05:29,891 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:29" (1/1) ... [2025-03-03 22:05:29,892 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:29" (1/1) ... [2025-03-03 22:05:29,893 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:29" (1/1) ... [2025-03-03 22:05:29,894 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:29" (1/1) ... [2025-03-03 22:05:29,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:05:29,896 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:05:29,896 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:05:29,896 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:05:29,897 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:29" (1/1) ... [2025-03-03 22:05:29,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:05:29,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:05:29,922 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:05:29,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:05:29,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:05:29,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:05:29,940 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:05:29,941 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:05:29,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:05:29,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:05:30,009 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:05:30,011 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:05:30,358 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 22:05:30,358 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:05:30,368 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:05:30,368 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:05:30,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:05:30 BoogieIcfgContainer [2025-03-03 22:05:30,368 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:05:30,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:05:30,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:05:30,373 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:05:30,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:05:29" (1/3) ... [2025-03-03 22:05:30,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236c5e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:05:30, skipping insertion in model container [2025-03-03 22:05:30,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:29" (2/3) ... [2025-03-03 22:05:30,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236c5e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:05:30, skipping insertion in model container [2025-03-03 22:05:30,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:05:30" (3/3) ... [2025-03-03 22:05:30,376 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2025-03-03 22:05:30,386 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:05:30,387 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:05:30,441 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:05:30,451 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;@5fd51532, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:05:30,451 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:05:30,454 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 22:05:30,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 22:05:30,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:05:30,466 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:30,466 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:05:30,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:05:30,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1226635345, now seen corresponding path program 1 times [2025-03-03 22:05:30,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:05:30,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35758116] [2025-03-03 22:05:30,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:30,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:05:30,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:05:30,479 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:05:30,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 22:05:30,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 22:05:30,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 22:05:30,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:30,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:30,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:05:30,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:05:30,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2025-03-03 22:05:30,721 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:05:30,722 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:05:30,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35758116] [2025-03-03 22:05:30,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35758116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:05:30,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:05:30,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:05:30,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665261509] [2025-03-03 22:05:30,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:05:30,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:05:30,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:05:30,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:05:30,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:05:30,746 INFO L87 Difference]: Start difference. First operand has 84 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 22:05:30,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:05:30,766 INFO L93 Difference]: Finished difference Result 162 states and 283 transitions. [2025-03-03 22:05:30,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:05:30,768 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2025-03-03 22:05:30,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:05:30,772 INFO L225 Difference]: With dead ends: 162 [2025-03-03 22:05:30,772 INFO L226 Difference]: Without dead ends: 81 [2025-03-03 22:05:30,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:05:30,776 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:05:30,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:05:30,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-03 22:05:30,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-03 22:05:30,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 55 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 22:05:30,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 127 transitions. [2025-03-03 22:05:30,811 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 127 transitions. Word has length 161 [2025-03-03 22:05:30,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:05:30,812 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 127 transitions. [2025-03-03 22:05:30,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 22:05:30,813 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 127 transitions. [2025-03-03 22:05:30,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 22:05:30,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:05:30,816 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:30,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 22:05:31,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:05:31,021 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:05:31,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:05:31,022 INFO L85 PathProgramCache]: Analyzing trace with hash -773531213, now seen corresponding path program 1 times [2025-03-03 22:05:31,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:05:31,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300130694] [2025-03-03 22:05:31,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:31,023 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:05:31,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:05:31,025 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:05:31,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 22:05:31,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 22:05:31,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 22:05:31,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:31,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:31,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 22:05:31,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:05:31,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:05:31,510 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:05:31,510 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:05:31,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300130694] [2025-03-03 22:05:31,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300130694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:05:31,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:05:31,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:05:31,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749630894] [2025-03-03 22:05:31,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:05:31,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:05:31,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:05:31,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:05:31,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:05:31,515 INFO L87 Difference]: Start difference. First operand 81 states and 127 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:05:31,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:05:31,589 INFO L93 Difference]: Finished difference Result 237 states and 375 transitions. [2025-03-03 22:05:31,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:05:31,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2025-03-03 22:05:31,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:05:31,594 INFO L225 Difference]: With dead ends: 237 [2025-03-03 22:05:31,594 INFO L226 Difference]: Without dead ends: 159 [2025-03-03 22:05:31,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:05:31,595 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 54 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:05:31,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 248 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:05:31,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-03 22:05:31,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2025-03-03 22:05:31,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 106 states have (on average 1.4433962264150944) internal successors, (153), 106 states have internal predecessors, (153), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 22:05:31,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 249 transitions. [2025-03-03 22:05:31,623 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 249 transitions. Word has length 161 [2025-03-03 22:05:31,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:05:31,623 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 249 transitions. [2025-03-03 22:05:31,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:05:31,624 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 249 transitions. [2025-03-03 22:05:31,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 22:05:31,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:05:31,625 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:31,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-03 22:05:31,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:05:31,827 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:05:31,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:05:31,827 INFO L85 PathProgramCache]: Analyzing trace with hash -562180300, now seen corresponding path program 1 times [2025-03-03 22:05:31,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:05:31,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652242145] [2025-03-03 22:05:31,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:31,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:05:31,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:05:31,830 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:05:31,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 22:05:31,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 22:05:31,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 22:05:31,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:31,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:31,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 22:05:31,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:05:32,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:05:32,531 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:05:32,531 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:05:32,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652242145] [2025-03-03 22:05:32,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652242145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:05:32,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:05:32,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:05:32,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570253482] [2025-03-03 22:05:32,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:05:32,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:05:32,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:05:32,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:05:32,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:05:32,533 INFO L87 Difference]: Start difference. First operand 157 states and 249 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:05:32,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:05:32,632 INFO L93 Difference]: Finished difference Result 375 states and 597 transitions. [2025-03-03 22:05:32,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:05:32,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2025-03-03 22:05:32,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:05:32,635 INFO L225 Difference]: With dead ends: 375 [2025-03-03 22:05:32,635 INFO L226 Difference]: Without dead ends: 221 [2025-03-03 22:05:32,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:05:32,636 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 25 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:05:32,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 226 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:05:32,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-03 22:05:32,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2025-03-03 22:05:32,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 140 states have (on average 1.3857142857142857) internal successors, (194), 140 states have internal predecessors, (194), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 22:05:32,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 338 transitions. [2025-03-03 22:05:32,659 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 338 transitions. Word has length 161 [2025-03-03 22:05:32,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:05:32,659 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 338 transitions. [2025-03-03 22:05:32,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:05:32,660 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 338 transitions. [2025-03-03 22:05:32,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 22:05:32,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:05:32,662 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:32,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-03 22:05:32,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:05:32,866 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:05:32,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:05:32,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1975410223, now seen corresponding path program 1 times [2025-03-03 22:05:32,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:05:32,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941253813] [2025-03-03 22:05:32,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:32,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:05:32,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:05:32,868 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:05:32,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 22:05:32,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 22:05:32,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 22:05:32,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:32,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:32,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 22:05:32,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:05:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 365 proven. 12 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2025-03-03 22:05:33,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:05:33,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-03 22:05:33,424 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:05:33,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941253813] [2025-03-03 22:05:33,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941253813] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:05:33,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 22:05:33,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-03 22:05:33,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670929641] [2025-03-03 22:05:33,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 22:05:33,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 22:05:33,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:05:33,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 22:05:33,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:05:33,427 INFO L87 Difference]: Start difference. First operand 216 states and 338 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 4 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2025-03-03 22:05:34,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:05:34,056 INFO L93 Difference]: Finished difference Result 485 states and 750 transitions. [2025-03-03 22:05:34,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 22:05:34,056 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 4 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) Word has length 162 [2025-03-03 22:05:34,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:05:34,059 INFO L225 Difference]: With dead ends: 485 [2025-03-03 22:05:34,059 INFO L226 Difference]: Without dead ends: 322 [2025-03-03 22:05:34,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2025-03-03 22:05:34,060 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 285 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 22:05:34,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 313 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 22:05:34,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-03-03 22:05:34,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 310. [2025-03-03 22:05:34,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 195 states have (on average 1.3384615384615384) internal successors, (261), 197 states have internal predecessors, (261), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-03 22:05:34,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 477 transitions. [2025-03-03 22:05:34,092 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 477 transitions. Word has length 162 [2025-03-03 22:05:34,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:05:34,092 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 477 transitions. [2025-03-03 22:05:34,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 4 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2025-03-03 22:05:34,093 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 477 transitions. [2025-03-03 22:05:34,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 22:05:34,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:05:34,094 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:34,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-03 22:05:34,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:05:34,295 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:05:34,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:05:34,295 INFO L85 PathProgramCache]: Analyzing trace with hash 262810487, now seen corresponding path program 1 times [2025-03-03 22:05:34,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:05:34,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [460635929] [2025-03-03 22:05:34,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:34,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:05:34,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:05:34,297 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:05:34,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-03 22:05:34,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 22:05:34,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 22:05:34,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:34,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:34,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 22:05:34,414 INFO L279 TraceCheckSpWp]: Computing forward predicates...