./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-50.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-pe-ci_file-50.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 dc7b01a2a7c989275ee332c4df25904527cd5d9a922607559c6a4e85b8c49683 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:30:05,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:30:05,483 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:30:05,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:30:05,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:30:05,505 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:30:05,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:30:05,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:30:05,506 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:30:05,506 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:30:05,506 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:30:05,506 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:30:05,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:30:05,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:30:05,507 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:30:05,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:30:05,507 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:30:05,507 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:30:05,507 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:30:05,507 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:30:05,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:30:05,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:30:05,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:30:05,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:30:05,507 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:30:05,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:30:05,507 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:30:05,507 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:30:05,507 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:30:05,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:30:05,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:30:05,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:30:05,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:30:05,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:30:05,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:30:05,508 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:30:05,508 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:30:05,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:30:05,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:30:05,508 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:30:05,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:30:05,508 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:30:05,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:30:05,508 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 -> dc7b01a2a7c989275ee332c4df25904527cd5d9a922607559c6a4e85b8c49683 [2025-03-03 20:30:05,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:30:05,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:30:05,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:30:05,732 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:30:05,732 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:30:05,733 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-pe-ci_file-50.i [2025-03-03 20:30:06,845 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a88553a3/1485728886614cbb85bfa98ecb2c378b/FLAG9b08ccaba [2025-03-03 20:30:07,071 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:30:07,072 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-50.i [2025-03-03 20:30:07,080 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a88553a3/1485728886614cbb85bfa98ecb2c378b/FLAG9b08ccaba [2025-03-03 20:30:07,092 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a88553a3/1485728886614cbb85bfa98ecb2c378b [2025-03-03 20:30:07,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:30:07,096 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:30:07,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:30:07,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:30:07,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:30:07,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:30:07" (1/1) ... [2025-03-03 20:30:07,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a1a9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:07, skipping insertion in model container [2025-03-03 20:30:07,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:30:07" (1/1) ... [2025-03-03 20:30:07,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:30:07,243 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-pe-ci_file-50.i[919,932] [2025-03-03 20:30:07,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:30:07,337 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:30:07,346 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-pe-ci_file-50.i[919,932] [2025-03-03 20:30:07,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:30:07,393 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:30:07,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:07 WrapperNode [2025-03-03 20:30:07,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:30:07,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:30:07,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:30:07,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:30:07,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:07" (1/1) ... [2025-03-03 20:30:07,408 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:07" (1/1) ... [2025-03-03 20:30:07,454 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2025-03-03 20:30:07,455 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:30:07,455 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:30:07,455 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:30:07,455 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:30:07,463 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:07" (1/1) ... [2025-03-03 20:30:07,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:07" (1/1) ... [2025-03-03 20:30:07,470 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:07" (1/1) ... [2025-03-03 20:30:07,495 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 20:30:07,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:07" (1/1) ... [2025-03-03 20:30:07,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:07" (1/1) ... [2025-03-03 20:30:07,509 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:07" (1/1) ... [2025-03-03 20:30:07,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:07" (1/1) ... [2025-03-03 20:30:07,515 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:07" (1/1) ... [2025-03-03 20:30:07,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:07" (1/1) ... [2025-03-03 20:30:07,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:30:07,524 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:30:07,525 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:30:07,525 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:30:07,526 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:07" (1/1) ... [2025-03-03 20:30:07,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:30:07,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:30:07,555 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 20:30:07,560 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 20:30:07,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:30:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:30:07,579 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:30:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:30:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:30:07,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:30:07,649 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:30:07,651 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:30:07,967 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 20:30:07,968 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:30:07,985 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:30:07,987 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-03 20:30:07,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:30:07 BoogieIcfgContainer [2025-03-03 20:30:07,988 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:30:07,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:30:07,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:30:07,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:30:07,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:30:07" (1/3) ... [2025-03-03 20:30:07,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5cfda6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:30:07, skipping insertion in model container [2025-03-03 20:30:07,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:07" (2/3) ... [2025-03-03 20:30:07,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5cfda6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:30:07, skipping insertion in model container [2025-03-03 20:30:07,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:30:07" (3/3) ... [2025-03-03 20:30:07,996 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-50.i [2025-03-03 20:30:08,006 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:30:08,009 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-50.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:30:08,054 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:30:08,064 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;@33d325bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:30:08,065 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:30:08,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 64 states have internal predecessors, (89), 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 20:30:08,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 20:30:08,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:30:08,080 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, 1] [2025-03-03 20:30:08,081 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:30:08,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:30:08,084 INFO L85 PathProgramCache]: Analyzing trace with hash 2111326720, now seen corresponding path program 1 times [2025-03-03 20:30:08,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:30:08,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922109630] [2025-03-03 20:30:08,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:30:08,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:30:08,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 20:30:08,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 20:30:08,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:30:08,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:30:08,353 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 20:30:08,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:30:08,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922109630] [2025-03-03 20:30:08,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922109630] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:30:08,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121169153] [2025-03-03 20:30:08,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:30:08,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:30:08,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:30:08,358 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 20:30:08,360 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 20:30:08,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 20:30:08,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 20:30:08,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:30:08,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:30:08,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:30:08,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:30:08,546 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 20:30:08,546 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:30:08,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121169153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:30:08,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:30:08,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:30:08,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005345427] [2025-03-03 20:30:08,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:30:08,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:30:08,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:30:08,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:30:08,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:30:08,566 INFO L87 Difference]: Start difference. First operand has 90 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 64 states have internal predecessors, (89), 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 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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 20:30:08,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:30:08,586 INFO L93 Difference]: Finished difference Result 174 states and 293 transitions. [2025-03-03 20:30:08,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:30:08,588 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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 165 [2025-03-03 20:30:08,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:30:08,592 INFO L225 Difference]: With dead ends: 174 [2025-03-03 20:30:08,592 INFO L226 Difference]: Without dead ends: 87 [2025-03-03 20:30:08,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 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 20:30:08,596 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:30:08,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:30:08,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-03 20:30:08,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-03 20:30:08,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 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 20:30:08,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 131 transitions. [2025-03-03 20:30:08,626 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 131 transitions. Word has length 165 [2025-03-03 20:30:08,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:30:08,626 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 131 transitions. [2025-03-03 20:30:08,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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 20:30:08,626 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 131 transitions. [2025-03-03 20:30:08,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 20:30:08,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:30:08,628 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, 1] [2025-03-03 20:30:08,635 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 20:30:08,829 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 20:30:08,829 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:30:08,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:30:08,830 INFO L85 PathProgramCache]: Analyzing trace with hash -417000478, now seen corresponding path program 1 times [2025-03-03 20:30:08,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:30:08,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100441662] [2025-03-03 20:30:08,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:30:08,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:30:08,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 20:30:08,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 20:30:08,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:30:08,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:30:09,020 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 20:30:09,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:30:09,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100441662] [2025-03-03 20:30:09,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100441662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:30:09,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:30:09,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:30:09,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892539453] [2025-03-03 20:30:09,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:30:09,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:30:09,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:30:09,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:30:09,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:30:09,024 INFO L87 Difference]: Start difference. First operand 87 states and 131 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 20:30:09,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:30:09,082 INFO L93 Difference]: Finished difference Result 172 states and 261 transitions. [2025-03-03 20:30:09,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:30:09,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 165 [2025-03-03 20:30:09,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:30:09,084 INFO L225 Difference]: With dead ends: 172 [2025-03-03 20:30:09,084 INFO L226 Difference]: Without dead ends: 88 [2025-03-03 20:30:09,085 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 20:30:09,087 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:30:09,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 247 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:30:09,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-03 20:30:09,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-03 20:30:09,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 62 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 20:30:09,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 132 transitions. [2025-03-03 20:30:09,100 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 132 transitions. Word has length 165 [2025-03-03 20:30:09,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:30:09,103 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 132 transitions. [2025-03-03 20:30:09,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 20:30:09,103 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 132 transitions. [2025-03-03 20:30:09,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 20:30:09,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:30:09,106 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, 1, 1] [2025-03-03 20:30:09,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:30:09,106 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:30:09,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:30:09,107 INFO L85 PathProgramCache]: Analyzing trace with hash -68833498, now seen corresponding path program 1 times [2025-03-03 20:30:09,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:30:09,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726882946] [2025-03-03 20:30:09,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:30:09,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:30:09,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 20:30:09,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 20:30:09,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:30:09,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:30:09,319 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 20:30:09,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:30:09,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726882946] [2025-03-03 20:30:09,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726882946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:30:09,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:30:09,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:30:09,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266751111] [2025-03-03 20:30:09,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:30:09,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:30:09,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:30:09,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:30:09,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:30:09,323 INFO L87 Difference]: Start difference. First operand 88 states and 132 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 20:30:09,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:30:09,471 INFO L93 Difference]: Finished difference Result 173 states and 261 transitions. [2025-03-03 20:30:09,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:30:09,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 166 [2025-03-03 20:30:09,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:30:09,476 INFO L225 Difference]: With dead ends: 173 [2025-03-03 20:30:09,476 INFO L226 Difference]: Without dead ends: 88 [2025-03-03 20:30:09,476 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 20:30:09,477 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 124 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:30:09,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 189 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:30:09,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-03 20:30:09,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-03 20:30:09,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 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 20:30:09,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 131 transitions. [2025-03-03 20:30:09,490 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 131 transitions. Word has length 166 [2025-03-03 20:30:09,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:30:09,490 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 131 transitions. [2025-03-03 20:30:09,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 20:30:09,491 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 131 transitions. [2025-03-03 20:30:09,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 20:30:09,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:30:09,492 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, 1, 1] [2025-03-03 20:30:09,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:30:09,492 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:30:09,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:30:09,493 INFO L85 PathProgramCache]: Analyzing trace with hash -913305369, now seen corresponding path program 1 times [2025-03-03 20:30:09,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:30:09,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718582905] [2025-03-03 20:30:09,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:30:09,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:30:09,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 20:30:09,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 20:30:09,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:30:09,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:30:09,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-03 20:30:09,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:30:09,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718582905] [2025-03-03 20:30:09,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718582905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:30:09,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545920523] [2025-03-03 20:30:09,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:30:09,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:30:09,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:30:09,918 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 20:30:09,920 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 20:30:09,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 20:30:10,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 20:30:10,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:30:10,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:30:10,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 20:30:10,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:30:10,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 615 proven. 51 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2025-03-03 20:30:10,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:30:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 81 proven. 54 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2025-03-03 20:30:10,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545920523] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:30:10,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:30:10,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 17 [2025-03-03 20:30:10,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632019131] [2025-03-03 20:30:10,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:30:10,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 20:30:10,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:30:10,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 20:30:10,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:30:10,896 INFO L87 Difference]: Start difference. First operand 88 states and 131 transitions. Second operand has 17 states, 16 states have (on average 7.0) internal successors, (112), 17 states have internal predecessors, (112), 5 states have call successors, (51), 3 states have call predecessors, (51), 7 states have return successors, (52), 4 states have call predecessors, (52), 5 states have call successors, (52) [2025-03-03 20:30:12,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:30:12,206 INFO L93 Difference]: Finished difference Result 389 states and 549 transitions. [2025-03-03 20:30:12,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-03 20:30:12,207 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 7.0) internal successors, (112), 17 states have internal predecessors, (112), 5 states have call successors, (51), 3 states have call predecessors, (51), 7 states have return successors, (52), 4 states have call predecessors, (52), 5 states have call successors, (52) Word has length 166 [2025-03-03 20:30:12,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:30:12,210 INFO L225 Difference]: With dead ends: 389 [2025-03-03 20:30:12,212 INFO L226 Difference]: Without dead ends: 304 [2025-03-03 20:30:12,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 327 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1435 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1034, Invalid=3388, Unknown=0, NotChecked=0, Total=4422 [2025-03-03 20:30:12,216 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 561 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:30:12,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 428 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:30:12,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-03 20:30:12,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 121. [2025-03-03 20:30:12,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 20:30:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 167 transitions. [2025-03-03 20:30:12,241 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 167 transitions. Word has length 166 [2025-03-03 20:30:12,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:30:12,241 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 167 transitions. [2025-03-03 20:30:12,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 7.0) internal successors, (112), 17 states have internal predecessors, (112), 5 states have call successors, (51), 3 states have call predecessors, (51), 7 states have return successors, (52), 4 states have call predecessors, (52), 5 states have call successors, (52) [2025-03-03 20:30:12,242 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 167 transitions. [2025-03-03 20:30:12,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 20:30:12,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:30:12,243 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, 1, 1, 1] [2025-03-03 20:30:12,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 20:30:12,447 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,SelfDestructingSolverStorable3 [2025-03-03 20:30:12,447 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:30:12,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:30:12,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1973944324, now seen corresponding path program 1 times [2025-03-03 20:30:12,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:30:12,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966907278] [2025-03-03 20:30:12,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:30:12,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:30:12,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 20:30:12,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 20:30:12,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:30:12,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:30:14,569 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 20:30:14,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:30:14,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966907278] [2025-03-03 20:30:14,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966907278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:30:14,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:30:14,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 20:30:14,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083791467] [2025-03-03 20:30:14,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:30:14,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 20:30:14,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:30:14,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 20:30:14,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:30:14,573 INFO L87 Difference]: Start difference. First operand 121 states and 167 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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 20:30:16,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:30:16,894 INFO L93 Difference]: Finished difference Result 398 states and 546 transitions. [2025-03-03 20:30:16,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 20:30:16,895 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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 167 [2025-03-03 20:30:16,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:30:16,901 INFO L225 Difference]: With dead ends: 398 [2025-03-03 20:30:16,901 INFO L226 Difference]: Without dead ends: 280 [2025-03-03 20:30:16,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-03 20:30:16,902 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 237 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:30:16,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 928 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 20:30:16,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-03 20:30:16,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 219. [2025-03-03 20:30:16,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 175 states have (on average 1.32) internal successors, (231), 176 states have internal predecessors, (231), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 20:30:16,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 303 transitions. [2025-03-03 20:30:16,927 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 303 transitions. Word has length 167 [2025-03-03 20:30:16,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:30:16,928 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 303 transitions. [2025-03-03 20:30:16,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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 20:30:16,928 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 303 transitions. [2025-03-03 20:30:16,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 20:30:16,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:30:16,929 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, 1, 1, 1] [2025-03-03 20:30:16,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:30:16,929 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:30:16,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:30:16,930 INFO L85 PathProgramCache]: Analyzing trace with hash 176992965, now seen corresponding path program 1 times [2025-03-03 20:30:16,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:30:16,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126171113] [2025-03-03 20:30:16,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:30:16,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:30:16,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 20:30:16,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 20:30:16,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:30:16,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:30:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-03 20:30:17,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:30:17,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126171113] [2025-03-03 20:30:17,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126171113] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:30:17,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856634406] [2025-03-03 20:30:17,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:30:17,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:30:17,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:30:17,609 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 20:30:17,611 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 20:30:17,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 20:30:17,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 20:30:17,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:30:17,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:30:17,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 20:30:17,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:30:18,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 503 proven. 90 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2025-03-03 20:30:18,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:30:18,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 42 proven. 93 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2025-03-03 20:30:18,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856634406] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:30:18,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:30:18,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 35 [2025-03-03 20:30:18,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193433815] [2025-03-03 20:30:18,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:30:18,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-03 20:30:18,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:30:18,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-03 20:30:18,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 20:30:18,809 INFO L87 Difference]: Start difference. First operand 219 states and 303 transitions. Second operand has 35 states, 33 states have (on average 3.606060606060606) internal successors, (119), 33 states have internal predecessors, (119), 8 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (58), 7 states have call predecessors, (58), 8 states have call successors, (58) [2025-03-03 20:30:21,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:30:21,705 INFO L93 Difference]: Finished difference Result 647 states and 871 transitions. [2025-03-03 20:30:21,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-03 20:30:21,705 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 3.606060606060606) internal successors, (119), 33 states have internal predecessors, (119), 8 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (58), 7 states have call predecessors, (58), 8 states have call successors, (58) Word has length 167 [2025-03-03 20:30:21,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:30:21,708 INFO L225 Difference]: With dead ends: 647 [2025-03-03 20:30:21,708 INFO L226 Difference]: Without dead ends: 431 [2025-03-03 20:30:21,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1454, Invalid=4246, Unknown=0, NotChecked=0, Total=5700 [2025-03-03 20:30:21,711 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 1850 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 1387 mSolverCounterSat, 392 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1850 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 392 IncrementalHoareTripleChecker+Valid, 1387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:30:21,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1850 Valid, 964 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [392 Valid, 1387 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 20:30:21,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-03-03 20:30:21,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 252. [2025-03-03 20:30:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 194 states have (on average 1.2474226804123711) internal successors, (242), 196 states have internal predecessors, (242), 43 states have call successors, (43), 14 states have call predecessors, (43), 14 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-03 20:30:21,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 328 transitions. [2025-03-03 20:30:21,748 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 328 transitions. Word has length 167 [2025-03-03 20:30:21,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:30:21,748 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 328 transitions. [2025-03-03 20:30:21,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 3.606060606060606) internal successors, (119), 33 states have internal predecessors, (119), 8 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (58), 7 states have call predecessors, (58), 8 states have call successors, (58) [2025-03-03 20:30:21,749 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 328 transitions. [2025-03-03 20:30:21,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 20:30:21,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:30:21,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, 1, 1, 1, 1, 1, 1] [2025-03-03 20:30:21,757 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 20:30:21,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:30:21,954 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:30:21,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:30:21,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1431101609, now seen corresponding path program 1 times [2025-03-03 20:30:21,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:30:21,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980349750] [2025-03-03 20:30:21,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:30:21,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:30:21,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 20:30:22,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 20:30:22,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:30:22,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:30:22,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-03 20:30:22,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:30:22,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980349750] [2025-03-03 20:30:22,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980349750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:30:22,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992756778] [2025-03-03 20:30:22,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:30:22,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:30:22,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:30:22,439 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 20:30:22,441 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 20:30:22,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 20:30:22,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 20:30:22,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:30:22,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:30:22,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 20:30:22,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:30:22,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 503 proven. 90 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2025-03-03 20:30:22,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:30:24,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992756778] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:30:24,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 20:30:24,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2025-03-03 20:30:24,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842211074] [2025-03-03 20:30:24,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 20:30:24,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 20:30:24,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:30:24,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 20:30:24,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-03 20:30:24,064 INFO L87 Difference]: Start difference. First operand 252 states and 328 transitions. Second operand has 12 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 4 states have call predecessors, (41), 5 states have call successors, (41) [2025-03-03 20:30:24,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:30:24,451 INFO L93 Difference]: Finished difference Result 444 states and 571 transitions. [2025-03-03 20:30:24,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 20:30:24,452 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 4 states have call predecessors, (41), 5 states have call successors, (41) Word has length 168 [2025-03-03 20:30:24,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:30:24,453 INFO L225 Difference]: With dead ends: 444 [2025-03-03 20:30:24,453 INFO L226 Difference]: Without dead ends: 216 [2025-03-03 20:30:24,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2025-03-03 20:30:24,454 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 127 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:30:24,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 384 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:30:24,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-03 20:30:24,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 208. [2025-03-03 20:30:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 150 states have (on average 1.1733333333333333) internal successors, (176), 152 states have internal predecessors, (176), 43 states have call successors, (43), 14 states have call predecessors, (43), 14 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-03 20:30:24,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 262 transitions. [2025-03-03 20:30:24,481 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 262 transitions. Word has length 168 [2025-03-03 20:30:24,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:30:24,481 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 262 transitions. [2025-03-03 20:30:24,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 4 states have call predecessors, (41), 5 states have call successors, (41) [2025-03-03 20:30:24,481 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 262 transitions. [2025-03-03 20:30:24,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 20:30:24,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:30:24,482 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, 1, 1, 1, 1, 1] [2025-03-03 20:30:24,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 20:30:24,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:30:24,683 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:30:24,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:30:24,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1681480832, now seen corresponding path program 1 times [2025-03-03 20:30:24,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:30:24,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189212600] [2025-03-03 20:30:24,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:30:24,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:30:24,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 20:30:24,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 20:30:24,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:30:24,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:30:24,798 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 20:30:24,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:30:24,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189212600] [2025-03-03 20:30:24,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189212600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:30:24,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:30:24,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:30:24,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547837800] [2025-03-03 20:30:24,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:30:24,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:30:24,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:30:24,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:30:24,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:30:24,800 INFO L87 Difference]: Start difference. First operand 208 states and 262 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 20:30:24,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:30:24,838 INFO L93 Difference]: Finished difference Result 396 states and 501 transitions. [2025-03-03 20:30:24,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:30:24,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 169 [2025-03-03 20:30:24,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:30:24,840 INFO L225 Difference]: With dead ends: 396 [2025-03-03 20:30:24,840 INFO L226 Difference]: Without dead ends: 212 [2025-03-03 20:30:24,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:30:24,841 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:30:24,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:30:24,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-03 20:30:24,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2025-03-03 20:30:24,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 154 states have (on average 1.1688311688311688) internal successors, (180), 156 states have internal predecessors, (180), 43 states have call successors, (43), 14 states have call predecessors, (43), 14 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-03 20:30:24,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 266 transitions. [2025-03-03 20:30:24,866 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 266 transitions. Word has length 169 [2025-03-03 20:30:24,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:30:24,867 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 266 transitions. [2025-03-03 20:30:24,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 20:30:24,867 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 266 transitions. [2025-03-03 20:30:24,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 20:30:24,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:30:24,868 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, 1, 1, 1, 1, 1, 1] [2025-03-03 20:30:24,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:30:24,868 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:30:24,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:30:24,869 INFO L85 PathProgramCache]: Analyzing trace with hash 559577672, now seen corresponding path program 1 times [2025-03-03 20:30:24,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:30:24,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555681111] [2025-03-03 20:30:24,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:30:24,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:30:24,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 20:30:24,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 20:30:24,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:30:24,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:30:25,261 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 20:30:25,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:30:25,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555681111] [2025-03-03 20:30:25,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555681111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:30:25,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:30:25,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 20:30:25,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420051906] [2025-03-03 20:30:25,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:30:25,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:30:25,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:30:25,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:30:25,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:30:25,263 INFO L87 Difference]: Start difference. First operand 212 states and 266 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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 20:30:25,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:30:25,788 INFO L93 Difference]: Finished difference Result 576 states and 712 transitions. [2025-03-03 20:30:25,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 20:30:25,789 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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 170 [2025-03-03 20:30:25,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:30:25,791 INFO L225 Difference]: With dead ends: 576 [2025-03-03 20:30:25,792 INFO L226 Difference]: Without dead ends: 388 [2025-03-03 20:30:25,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:30:25,793 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 492 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:30:25,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 406 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:30:25,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-03-03 20:30:25,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 206. [2025-03-03 20:30:25,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 157 states have (on average 1.2038216560509554) internal successors, (189), 158 states have internal predecessors, (189), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 20:30:25,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 261 transitions. [2025-03-03 20:30:25,827 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 261 transitions. Word has length 170 [2025-03-03 20:30:25,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:30:25,828 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 261 transitions. [2025-03-03 20:30:25,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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 20:30:25,829 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 261 transitions. [2025-03-03 20:30:25,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 20:30:25,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:30:25,830 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, 1, 1, 1, 1, 1, 1] [2025-03-03 20:30:25,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:30:25,830 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:30:25,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:30:25,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1263995496, now seen corresponding path program 1 times [2025-03-03 20:30:25,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:30:25,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580903236] [2025-03-03 20:30:25,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:30:25,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:30:25,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 20:30:25,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 20:30:25,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:30:25,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:30:32,409 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 20:30:32,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:30:32,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580903236] [2025-03-03 20:30:32,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580903236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:30:32,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:30:32,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 20:30:32,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961543633] [2025-03-03 20:30:32,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:30:32,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 20:30:32,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:30:32,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 20:30:32,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:30:32,410 INFO L87 Difference]: Start difference. First operand 206 states and 261 transitions. Second operand has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 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 20:30:40,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 20:30:41,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:30:41,774 INFO L93 Difference]: Finished difference Result 639 states and 802 transitions. [2025-03-03 20:30:41,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 20:30:41,775 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 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 170 [2025-03-03 20:30:41,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:30:41,777 INFO L225 Difference]: With dead ends: 639 [2025-03-03 20:30:41,778 INFO L226 Difference]: Without dead ends: 436 [2025-03-03 20:30:41,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=243, Invalid=627, Unknown=0, NotChecked=0, Total=870 [2025-03-03 20:30:41,779 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 612 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:30:41,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 1013 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1079 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2025-03-03 20:30:41,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-03 20:30:41,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 380. [2025-03-03 20:30:41,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 282 states have (on average 1.1843971631205674) internal successors, (334), 284 states have internal predecessors, (334), 72 states have call successors, (72), 25 states have call predecessors, (72), 25 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 20:30:41,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 478 transitions. [2025-03-03 20:30:41,836 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 478 transitions. Word has length 170 [2025-03-03 20:30:41,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:30:41,836 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 478 transitions. [2025-03-03 20:30:41,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 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 20:30:41,837 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 478 transitions. [2025-03-03 20:30:41,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 20:30:41,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:30:41,838 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, 1, 1, 1, 1, 1, 1] [2025-03-03 20:30:41,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:30:41,838 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:30:41,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:30:41,840 INFO L85 PathProgramCache]: Analyzing trace with hash 2108467367, now seen corresponding path program 1 times [2025-03-03 20:30:41,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:30:41,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573039756] [2025-03-03 20:30:41,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:30:41,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:30:41,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 20:30:41,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 20:30:41,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:30:41,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:30:44,995 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 20:30:44,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:30:44,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573039756] [2025-03-03 20:30:44,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573039756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:30:44,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:30:44,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 20:30:44,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117652450] [2025-03-03 20:30:44,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:30:44,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 20:30:44,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:30:44,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 20:30:44,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-03-03 20:30:44,996 INFO L87 Difference]: Start difference. First operand 380 states and 478 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 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 20:30:48,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:30:48,363 INFO L93 Difference]: Finished difference Result 484 states and 604 transitions. [2025-03-03 20:30:48,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 20:30:48,364 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 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 170 [2025-03-03 20:30:48,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:30:48,366 INFO L225 Difference]: With dead ends: 484 [2025-03-03 20:30:48,366 INFO L226 Difference]: Without dead ends: 482 [2025-03-03 20:30:48,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=441, Invalid=965, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 20:30:48,367 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 856 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 20:30:48,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 1028 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 20:30:48,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-03-03 20:30:48,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 382. [2025-03-03 20:30:48,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 284 states have (on average 1.1866197183098592) internal successors, (337), 286 states have internal predecessors, (337), 72 states have call successors, (72), 25 states have call predecessors, (72), 25 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 20:30:48,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 481 transitions. [2025-03-03 20:30:48,418 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 481 transitions. Word has length 170 [2025-03-03 20:30:48,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:30:48,418 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 481 transitions. [2025-03-03 20:30:48,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 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 20:30:48,419 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 481 transitions. [2025-03-03 20:30:48,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 20:30:48,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:30:48,420 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:30:48,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:30:48,420 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:30:48,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:30:48,420 INFO L85 PathProgramCache]: Analyzing trace with hash 57578169, now seen corresponding path program 1 times [2025-03-03 20:30:48,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:30:48,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465793196] [2025-03-03 20:30:48,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:30:48,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:30:48,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 20:30:48,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 20:30:48,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:30:48,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 20:30:48,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1745204431] [2025-03-03 20:30:48,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:30:48,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:30:48,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:30:48,475 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:30:48,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 20:30:48,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 20:30:48,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 20:30:48,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:30:48,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:30:48,718 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 20:30:48,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 20:30:48,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 20:30:48,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:30:48,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:30:48,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 20:30:48,860 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 20:30:48,861 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 20:30:48,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 20:30:49,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 20:30:49,066 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:30:49,143 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 20:30:49,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 08:30:49 BoogieIcfgContainer [2025-03-03 20:30:49,145 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 20:30:49,146 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 20:30:49,146 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 20:30:49,146 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 20:30:49,146 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:30:07" (3/4) ... [2025-03-03 20:30:49,148 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 20:30:49,148 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 20:30:49,149 INFO L158 Benchmark]: Toolchain (without parser) took 42052.93ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 112.5MB in the beginning and 552.3MB in the end (delta: -439.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-03 20:30:49,149 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:30:49,149 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.74ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 96.4MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 20:30:49,149 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.88ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 91.9MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:30:49,149 INFO L158 Benchmark]: Boogie Preprocessor took 68.09ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 84.9MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 20:30:49,150 INFO L158 Benchmark]: IcfgBuilder took 463.29ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 56.4MB in the end (delta: 28.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 20:30:49,150 INFO L158 Benchmark]: TraceAbstraction took 41155.56ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 56.0MB in the beginning and 552.4MB in the end (delta: -496.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:30:49,150 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 629.1MB. Free memory was 552.4MB in the beginning and 552.3MB in the end (delta: 132.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 20:30:49,151 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.21ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.74ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 96.4MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.88ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 91.9MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.09ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 84.9MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 463.29ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 56.4MB in the end (delta: 28.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 41155.56ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 56.0MB in the beginning and 552.4MB in the end (delta: -496.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 629.1MB. Free memory was 552.4MB in the beginning and 552.3MB in the end (delta: 132.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 someBinaryFLOATComparisonOperation at line 133, overapproximation of someBinaryFLOATComparisonOperation at line 135, overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of someBinaryFLOATComparisonOperation at line 57, overapproximation of someBinaryFLOATComparisonOperation at line 137, overapproximation of bitwiseAnd at line 117, overapproximation of bitwiseAnd at line 100, overapproximation of someUnaryDOUBLEoperation at line 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 164, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 162, overapproximation of someBinaryArithmeticFLOAToperation at line 57, overapproximation of someUnaryFLOAToperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_7 = 0; [L24] unsigned char var_1_8 = 1; [L25] signed short int var_1_9 = -2; [L26] float var_1_13 = 999.4; [L27] float var_1_14 = 100.425; [L28] float var_1_15 = 3.375; [L29] float var_1_16 = 15.9; [L30] signed short int var_1_17 = -10; [L31] signed short int var_1_18 = 18060; [L32] unsigned char var_1_20 = 0; [L33] unsigned long int var_1_21 = 4; [L34] unsigned char var_1_23 = 0; [L35] unsigned char var_1_24 = 0; [L36] unsigned char var_1_25 = 100; [L37] unsigned char var_1_26 = 32; [L38] unsigned char var_1_27 = 10; [L39] unsigned char var_1_28 = 1; [L40] unsigned short int var_1_29 = 256; [L41] unsigned char var_1_30 = 1; [L42] unsigned char var_1_31 = 4; [L43] double var_1_33 = 31.625; [L44] double var_1_36 = 15.75; [L45] double var_1_37 = 15.375; [L46] unsigned short int var_1_38 = 16; [L47] unsigned char var_1_39 = 0; [L48] double var_1_44 = 128.5; [L49] float var_1_45 = 1.85; [L50] double var_1_46 = 1.5; [L51] double var_1_47 = 99999999999.4; [L52] unsigned char var_1_49 = 128; VAL [isInitial=0, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=0, var_1_8=1, var_1_9=-2] [L173] isInitial = 1 [L174] FCALL initially() [L175] COND TRUE 1 [L176] FCALL updateLastVariables() [L177] CALL updateVariables() [L126] var_1_7 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L127] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L128] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L128] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L129] var_1_8 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L130] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L131] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L131] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L132] var_1_14 = __VERIFIER_nondet_float() [L133] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L133] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L134] var_1_15 = __VERIFIER_nondet_float() [L135] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L135] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L136] var_1_16 = __VERIFIER_nondet_float() [L137] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L137] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L138] var_1_18 = __VERIFIER_nondet_short() [L139] CALL assume_abort_if_not(var_1_18 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L139] RET assume_abort_if_not(var_1_18 >= 16382) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L140] CALL assume_abort_if_not(var_1_18 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L140] RET assume_abort_if_not(var_1_18 <= 32766) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L141] var_1_21 = __VERIFIER_nondet_ulong() [L142] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L142] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L143] CALL assume_abort_if_not(var_1_21 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L143] RET assume_abort_if_not(var_1_21 <= 4294967295) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L144] CALL assume_abort_if_not(var_1_21 != 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L144] RET assume_abort_if_not(var_1_21 != 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L145] var_1_23 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L146] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L147] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L147] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L148] var_1_24 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L149] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L150] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L150] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L151] var_1_26 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L152] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L153] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L153] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L154] var_1_27 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L155] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L156] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L156] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L157] var_1_36 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L158] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L159] var_1_37 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L160] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L161] var_1_46 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_46 >= 0.0F && var_1_46 <= -1.0e-20F) || (var_1_46 <= 9223372.036854776000e+12F && var_1_46 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L162] RET assume_abort_if_not((var_1_46 >= 0.0F && var_1_46 <= -1.0e-20F) || (var_1_46 <= 9223372.036854776000e+12F && var_1_46 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L163] var_1_47 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_47 >= 0.0F && var_1_47 <= -1.0e-20F) || (var_1_47 <= 9223372.036854776000e+12F && var_1_47 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L164] RET assume_abort_if_not((var_1_47 >= 0.0F && var_1_47 <= -1.0e-20F) || (var_1_47 <= 9223372.036854776000e+12F && var_1_47 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L177] RET updateVariables() [L178] CALL step() [L56] COND TRUE \read(var_1_8) [L57] var_1_13 = (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L59] COND TRUE \read(var_1_8) [L60] var_1_25 = (var_1_26 + var_1_27) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L62] var_1_29 = var_1_27 [L63] var_1_30 = var_1_8 VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L64] COND FALSE !((var_1_29 > var_1_25) && var_1_30) [L67] var_1_9 = ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=1] [L69] var_1_17 = ((var_1_18 - 25) - var_1_25) [L70] signed long int stepLocal_2 = var_1_25 + var_1_17; VAL [isInitial=1, stepLocal_2=32741, var_1_13=2, var_1_16=0, var_1_17=32740, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=1] [L71] COND TRUE ((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < stepLocal_2 [L72] var_1_20 = (var_1_23 || var_1_24) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=32740, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=1] [L76] signed short int stepLocal_3 = var_1_9; VAL [isInitial=1, stepLocal_3=1, var_1_13=2, var_1_16=0, var_1_17=32740, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=1] [L77] COND FALSE !((~ var_1_29) > stepLocal_3) [L80] var_1_28 = (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=32740, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=1] [L82] signed long int stepLocal_1 = (((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25)); [L83] unsigned char stepLocal_0 = var_1_25; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=1, var_1_13=2, var_1_16=0, var_1_17=32740, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=1] [L84] COND FALSE !(stepLocal_1 <= (var_1_25 - var_1_25)) [L93] var_1_1 = 0 VAL [isInitial=1, stepLocal_0=1, var_1_13=2, var_1_16=0, var_1_17=32740, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=1] [L95] var_1_31 = var_1_26 VAL [isInitial=1, stepLocal_0=1, var_1_13=2, var_1_16=0, var_1_17=32740, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=1] [L96] COND FALSE !(! var_1_7) VAL [isInitial=1, stepLocal_0=1, var_1_13=2, var_1_16=0, var_1_17=32740, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=1] [L99] var_1_38 = ((((var_1_27) > (var_1_27)) ? (var_1_27) : (var_1_27))) VAL [isInitial=1, stepLocal_0=1, var_1_13=2, var_1_16=0, var_1_17=32740, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_38=1, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=1] [L100] EXPR var_1_18 & (var_1_29 + 2u) VAL [isInitial=1, stepLocal_0=1, var_1_13=2, var_1_16=0, var_1_17=32740, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_38=1, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=1] [L100] EXPR 16u >> var_1_26 VAL [isInitial=1, stepLocal_0=1, var_1_13=2, var_1_16=0, var_1_17=32740, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_38=1, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=1] [L100] COND TRUE (var_1_18 & (var_1_29 + 2u)) < (16u >> var_1_26) [L101] var_1_39 = ((var_1_7 && (var_1_7 && var_1_8)) && (! var_1_23)) VAL [isInitial=1, stepLocal_0=1, var_1_13=2, var_1_16=0, var_1_17=32740, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_38=1, var_1_39=1, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=1] [L103] COND FALSE !(var_1_36 <= var_1_16) [L108] var_1_44 = var_1_36 VAL [isInitial=1, stepLocal_0=1, var_1_13=2, var_1_16=0, var_1_17=32740, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=3, var_1_38=1, var_1_39=1, var_1_44=3, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=1] [L110] COND FALSE !((var_1_14 * (var_1_46 - var_1_47)) < var_1_14) [L115] var_1_45 = (((((((((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) < (var_1_37)) ? (((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) : (var_1_37))) < 0 ) ? -((((((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) < (var_1_37)) ? (((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) : (var_1_37))) : ((((((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) < (var_1_37)) ? (((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) : (var_1_37))))) VAL [isInitial=1, stepLocal_0=1, var_1_13=2, var_1_14=0, var_1_16=0, var_1_17=32740, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=3, var_1_37=0, var_1_38=1, var_1_39=1, var_1_44=3, var_1_45=4, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=1] [L117] var_1_20 || (var_1_26 >= (var_1_18 & var_1_27)) VAL [isInitial=1, stepLocal_0=1, var_1_13=2, var_1_14=0, var_1_16=0, var_1_17=32740, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=3, var_1_37=0, var_1_38=1, var_1_39=1, var_1_44=3, var_1_45=4, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=1] [L117] EXPR var_1_18 & var_1_27 VAL [isInitial=1, stepLocal_0=1, var_1_13=2, var_1_14=0, var_1_16=0, var_1_17=32740, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=3, var_1_37=0, var_1_38=1, var_1_39=1, var_1_44=3, var_1_45=4, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=1] [L117] var_1_20 || (var_1_26 >= (var_1_18 & var_1_27)) VAL [isInitial=1, stepLocal_0=1, var_1_13=2, var_1_14=0, var_1_16=0, var_1_17=32740, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=3, var_1_37=0, var_1_38=1, var_1_39=1, var_1_44=3, var_1_45=4, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=1] [L117] COND FALSE !(var_1_20 || (var_1_26 >= (var_1_18 & var_1_27))) [L178] RET step() [L179] CALL, EXPR property() [L169-L170] return (((((((((((((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25))) <= (var_1_25 - var_1_25)) ? ((var_1_25 < var_1_25) ? (var_1_20 ? (var_1_1 == ((unsigned char) var_1_7)) : (var_1_1 == ((unsigned char) var_1_8))) : 1) : (var_1_1 == ((unsigned char) 0))) && (((var_1_29 > var_1_25) && var_1_30) ? (var_1_9 == ((signed short int) var_1_25)) : (var_1_9 == ((signed short int) ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))))))) && (var_1_8 ? (var_1_13 == ((float) (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))))) : 1)) && (var_1_17 == ((signed short int) ((var_1_18 - 25) - var_1_25)))) && ((((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < (var_1_25 + var_1_17)) ? (var_1_20 == ((unsigned char) (var_1_23 || var_1_24))) : (var_1_20 == ((unsigned char) var_1_7)))) && (var_1_8 ? (var_1_25 == ((unsigned char) (var_1_26 + var_1_27))) : 1)) && (((~ var_1_29) > var_1_9) ? (var_1_28 == ((unsigned char) (! var_1_7))) : (var_1_28 == ((unsigned char) (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))))))) && (var_1_29 == ((unsigned short int) var_1_27))) && (var_1_30 == ((unsigned char) var_1_8)) ; VAL [\result=0, isInitial=1, var_1_13=2, var_1_14=0, var_1_16=0, var_1_17=32740, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=3, var_1_37=0, var_1_38=1, var_1_39=1, var_1_44=3, var_1_45=4, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=1] [L179] RET, EXPR property() [L179] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_16=0, var_1_17=32740, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=3, var_1_37=0, var_1_38=1, var_1_39=1, var_1_44=3, var_1_45=4, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_16=0, var_1_17=32740, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=32767, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=-511, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=3, var_1_37=0, var_1_38=1, var_1_39=1, var_1_44=3, var_1_45=4, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.0s, OverallIterations: 12, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 4866 SdHoareTripleChecker+Valid, 9.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4859 mSDsluCounter, 6060 SdHoareTripleChecker+Invalid, 8.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4672 mSDsCounter, 1082 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4984 IncrementalHoareTripleChecker+Invalid, 6067 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1082 mSolverCounterUnsat, 1388 mSDtfsCounter, 4984 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1293 GetRequests, 1041 SyntacticMatches, 2 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2898 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=382occurred in iteration=11, InterpolantAutomatonStates: 184, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 769 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 2851 NumberOfCodeBlocks, 2851 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2825 ConstructedInterpolants, 0 QuantifiedInterpolants, 19172 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1573 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 18200/18768 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 20:30:49,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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-pe-ci_file-50.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 dc7b01a2a7c989275ee332c4df25904527cd5d9a922607559c6a4e85b8c49683 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:30:50,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:30:51,082 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 20:30:51,086 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:30:51,086 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:30:51,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:30:51,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:30:51,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:30:51,113 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:30:51,113 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:30:51,113 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:30:51,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:30:51,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:30:51,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:30:51,114 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:30:51,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:30:51,114 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:30:51,115 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:30:51,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:30:51,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:30:51,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:30:51,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:30:51,115 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:30:51,115 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 20:30:51,115 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 20:30:51,116 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 20:30:51,116 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:30:51,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:30:51,116 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:30:51,116 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:30:51,116 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:30:51,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:30:51,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:30:51,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:30:51,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:30:51,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:30:51,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:30:51,117 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:30:51,117 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:30:51,117 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 20:30:51,118 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 20:30:51,118 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:30:51,118 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:30:51,118 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:30:51,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:30:51,118 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 -> dc7b01a2a7c989275ee332c4df25904527cd5d9a922607559c6a4e85b8c49683 [2025-03-03 20:30:51,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:30:51,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:30:51,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:30:51,376 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:30:51,376 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:30:51,379 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-pe-ci_file-50.i [2025-03-03 20:30:52,585 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b52c83f6/f9fa1be6626440388175ec2ecd153eae/FLAGab8653c4d [2025-03-03 20:30:52,836 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:30:52,837 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-50.i [2025-03-03 20:30:52,846 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b52c83f6/f9fa1be6626440388175ec2ecd153eae/FLAGab8653c4d [2025-03-03 20:30:53,160 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b52c83f6/f9fa1be6626440388175ec2ecd153eae [2025-03-03 20:30:53,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:30:53,163 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:30:53,164 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:30:53,164 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:30:53,167 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:30:53,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:30:53" (1/1) ... [2025-03-03 20:30:53,168 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b2ed4f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:53, skipping insertion in model container [2025-03-03 20:30:53,168 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:30:53" (1/1) ... [2025-03-03 20:30:53,181 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:30:53,275 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-pe-ci_file-50.i[919,932] [2025-03-03 20:30:53,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:30:53,335 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:30:53,343 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-pe-ci_file-50.i[919,932] [2025-03-03 20:30:53,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:30:53,392 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:30:53,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:53 WrapperNode [2025-03-03 20:30:53,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:30:53,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:30:53,394 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:30:53,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:30:53,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:53" (1/1) ... [2025-03-03 20:30:53,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:53" (1/1) ... [2025-03-03 20:30:53,425 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2025-03-03 20:30:53,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:30:53,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:30:53,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:30:53,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:30:53,433 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:53" (1/1) ... [2025-03-03 20:30:53,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:53" (1/1) ... [2025-03-03 20:30:53,436 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:53" (1/1) ... [2025-03-03 20:30:53,446 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 20:30:53,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:53" (1/1) ... [2025-03-03 20:30:53,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:53" (1/1) ... [2025-03-03 20:30:53,453 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:53" (1/1) ... [2025-03-03 20:30:53,454 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:53" (1/1) ... [2025-03-03 20:30:53,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:53" (1/1) ... [2025-03-03 20:30:53,456 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:53" (1/1) ... [2025-03-03 20:30:53,463 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:30:53,463 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:30:53,463 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:30:53,463 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:30:53,464 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:53" (1/1) ... [2025-03-03 20:30:53,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:30:53,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:30:53,501 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 20:30:53,507 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 20:30:53,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:30:53,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 20:30:53,523 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:30:53,523 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:30:53,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:30:53,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:30:53,595 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:30:53,597 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:31:03,921 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 20:31:03,922 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:31:03,928 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:31:03,929 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:31:03,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:31:03 BoogieIcfgContainer [2025-03-03 20:31:03,929 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:31:03,931 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:31:03,931 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:31:03,934 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:31:03,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:30:53" (1/3) ... [2025-03-03 20:31:03,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb51ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:31:03, skipping insertion in model container [2025-03-03 20:31:03,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:30:53" (2/3) ... [2025-03-03 20:31:03,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb51ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:31:03, skipping insertion in model container [2025-03-03 20:31:03,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:31:03" (3/3) ... [2025-03-03 20:31:03,936 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-50.i [2025-03-03 20:31:03,945 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:31:03,947 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-50.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:31:03,982 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:31:03,989 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;@8aace2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:31:03,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:31:03,992 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 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 20:31:04,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 20:31:04,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:31:04,001 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 20:31:04,001 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:31:04,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:31:04,005 INFO L85 PathProgramCache]: Analyzing trace with hash 104262908, now seen corresponding path program 1 times [2025-03-03 20:31:04,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:31:04,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234317953] [2025-03-03 20:31:04,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:31:04,013 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 20:31:04,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:31:04,015 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 20:31:04,016 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 20:31:04,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 20:31:04,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 20:31:04,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:31:04,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:31:04,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 20:31:04,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:31:04,798 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 20:31:04,799 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:31:04,799 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:31:04,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234317953] [2025-03-03 20:31:04,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234317953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:31:04,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:31:04,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:31:04,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424449593] [2025-03-03 20:31:04,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:31:04,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:31:04,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:31:04,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:31:04,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:31:04,817 INFO L87 Difference]: Start difference. First operand has 79 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 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 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 20:31:05,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:31:05,169 INFO L93 Difference]: Finished difference Result 201 states and 360 transitions. [2025-03-03 20:31:05,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:31:05,171 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 20:31:05,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:31:05,176 INFO L225 Difference]: With dead ends: 201 [2025-03-03 20:31:05,176 INFO L226 Difference]: Without dead ends: 125 [2025-03-03 20:31:05,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:31:05,181 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 106 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:31:05,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 441 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:31:05,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-03 20:31:05,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 76. [2025-03-03 20:31:05,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 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 20:31:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 113 transitions. [2025-03-03 20:31:05,219 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 113 transitions. Word has length 161 [2025-03-03 20:31:05,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:31:05,220 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 113 transitions. [2025-03-03 20:31:05,220 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 20:31:05,220 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 113 transitions. [2025-03-03 20:31:05,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 20:31:05,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:31:05,222 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 20:31:05,240 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 20:31:05,423 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 20:31:05,424 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:31:05,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:31:05,425 INFO L85 PathProgramCache]: Analyzing trace with hash -401295717, now seen corresponding path program 1 times [2025-03-03 20:31:05,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:31:05,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488438566] [2025-03-03 20:31:05,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:31:05,425 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 20:31:05,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:31:05,427 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 20:31:05,429 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 20:31:05,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 20:31:06,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 20:31:06,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:31:06,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:31:06,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 20:31:06,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:31:07,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 23 proven. 69 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 20:31:07,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:31:08,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-03 20:31:08,626 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:31:08,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488438566] [2025-03-03 20:31:08,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [488438566] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:31:08,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 20:31:08,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-03 20:31:08,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897273902] [2025-03-03 20:31:08,628 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 20:31:08,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:31:08,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:31:08,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:31:08,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:31:08,629 INFO L87 Difference]: Start difference. First operand 76 states and 113 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-03 20:31:09,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:31:09,704 INFO L93 Difference]: Finished difference Result 157 states and 230 transitions. [2025-03-03 20:31:09,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 20:31:09,705 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 161 [2025-03-03 20:31:09,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:31:09,708 INFO L225 Difference]: With dead ends: 157 [2025-03-03 20:31:09,708 INFO L226 Difference]: Without dead ends: 84 [2025-03-03 20:31:09,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 314 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:31:09,709 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 63 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:31:09,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 200 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 20:31:09,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-03 20:31:09,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2025-03-03 20:31:09,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 53 states have internal predecessors, (67), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 20:31:09,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2025-03-03 20:31:09,724 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 161 [2025-03-03 20:31:09,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:31:09,725 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2025-03-03 20:31:09,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-03 20:31:09,725 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2025-03-03 20:31:09,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 20:31:09,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:31:09,726 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 20:31:09,747 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 20:31:09,927 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 20:31:09,927 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:31:09,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:31:09,928 INFO L85 PathProgramCache]: Analyzing trace with hash -597809222, now seen corresponding path program 1 times [2025-03-03 20:31:09,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:31:09,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013301420] [2025-03-03 20:31:09,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:31:09,928 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 20:31:09,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:31:09,930 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 20:31:09,931 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 20:31:09,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 20:31:10,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 20:31:10,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:31:10,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:31:10,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 20:31:10,487 INFO L279 TraceCheckSpWp]: Computing forward predicates...