./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-86.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_floatingpointinfluence_no-floats_file-86.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 372bad28063f40745a1d198085d9dba9c573515785fed9177a01325fc4e12ae1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:40:20,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:40:20,763 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:40:20,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:40:20,770 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:40:20,787 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:40:20,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:40:20,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:40:20,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:40:20,789 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:40:20,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:40:20,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:40:20,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:40:20,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:40:20,791 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:40:20,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:40:20,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:40:20,791 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:40:20,791 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:40:20,791 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:40:20,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:40:20,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:40:20,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:40:20,791 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:40:20,792 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:40:20,792 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:40:20,792 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:40:20,792 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:40:20,792 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:40:20,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:40:20,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:40:20,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:40:20,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:40:20,793 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:40:20,793 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:40:20,793 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:40:20,793 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:40:20,793 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:40:20,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:40:20,793 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:40:20,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:40:20,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:40:20,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:40:20,793 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 -> 372bad28063f40745a1d198085d9dba9c573515785fed9177a01325fc4e12ae1 [2025-03-03 22:40:21,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:40:21,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:40:21,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:40:21,037 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:40:21,037 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:40:21,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-86.i [2025-03-03 22:40:22,152 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04846a6ee/0f437fe0658449808ab2bf1b5392eb62/FLAGced7f6cb7 [2025-03-03 22:40:22,384 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:40:22,385 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-86.i [2025-03-03 22:40:22,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04846a6ee/0f437fe0658449808ab2bf1b5392eb62/FLAGced7f6cb7 [2025-03-03 22:40:22,721 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04846a6ee/0f437fe0658449808ab2bf1b5392eb62 [2025-03-03 22:40:22,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:40:22,724 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:40:22,726 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:40:22,726 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:40:22,730 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:40:22,731 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:40:22" (1/1) ... [2025-03-03 22:40:22,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b69775d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:22, skipping insertion in model container [2025-03-03 22:40:22,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:40:22" (1/1) ... [2025-03-03 22:40:22,744 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:40:22,847 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_floatingpointinfluence_no-floats_file-86.i[916,929] [2025-03-03 22:40:22,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:40:22,892 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:40:22,902 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_floatingpointinfluence_no-floats_file-86.i[916,929] [2025-03-03 22:40:22,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:40:22,951 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:40:22,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:22 WrapperNode [2025-03-03 22:40:22,953 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:40:22,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:40:22,953 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:40:22,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:40:22,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:22" (1/1) ... [2025-03-03 22:40:22,970 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:22" (1/1) ... [2025-03-03 22:40:22,998 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2025-03-03 22:40:22,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:40:22,999 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:40:22,999 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:40:23,000 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:40:23,005 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:22" (1/1) ... [2025-03-03 22:40:23,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:22" (1/1) ... [2025-03-03 22:40:23,010 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:22" (1/1) ... [2025-03-03 22:40:23,039 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:40:23,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:22" (1/1) ... [2025-03-03 22:40:23,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:22" (1/1) ... [2025-03-03 22:40:23,048 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:22" (1/1) ... [2025-03-03 22:40:23,051 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:22" (1/1) ... [2025-03-03 22:40:23,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:22" (1/1) ... [2025-03-03 22:40:23,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:22" (1/1) ... [2025-03-03 22:40:23,059 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:40:23,060 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:40:23,061 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:40:23,061 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:40:23,062 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:22" (1/1) ... [2025-03-03 22:40:23,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:40:23,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:40:23,094 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:40:23,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:40:23,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:40:23,112 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:40:23,112 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:40:23,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:40:23,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:40:23,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:40:23,165 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:40:23,166 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:40:23,394 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: havoc property_#t~ite20#1;havoc property_#t~bitwise19#1;havoc property_#t~short21#1; [2025-03-03 22:40:23,420 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-03 22:40:23,420 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:40:23,432 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:40:23,433 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:40:23,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:40:23 BoogieIcfgContainer [2025-03-03 22:40:23,434 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:40:23,436 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:40:23,436 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:40:23,439 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:40:23,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:40:22" (1/3) ... [2025-03-03 22:40:23,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332f47f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:40:23, skipping insertion in model container [2025-03-03 22:40:23,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:22" (2/3) ... [2025-03-03 22:40:23,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332f47f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:40:23, skipping insertion in model container [2025-03-03 22:40:23,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:40:23" (3/3) ... [2025-03-03 22:40:23,441 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-86.i [2025-03-03 22:40:23,452 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:40:23,453 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-86.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:40:23,488 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:40:23,498 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;@2d83362d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:40:23,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:40:23,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 45 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 22:40:23,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 22:40:23,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:40:23,512 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:40:23,513 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:40:23,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:40:23,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1840814727, now seen corresponding path program 1 times [2025-03-03 22:40:23,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:40:23,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645643307] [2025-03-03 22:40:23,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:40:23,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:40:23,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:40:23,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:40:23,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:40:23,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:40:23,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-03 22:40:23,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:40:23,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645643307] [2025-03-03 22:40:23,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645643307] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:40:23,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537081635] [2025-03-03 22:40:23,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:40:23,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:40:23,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:40:23,747 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:40:23,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 22:40:23,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:40:23,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:40:23,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:40:23,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:40:23,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:40:23,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:40:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-03 22:40:23,918 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:40:23,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537081635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:40:23,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:40:23,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:40:23,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494455260] [2025-03-03 22:40:23,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:40:23,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:40:23,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:40:23,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:40:23,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:40:23,941 INFO L87 Difference]: Start difference. First operand has 75 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 45 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 22:40:23,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:40:23,970 INFO L93 Difference]: Finished difference Result 144 states and 247 transitions. [2025-03-03 22:40:23,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:40:23,972 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 170 [2025-03-03 22:40:23,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:40:23,975 INFO L225 Difference]: With dead ends: 144 [2025-03-03 22:40:23,975 INFO L226 Difference]: Without dead ends: 72 [2025-03-03 22:40:23,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:40:23,979 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:40:23,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:40:23,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-03 22:40:24,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-03 22:40:24,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 22:40:24,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 107 transitions. [2025-03-03 22:40:24,007 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 107 transitions. Word has length 170 [2025-03-03 22:40:24,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:40:24,007 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 107 transitions. [2025-03-03 22:40:24,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 22:40:24,008 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 107 transitions. [2025-03-03 22:40:24,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 22:40:24,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:40:24,010 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:40:24,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 22:40:24,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 22:40:24,211 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:40:24,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:40:24,211 INFO L85 PathProgramCache]: Analyzing trace with hash 26339705, now seen corresponding path program 1 times [2025-03-03 22:40:24,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:40:24,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523571090] [2025-03-03 22:40:24,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:40:24,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:40:24,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:40:24,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:40:24,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:40:24,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:40:24,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 22:40:24,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:40:24,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523571090] [2025-03-03 22:40:24,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523571090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:40:24,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:40:24,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:40:24,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615724958] [2025-03-03 22:40:24,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:40:24,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:40:24,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:40:24,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:40:24,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:40:24,393 INFO L87 Difference]: Start difference. First operand 72 states and 107 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 22:40:24,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:40:24,448 INFO L93 Difference]: Finished difference Result 163 states and 240 transitions. [2025-03-03 22:40:24,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:40:24,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 170 [2025-03-03 22:40:24,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:40:24,452 INFO L225 Difference]: With dead ends: 163 [2025-03-03 22:40:24,452 INFO L226 Difference]: Without dead ends: 94 [2025-03-03 22:40:24,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:40:24,453 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 25 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:40:24,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 209 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:40:24,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-03 22:40:24,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2025-03-03 22:40:24,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 22:40:24,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 121 transitions. [2025-03-03 22:40:24,466 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 121 transitions. Word has length 170 [2025-03-03 22:40:24,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:40:24,468 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 121 transitions. [2025-03-03 22:40:24,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 22:40:24,469 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 121 transitions. [2025-03-03 22:40:24,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 22:40:24,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:40:24,471 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:40:24,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:40:24,471 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:40:24,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:40:24,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1770611654, now seen corresponding path program 1 times [2025-03-03 22:40:24,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:40:24,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595837325] [2025-03-03 22:40:24,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:40:24,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:40:24,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:40:24,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:40:24,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:40:24,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:40:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 22:40:25,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:40:25,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595837325] [2025-03-03 22:40:25,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595837325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:40:25,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:40:25,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 22:40:25,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918056871] [2025-03-03 22:40:25,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:40:25,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 22:40:25,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:40:25,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 22:40:25,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:40:25,061 INFO L87 Difference]: Start difference. First operand 82 states and 121 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 22:40:25,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:40:25,200 INFO L93 Difference]: Finished difference Result 193 states and 278 transitions. [2025-03-03 22:40:25,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:40:25,201 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 170 [2025-03-03 22:40:25,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:40:25,202 INFO L225 Difference]: With dead ends: 193 [2025-03-03 22:40:25,202 INFO L226 Difference]: Without dead ends: 114 [2025-03-03 22:40:25,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:40:25,203 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 48 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:40:25,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 644 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:40:25,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-03 22:40:25,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 89. [2025-03-03 22:40:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 59 states have (on average 1.271186440677966) internal successors, (75), 59 states have internal predecessors, (75), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 22:40:25,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 131 transitions. [2025-03-03 22:40:25,212 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 131 transitions. Word has length 170 [2025-03-03 22:40:25,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:40:25,213 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 131 transitions. [2025-03-03 22:40:25,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 22:40:25,213 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 131 transitions. [2025-03-03 22:40:25,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 22:40:25,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:40:25,215 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:40:25,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:40:25,215 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:40:25,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:40:25,215 INFO L85 PathProgramCache]: Analyzing trace with hash 716901179, now seen corresponding path program 1 times [2025-03-03 22:40:25,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:40:25,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450757382] [2025-03-03 22:40:25,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:40:25,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:40:25,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:40:25,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:40:25,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:40:25,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:40:25,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 22:40:25,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:40:25,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450757382] [2025-03-03 22:40:25,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450757382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:40:25,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:40:25,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 22:40:25,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490697570] [2025-03-03 22:40:25,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:40:25,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 22:40:25,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:40:25,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 22:40:25,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:40:25,604 INFO L87 Difference]: Start difference. First operand 89 states and 131 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 22:40:25,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:40:25,751 INFO L93 Difference]: Finished difference Result 200 states and 287 transitions. [2025-03-03 22:40:25,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:40:25,752 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 170 [2025-03-03 22:40:25,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:40:25,753 INFO L225 Difference]: With dead ends: 200 [2025-03-03 22:40:25,755 INFO L226 Difference]: Without dead ends: 114 [2025-03-03 22:40:25,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:40:25,756 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 47 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:40:25,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 806 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:40:25,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-03 22:40:25,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 82. [2025-03-03 22:40:25,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 52 states have internal predecessors, (64), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 22:40:25,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 120 transitions. [2025-03-03 22:40:25,770 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 120 transitions. Word has length 170 [2025-03-03 22:40:25,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:40:25,771 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 120 transitions. [2025-03-03 22:40:25,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 22:40:25,772 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 120 transitions. [2025-03-03 22:40:25,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 22:40:25,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:40:25,775 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:40:25,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 22:40:25,775 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:40:25,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:40:25,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1146269662, now seen corresponding path program 1 times [2025-03-03 22:40:25,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:40:25,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467224669] [2025-03-03 22:40:25,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:40:25,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:40:25,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 22:40:25,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 22:40:25,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:40:25,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:40:26,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 22:40:26,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:40:26,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467224669] [2025-03-03 22:40:26,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467224669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:40:26,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:40:26,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 22:40:26,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121692883] [2025-03-03 22:40:26,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:40:26,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 22:40:26,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:40:26,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 22:40:26,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:40:26,837 INFO L87 Difference]: Start difference. First operand 82 states and 120 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 22:40:27,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:40:27,144 INFO L93 Difference]: Finished difference Result 193 states and 274 transitions. [2025-03-03 22:40:27,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:40:27,146 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 172 [2025-03-03 22:40:27,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:40:27,147 INFO L225 Difference]: With dead ends: 193 [2025-03-03 22:40:27,147 INFO L226 Difference]: Without dead ends: 114 [2025-03-03 22:40:27,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:40:27,148 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 42 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:40:27,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 664 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:40:27,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-03 22:40:27,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 89. [2025-03-03 22:40:27,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 59 states have internal predecessors, (73), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 22:40:27,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2025-03-03 22:40:27,159 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 129 transitions. Word has length 172 [2025-03-03 22:40:27,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:40:27,159 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 129 transitions. [2025-03-03 22:40:27,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 22:40:27,161 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 129 transitions. [2025-03-03 22:40:27,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 22:40:27,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:40:27,162 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:40:27,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 22:40:27,162 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:40:27,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:40:27,162 INFO L85 PathProgramCache]: Analyzing trace with hash -650681697, now seen corresponding path program 1 times [2025-03-03 22:40:27,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:40:27,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660484292] [2025-03-03 22:40:27,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:40:27,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:40:27,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 22:40:27,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 22:40:27,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:40:27,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:40:27,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 22:40:27,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:40:27,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660484292] [2025-03-03 22:40:27,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660484292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:40:27,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:40:27,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 22:40:27,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615752686] [2025-03-03 22:40:27,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:40:27,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:40:27,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:40:27,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:40:27,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:40:27,950 INFO L87 Difference]: Start difference. First operand 89 states and 129 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 22:40:28,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:40:28,188 INFO L93 Difference]: Finished difference Result 200 states and 282 transitions. [2025-03-03 22:40:28,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:40:28,189 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 172 [2025-03-03 22:40:28,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:40:28,190 INFO L225 Difference]: With dead ends: 200 [2025-03-03 22:40:28,190 INFO L226 Difference]: Without dead ends: 114 [2025-03-03 22:40:28,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:40:28,191 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 41 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:40:28,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 613 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:40:28,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-03 22:40:28,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 82. [2025-03-03 22:40:28,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 22:40:28,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 119 transitions. [2025-03-03 22:40:28,202 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 119 transitions. Word has length 172 [2025-03-03 22:40:28,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:40:28,203 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 119 transitions. [2025-03-03 22:40:28,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 22:40:28,203 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 119 transitions. [2025-03-03 22:40:28,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 22:40:28,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:40:28,204 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:40:28,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 22:40:28,205 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:40:28,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:40:28,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1577149512, now seen corresponding path program 1 times [2025-03-03 22:40:28,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:40:28,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120352104] [2025-03-03 22:40:28,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:40:28,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:40:28,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 22:40:28,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 22:40:28,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:40:28,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:40:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 22:40:30,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:40:30,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120352104] [2025-03-03 22:40:30,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120352104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:40:30,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:40:30,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 22:40:30,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069199169] [2025-03-03 22:40:30,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:40:30,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 22:40:30,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:40:30,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 22:40:30,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:40:30,169 INFO L87 Difference]: Start difference. First operand 82 states and 119 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 22:40:30,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:40:30,981 INFO L93 Difference]: Finished difference Result 179 states and 260 transitions. [2025-03-03 22:40:30,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 22:40:30,982 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 172 [2025-03-03 22:40:30,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:40:30,983 INFO L225 Difference]: With dead ends: 179 [2025-03-03 22:40:30,983 INFO L226 Difference]: Without dead ends: 177 [2025-03-03 22:40:30,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 22:40:30,984 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 157 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 22:40:30,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 782 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 22:40:30,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-03 22:40:31,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2025-03-03 22:40:31,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 99 states have internal predecessors, (111), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 22:40:31,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 255 transitions. [2025-03-03 22:40:31,008 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 255 transitions. Word has length 172 [2025-03-03 22:40:31,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:40:31,008 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 255 transitions. [2025-03-03 22:40:31,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 22:40:31,008 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 255 transitions. [2025-03-03 22:40:31,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 22:40:31,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:40:31,009 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:40:31,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 22:40:31,009 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:40:31,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:40:31,010 INFO L85 PathProgramCache]: Analyzing trace with hash 806979219, now seen corresponding path program 1 times [2025-03-03 22:40:31,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:40:31,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297018676] [2025-03-03 22:40:31,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:40:31,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:40:31,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 22:40:31,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 22:40:31,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:40:31,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:40:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 22:40:31,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:40:31,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297018676] [2025-03-03 22:40:31,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297018676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:40:31,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:40:31,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:40:31,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493293839] [2025-03-03 22:40:31,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:40:31,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:40:31,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:40:31,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:40:31,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:40:31,074 INFO L87 Difference]: Start difference. First operand 173 states and 255 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 22:40:31,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:40:31,113 INFO L93 Difference]: Finished difference Result 317 states and 454 transitions. [2025-03-03 22:40:31,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:40:31,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 174 [2025-03-03 22:40:31,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:40:31,116 INFO L225 Difference]: With dead ends: 317 [2025-03-03 22:40:31,116 INFO L226 Difference]: Without dead ends: 187 [2025-03-03 22:40:31,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:40:31,117 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 41 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:40:31,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 228 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:40:31,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-03 22:40:31,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 166. [2025-03-03 22:40:31,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 90 states have (on average 1.1222222222222222) internal successors, (101), 92 states have internal predecessors, (101), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 22:40:31,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 245 transitions. [2025-03-03 22:40:31,147 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 245 transitions. Word has length 174 [2025-03-03 22:40:31,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:40:31,148 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 245 transitions. [2025-03-03 22:40:31,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 22:40:31,148 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 245 transitions. [2025-03-03 22:40:31,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 22:40:31,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:40:31,149 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:40:31,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 22:40:31,149 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:40:31,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:40:31,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1560297315, now seen corresponding path program 1 times [2025-03-03 22:40:31,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:40:31,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22351326] [2025-03-03 22:40:31,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:40:31,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:40:31,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 22:40:31,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 22:40:31,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:40:31,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:40:31,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 22:40:31,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:40:31,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22351326] [2025-03-03 22:40:31,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22351326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:40:31,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:40:31,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:40:31,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661690371] [2025-03-03 22:40:31,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:40:31,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:40:31,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:40:31,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:40:31,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:40:31,207 INFO L87 Difference]: Start difference. First operand 166 states and 245 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 22:40:31,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:40:31,264 INFO L93 Difference]: Finished difference Result 329 states and 477 transitions. [2025-03-03 22:40:31,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:40:31,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 174 [2025-03-03 22:40:31,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:40:31,268 INFO L225 Difference]: With dead ends: 329 [2025-03-03 22:40:31,268 INFO L226 Difference]: Without dead ends: 206 [2025-03-03 22:40:31,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:40:31,269 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 83 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:40:31,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 405 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:40:31,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-03 22:40:31,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2025-03-03 22:40:31,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 110 states have (on average 1.1090909090909091) internal successors, (122), 113 states have internal predecessors, (122), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 22:40:31,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 298 transitions. [2025-03-03 22:40:31,301 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 298 transitions. Word has length 174 [2025-03-03 22:40:31,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:40:31,304 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 298 transitions. [2025-03-03 22:40:31,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 22:40:31,304 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 298 transitions. [2025-03-03 22:40:31,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 22:40:31,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:40:31,305 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:40:31,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 22:40:31,306 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:40:31,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:40:31,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1531238345, now seen corresponding path program 1 times [2025-03-03 22:40:31,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:40:31,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223132194] [2025-03-03 22:40:31,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:40:31,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:40:31,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 22:40:31,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 22:40:31,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:40:31,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:40:32,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 22:40:32,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:40:32,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223132194] [2025-03-03 22:40:32,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223132194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:40:32,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:40:32,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 22:40:32,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498752501] [2025-03-03 22:40:32,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:40:32,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:40:32,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:40:32,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:40:32,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:40:32,367 INFO L87 Difference]: Start difference. First operand 203 states and 298 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 22:40:32,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:40:32,990 INFO L93 Difference]: Finished difference Result 248 states and 350 transitions. [2025-03-03 22:40:32,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 22:40:32,991 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2025-03-03 22:40:32,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:40:32,993 INFO L225 Difference]: With dead ends: 248 [2025-03-03 22:40:32,993 INFO L226 Difference]: Without dead ends: 246 [2025-03-03 22:40:32,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-03 22:40:32,993 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 108 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 22:40:32,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1137 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 22:40:32,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-03 22:40:33,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 243. [2025-03-03 22:40:33,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 144 states have (on average 1.1111111111111112) internal successors, (160), 149 states have internal predecessors, (160), 92 states have call successors, (92), 6 states have call predecessors, (92), 6 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-03 22:40:33,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 344 transitions. [2025-03-03 22:40:33,023 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 344 transitions. Word has length 176 [2025-03-03 22:40:33,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:40:33,024 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 344 transitions. [2025-03-03 22:40:33,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 22:40:33,024 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 344 transitions. [2025-03-03 22:40:33,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 22:40:33,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:40:33,025 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:40:33,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 22:40:33,026 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:40:33,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:40:33,026 INFO L85 PathProgramCache]: Analyzing trace with hash 966777592, now seen corresponding path program 1 times [2025-03-03 22:40:33,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:40:33,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375609538] [2025-03-03 22:40:33,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:40:33,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:40:33,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 22:40:33,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 22:40:33,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:40:33,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:40:33,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 22:40:33,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:40:33,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375609538] [2025-03-03 22:40:33,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375609538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:40:33,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:40:33,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 22:40:33,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554606924] [2025-03-03 22:40:33,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:40:33,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:40:33,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:40:33,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:40:33,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:40:33,599 INFO L87 Difference]: Start difference. First operand 243 states and 344 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 22:40:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:40:34,075 INFO L93 Difference]: Finished difference Result 298 states and 405 transitions. [2025-03-03 22:40:34,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 22:40:34,076 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2025-03-03 22:40:34,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:40:34,078 INFO L225 Difference]: With dead ends: 298 [2025-03-03 22:40:34,078 INFO L226 Difference]: Without dead ends: 296 [2025-03-03 22:40:34,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-03 22:40:34,079 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 117 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:40:34,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 847 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 22:40:34,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-03 22:40:34,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 263. [2025-03-03 22:40:34,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 164 states have (on average 1.1219512195121952) internal successors, (184), 169 states have internal predecessors, (184), 92 states have call successors, (92), 6 states have call predecessors, (92), 6 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-03 22:40:34,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 368 transitions. [2025-03-03 22:40:34,124 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 368 transitions. Word has length 176 [2025-03-03 22:40:34,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:40:34,124 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 368 transitions. [2025-03-03 22:40:34,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 22:40:34,124 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 368 transitions. [2025-03-03 22:40:34,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-03 22:40:34,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:40:34,128 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:40:34,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 22:40:34,129 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:40:34,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:40:34,129 INFO L85 PathProgramCache]: Analyzing trace with hash 2083440044, now seen corresponding path program 1 times [2025-03-03 22:40:34,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:40:34,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342666242] [2025-03-03 22:40:34,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:40:34,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:40:34,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-03 22:40:34,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-03 22:40:34,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:40:34,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:40:34,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 22:40:34,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:40:34,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342666242] [2025-03-03 22:40:34,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342666242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:40:34,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:40:34,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:40:34,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479844534] [2025-03-03 22:40:34,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:40:34,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:40:34,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:40:34,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:40:34,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:40:34,185 INFO L87 Difference]: Start difference. First operand 263 states and 368 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 22:40:34,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:40:34,229 INFO L93 Difference]: Finished difference Result 571 states and 798 transitions. [2025-03-03 22:40:34,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:40:34,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2025-03-03 22:40:34,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:40:34,232 INFO L225 Difference]: With dead ends: 571 [2025-03-03 22:40:34,232 INFO L226 Difference]: Without dead ends: 351 [2025-03-03 22:40:34,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:40:34,233 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 90 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:40:34,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 287 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:40:34,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-03 22:40:34,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 333. [2025-03-03 22:40:34,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 187 states have (on average 1.085561497326203) internal successors, (203), 194 states have internal predecessors, (203), 136 states have call successors, (136), 9 states have call predecessors, (136), 9 states have return successors, (136), 129 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-03 22:40:34,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 475 transitions. [2025-03-03 22:40:34,273 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 475 transitions. Word has length 177 [2025-03-03 22:40:34,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:40:34,274 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 475 transitions. [2025-03-03 22:40:34,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 22:40:34,274 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 475 transitions. [2025-03-03 22:40:34,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-03 22:40:34,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:40:34,275 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:40:34,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 22:40:34,275 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:40:34,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:40:34,276 INFO L85 PathProgramCache]: Analyzing trace with hash -542183660, now seen corresponding path program 1 times [2025-03-03 22:40:34,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:40:34,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869945409] [2025-03-03 22:40:34,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:40:34,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:40:34,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-03 22:40:34,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-03 22:40:34,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:40:34,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:40:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 22:40:34,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:40:34,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869945409] [2025-03-03 22:40:34,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869945409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:40:34,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:40:34,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:40:34,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374415999] [2025-03-03 22:40:34,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:40:34,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:40:34,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:40:34,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:40:34,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:40:34,318 INFO L87 Difference]: Start difference. First operand 333 states and 475 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 22:40:34,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:40:34,360 INFO L93 Difference]: Finished difference Result 634 states and 897 transitions. [2025-03-03 22:40:34,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:40:34,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2025-03-03 22:40:34,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:40:34,363 INFO L225 Difference]: With dead ends: 634 [2025-03-03 22:40:34,364 INFO L226 Difference]: Without dead ends: 344 [2025-03-03 22:40:34,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:40:34,365 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 93 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:40:34,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 206 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:40:34,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-03-03 22:40:34,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 329. [2025-03-03 22:40:34,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 178 states have (on average 1.0674157303370786) internal successors, (190), 183 states have internal predecessors, (190), 140 states have call successors, (140), 10 states have call predecessors, (140), 10 states have return successors, (140), 135 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-03 22:40:34,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 470 transitions. [2025-03-03 22:40:34,414 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 470 transitions. Word has length 177 [2025-03-03 22:40:34,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:40:34,415 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 470 transitions. [2025-03-03 22:40:34,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 22:40:34,415 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 470 transitions. [2025-03-03 22:40:34,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 22:40:34,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:40:34,416 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:40:34,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 22:40:34,416 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:40:34,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:40:34,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1744685808, now seen corresponding path program 1 times [2025-03-03 22:40:34,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:40:34,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360875424] [2025-03-03 22:40:34,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:40:34,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:40:34,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 22:40:34,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 22:40:34,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:40:34,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:40:34,452 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:40:34,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 22:40:34,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 22:40:34,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:40:34,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:40:34,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:40:34,530 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:40:34,532 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:40:34,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 22:40:34,535 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:40:34,625 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:40:34,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:40:34 BoogieIcfgContainer [2025-03-03 22:40:34,630 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:40:34,631 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:40:34,631 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:40:34,631 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:40:34,631 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:40:23" (3/4) ... [2025-03-03 22:40:34,633 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:40:34,633 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:40:34,634 INFO L158 Benchmark]: Toolchain (without parser) took 11910.42ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 125.2MB in the beginning and 294.5MB in the end (delta: -169.3MB). Peak memory consumption was 232.3MB. Max. memory is 16.1GB. [2025-03-03 22:40:34,635 INFO L158 Benchmark]: CDTParser took 0.58ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:40:34,635 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.21ms. Allocated memory is still 167.8MB. Free memory was 124.6MB in the beginning and 110.5MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:40:34,635 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.55ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 106.1MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:40:34,635 INFO L158 Benchmark]: Boogie Preprocessor took 60.36ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 98.7MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:40:34,635 INFO L158 Benchmark]: IcfgBuilder took 373.67ms. Allocated memory is still 167.8MB. Free memory was 98.7MB in the beginning and 74.4MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 22:40:34,636 INFO L158 Benchmark]: TraceAbstraction took 11194.52ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 73.8MB in the beginning and 294.6MB in the end (delta: -220.8MB). Peak memory consumption was 182.0MB. Max. memory is 16.1GB. [2025-03-03 22:40:34,636 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 570.4MB. Free memory was 294.6MB in the beginning and 294.5MB in the end (delta: 117.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:40:34,637 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.58ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.21ms. Allocated memory is still 167.8MB. Free memory was 124.6MB in the beginning and 110.5MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.55ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 106.1MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.36ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 98.7MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 373.67ms. Allocated memory is still 167.8MB. Free memory was 98.7MB in the beginning and 74.4MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11194.52ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 73.8MB in the beginning and 294.6MB in the end (delta: -220.8MB). Peak memory consumption was 182.0MB. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 570.4MB. Free memory was 294.6MB in the beginning and 294.5MB in the end (delta: 117.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 110, overapproximation of shiftLeft at line 56. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] signed short int var_1_3 = 2; [L25] signed short int var_1_4 = 256; [L26] signed short int var_1_5 = -256; [L27] signed short int var_1_6 = 2; [L28] signed long int var_1_7 = 255; [L29] signed long int var_1_8 = 127; [L30] signed long int var_1_9 = 128; [L31] signed long int var_1_10 = 499; [L32] unsigned short int var_1_11 = 10; [L33] unsigned char var_1_12 = 1; [L34] unsigned short int var_1_13 = 8; [L35] unsigned short int var_1_14 = 256; [L36] unsigned short int var_1_15 = 1; [L37] unsigned short int var_1_16 = 16; [L38] unsigned short int var_1_17 = 57705; [L39] unsigned long int var_1_18 = 64; VAL [isInitial=0, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L114] isInitial = 1 [L115] FCALL initially() [L116] COND TRUE 1 [L117] FCALL updateLastVariables() [L118] CALL updateVariables() [L64] var_1_2 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L65] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L66] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L66] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L67] var_1_3 = __VERIFIER_nondet_short() [L68] CALL assume_abort_if_not(var_1_3 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L68] RET assume_abort_if_not(var_1_3 >= -16383) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L69] CALL assume_abort_if_not(var_1_3 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L69] RET assume_abort_if_not(var_1_3 <= 16383) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L70] var_1_4 = __VERIFIER_nondet_short() [L71] CALL assume_abort_if_not(var_1_4 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L71] RET assume_abort_if_not(var_1_4 >= -8191) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L72] CALL assume_abort_if_not(var_1_4 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L72] RET assume_abort_if_not(var_1_4 <= 8192) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L73] var_1_5 = __VERIFIER_nondet_short() [L74] CALL assume_abort_if_not(var_1_5 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L74] RET assume_abort_if_not(var_1_5 >= -8191) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L75] CALL assume_abort_if_not(var_1_5 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L75] RET assume_abort_if_not(var_1_5 <= 8191) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L76] var_1_6 = __VERIFIER_nondet_short() [L77] CALL assume_abort_if_not(var_1_6 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=127, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=127, var_1_9=128] [L77] RET assume_abort_if_not(var_1_6 >= -32767) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=127, var_1_9=128] [L78] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=127, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=127, var_1_9=128] [L78] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=127, var_1_9=128] [L79] var_1_8 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=128] [L80] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=128] [L81] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=128] [L81] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=128] [L82] var_1_9 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L83] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L84] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L85] var_1_10 = __VERIFIER_nondet_long() [L86] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L86] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L87] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L88] var_1_12 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L89] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L90] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L91] var_1_13 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L92] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L93] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L94] var_1_14 = __VERIFIER_nondet_ushort() [L95] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L95] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L96] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L96] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L97] var_1_15 = __VERIFIER_nondet_ushort() [L98] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L98] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L99] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L99] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L100] var_1_16 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L101] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L102] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_16=32767, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_16=32767, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L102] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_16=32767, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L103] var_1_17 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_16=32767, var_1_17=-229377, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_16=32767, var_1_17=-229377, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L104] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_16=32767, var_1_17=-229377, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L105] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_16=32767, var_1_17=-229377, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_16=32767, var_1_17=-229377, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L105] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_16=32767, var_1_17=-229377, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L118] RET updateVariables() [L119] CALL step() [L43] COND TRUE ! var_1_2 [L44] var_1_1 = (((((var_1_3 + (var_1_4 + var_1_5))) < (var_1_6)) ? ((var_1_3 + (var_1_4 + var_1_5))) : (var_1_6))) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_16=32767, var_1_17=-229377, var_1_18=64, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L48] signed short int stepLocal_0 = var_1_5; VAL [isInitial=1, stepLocal_0=5, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_16=32767, var_1_17=-229377, var_1_18=64, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L49] COND TRUE stepLocal_0 > 2 [L50] var_1_7 = ((var_1_8 + var_1_9) - var_1_10) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_16=32767, var_1_17=-229377, var_1_18=64, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=0, var_1_8=0, var_1_9=0] [L52] var_1_18 = var_1_17 VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_16=32767, var_1_17=-229377, var_1_18=32767, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=0, var_1_8=0, var_1_9=0] [L53] COND FALSE !(var_1_2 && var_1_12) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_16=32767, var_1_17=-229377, var_1_18=32767, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=0, var_1_8=0, var_1_9=0] [L56] EXPR -25 << var_1_18 VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_16=32767, var_1_17=-229377, var_1_18=32767, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=0, var_1_8=0, var_1_9=0] [L56] COND TRUE var_1_3 < (200 * (-25 << var_1_18)) [L57] var_1_11 = ((((((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) < 0 ) ? -(((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) : (((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))))) VAL [isInitial=1, var_1_10=0, var_1_11=22767, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_16=32767, var_1_17=-229377, var_1_18=32767, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=0, var_1_8=0, var_1_9=0] [L119] RET step() [L120] CALL, EXPR property() [L110] EXPR (((! var_1_2) ? (var_1_1 == ((signed short int) (((((var_1_3 + (var_1_4 + var_1_5))) < (var_1_6)) ? ((var_1_3 + (var_1_4 + var_1_5))) : (var_1_6))))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_5 > 2) ? (var_1_7 == ((signed long int) ((var_1_8 + var_1_9) - var_1_10))) : 1)) && ((var_1_2 && var_1_12) ? (var_1_11 == ((unsigned short int) (var_1_13 + ((((((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) < (var_1_16)) ? (((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) : (var_1_16)))))) : ((var_1_3 < (200 * (-25 << var_1_18))) ? (var_1_11 == ((unsigned short int) ((((((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) < 0 ) ? -(((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) : (((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))))))) : (var_1_11 == ((unsigned short int) (var_1_17 - var_1_15))))) VAL [isInitial=1, var_1_10=0, var_1_11=22767, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_16=32767, var_1_17=-229377, var_1_18=32767, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=0, var_1_8=0, var_1_9=0] [L110] EXPR (var_1_2 && var_1_12) ? (var_1_11 == ((unsigned short int) (var_1_13 + ((((((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) < (var_1_16)) ? (((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) : (var_1_16)))))) : ((var_1_3 < (200 * (-25 << var_1_18))) ? (var_1_11 == ((unsigned short int) ((((((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) < 0 ) ? -(((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) : (((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))))))) : (var_1_11 == ((unsigned short int) (var_1_17 - var_1_15)))) VAL [isInitial=1, var_1_10=0, var_1_11=22767, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_16=32767, var_1_17=-229377, var_1_18=32767, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=0, var_1_8=0, var_1_9=0] [L110] EXPR -25 << var_1_18 VAL [isInitial=1, var_1_10=0, var_1_11=22767, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_16=32767, var_1_17=-229377, var_1_18=32767, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=0, var_1_8=0, var_1_9=0] [L110] EXPR (var_1_2 && var_1_12) ? (var_1_11 == ((unsigned short int) (var_1_13 + ((((((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) < (var_1_16)) ? (((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) : (var_1_16)))))) : ((var_1_3 < (200 * (-25 << var_1_18))) ? (var_1_11 == ((unsigned short int) ((((((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) < 0 ) ? -(((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) : (((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))))))) : (var_1_11 == ((unsigned short int) (var_1_17 - var_1_15)))) VAL [isInitial=1, var_1_10=0, var_1_11=22767, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_16=32767, var_1_17=-229377, var_1_18=32767, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=0, var_1_8=0, var_1_9=0] [L110] EXPR (((! var_1_2) ? (var_1_1 == ((signed short int) (((((var_1_3 + (var_1_4 + var_1_5))) < (var_1_6)) ? ((var_1_3 + (var_1_4 + var_1_5))) : (var_1_6))))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_5 > 2) ? (var_1_7 == ((signed long int) ((var_1_8 + var_1_9) - var_1_10))) : 1)) && ((var_1_2 && var_1_12) ? (var_1_11 == ((unsigned short int) (var_1_13 + ((((((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) < (var_1_16)) ? (((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) : (var_1_16)))))) : ((var_1_3 < (200 * (-25 << var_1_18))) ? (var_1_11 == ((unsigned short int) ((((((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) < 0 ) ? -(((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) : (((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))))))) : (var_1_11 == ((unsigned short int) (var_1_17 - var_1_15))))) VAL [isInitial=1, var_1_10=0, var_1_11=22767, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_16=32767, var_1_17=-229377, var_1_18=32767, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=0, var_1_8=0, var_1_9=0] [L110-L111] return ((((! var_1_2) ? (var_1_1 == ((signed short int) (((((var_1_3 + (var_1_4 + var_1_5))) < (var_1_6)) ? ((var_1_3 + (var_1_4 + var_1_5))) : (var_1_6))))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_5 > 2) ? (var_1_7 == ((signed long int) ((var_1_8 + var_1_9) - var_1_10))) : 1)) && ((var_1_2 && var_1_12) ? (var_1_11 == ((unsigned short int) (var_1_13 + ((((((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) < (var_1_16)) ? (((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) : (var_1_16)))))) : ((var_1_3 < (200 * (-25 << var_1_18))) ? (var_1_11 == ((unsigned short int) ((((((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) < 0 ) ? -(((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) : (((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))))))) : (var_1_11 == ((unsigned short int) (var_1_17 - var_1_15)))))) && (var_1_18 == ((unsigned long int) var_1_17)) ; [L120] RET, EXPR property() [L120] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=22767, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_16=32767, var_1_17=-229377, var_1_18=32767, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=22767, var_1_12=1, var_1_13=32767, var_1_14=1, var_1_15=4, var_1_16=32767, var_1_17=-229377, var_1_18=32767, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4794, var_1_5=5, var_1_6=32766, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 14, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 892 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 892 mSDsluCounter, 6933 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5127 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1981 IncrementalHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 1806 mSDtfsCounter, 1981 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=333occurred in iteration=12, InterpolantAutomatonStates: 72, 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, 13 MinimizatonAttempts, 223 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 2598 NumberOfCodeBlocks, 2598 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2406 ConstructedInterpolants, 0 QuantifiedInterpolants, 6842 SizeOfPredicates, 0 NumberOfNonLiveVariables, 367 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 21114/21168 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 22:40:34,667 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_floatingpointinfluence_no-floats_file-86.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 372bad28063f40745a1d198085d9dba9c573515785fed9177a01325fc4e12ae1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:40:36,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:40:36,556 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:40:36,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:40:36,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:40:36,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:40:36,577 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:40:36,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:40:36,578 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:40:36,578 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:40:36,578 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:40:36,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:40:36,579 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:40:36,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:40:36,579 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:40:36,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:40:36,580 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:40:36,580 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:40:36,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:40:36,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:40:36,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:40:36,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:40:36,581 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:40:36,581 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:40:36,581 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:40:36,581 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:40:36,581 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:40:36,581 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:40:36,581 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:40:36,581 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:40:36,581 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:40:36,582 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:40:36,582 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:40:36,582 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:40:36,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:40:36,582 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:40:36,582 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:40:36,582 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:40:36,582 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:40:36,582 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:40:36,582 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:40:36,583 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:40:36,583 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:40:36,583 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:40:36,583 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:40:36,583 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 -> 372bad28063f40745a1d198085d9dba9c573515785fed9177a01325fc4e12ae1 [2025-03-03 22:40:36,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:40:36,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:40:36,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:40:36,813 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:40:36,813 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:40:36,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-86.i [2025-03-03 22:40:37,985 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdd04f5e9/5d486dd2fde24b6fb90f8f6d73c85ae6/FLAG6f0dd3ae3 [2025-03-03 22:40:38,164 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:40:38,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-86.i [2025-03-03 22:40:38,171 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdd04f5e9/5d486dd2fde24b6fb90f8f6d73c85ae6/FLAG6f0dd3ae3 [2025-03-03 22:40:38,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdd04f5e9/5d486dd2fde24b6fb90f8f6d73c85ae6 [2025-03-03 22:40:38,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:40:38,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:40:38,191 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:40:38,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:40:38,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:40:38,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:40:38" (1/1) ... [2025-03-03 22:40:38,195 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@248e429c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:38, skipping insertion in model container [2025-03-03 22:40:38,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:40:38" (1/1) ... [2025-03-03 22:40:38,210 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:40:38,316 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_floatingpointinfluence_no-floats_file-86.i[916,929] [2025-03-03 22:40:38,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:40:38,384 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:40:38,392 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_floatingpointinfluence_no-floats_file-86.i[916,929] [2025-03-03 22:40:38,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:40:38,444 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:40:38,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:38 WrapperNode [2025-03-03 22:40:38,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:40:38,448 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:40:38,448 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:40:38,448 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:40:38,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:38" (1/1) ... [2025-03-03 22:40:38,464 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:38" (1/1) ... [2025-03-03 22:40:38,492 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2025-03-03 22:40:38,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:40:38,500 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:40:38,500 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:40:38,500 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:40:38,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:38" (1/1) ... [2025-03-03 22:40:38,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:38" (1/1) ... [2025-03-03 22:40:38,511 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:38" (1/1) ... [2025-03-03 22:40:38,531 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:40:38,532 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:38" (1/1) ... [2025-03-03 22:40:38,532 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:38" (1/1) ... [2025-03-03 22:40:38,538 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:38" (1/1) ... [2025-03-03 22:40:38,542 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:38" (1/1) ... [2025-03-03 22:40:38,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:38" (1/1) ... [2025-03-03 22:40:38,548 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:38" (1/1) ... [2025-03-03 22:40:38,551 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:40:38,555 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:40:38,555 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:40:38,556 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:40:38,557 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:38" (1/1) ... [2025-03-03 22:40:38,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:40:38,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:40:38,590 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:40:38,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:40:38,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:40:38,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:40:38,617 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:40:38,617 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:40:38,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:40:38,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:40:38,683 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:40:38,685 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:40:38,921 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 22:40:38,921 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:40:38,929 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:40:38,929 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:40:38,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:40:38 BoogieIcfgContainer [2025-03-03 22:40:38,929 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:40:38,931 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:40:38,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:40:38,936 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:40:38,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:40:38" (1/3) ... [2025-03-03 22:40:38,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25199d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:40:38, skipping insertion in model container [2025-03-03 22:40:38,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:38" (2/3) ... [2025-03-03 22:40:38,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25199d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:40:38, skipping insertion in model container [2025-03-03 22:40:38,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:40:38" (3/3) ... [2025-03-03 22:40:38,938 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-86.i [2025-03-03 22:40:38,952 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:40:38,953 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-86.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:40:38,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:40:39,004 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;@537f5fb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:40:39,004 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:40:39,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 22:40:39,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 22:40:39,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:40:39,017 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:40:39,017 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:40:39,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:40:39,021 INFO L85 PathProgramCache]: Analyzing trace with hash 969168703, now seen corresponding path program 1 times [2025-03-03 22:40:39,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:40:39,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1577781626] [2025-03-03 22:40:39,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:40:39,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:40:39,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:40:39,031 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:40:39,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 22:40:39,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 22:40:39,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 22:40:39,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:40:39,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:40:39,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:40:39,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:40:39,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-03 22:40:39,230 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:40:39,230 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:40:39,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577781626] [2025-03-03 22:40:39,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577781626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:40:39,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:40:39,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:40:39,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262399851] [2025-03-03 22:40:39,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:40:39,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:40:39,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:40:39,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:40:39,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:40:39,254 INFO L87 Difference]: Start difference. First operand has 66 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 22:40:39,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:40:39,279 INFO L93 Difference]: Finished difference Result 126 states and 221 transitions. [2025-03-03 22:40:39,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:40:39,281 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 168 [2025-03-03 22:40:39,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:40:39,285 INFO L225 Difference]: With dead ends: 126 [2025-03-03 22:40:39,286 INFO L226 Difference]: Without dead ends: 63 [2025-03-03 22:40:39,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:40:39,292 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:40:39,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:40:39,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-03 22:40:39,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-03 22:40:39,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 22:40:39,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 94 transitions. [2025-03-03 22:40:39,326 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 94 transitions. Word has length 168 [2025-03-03 22:40:39,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:40:39,327 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 94 transitions. [2025-03-03 22:40:39,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 22:40:39,327 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 94 transitions. [2025-03-03 22:40:39,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 22:40:39,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:40:39,331 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:40:39,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 22:40:39,531 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 [2025-03-03 22:40:39,532 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:40:39,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:40:39,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1105189695, now seen corresponding path program 1 times [2025-03-03 22:40:39,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:40:39,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1841650671] [2025-03-03 22:40:39,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:40:39,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:40:39,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:40:39,535 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:40:39,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 22:40:39,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 22:40:39,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 22:40:39,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:40:39,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:40:39,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 22:40:39,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:40:39,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 22:40:39,695 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:40:39,695 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:40:39,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841650671] [2025-03-03 22:40:39,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841650671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:40:39,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:40:39,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:40:39,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336819750] [2025-03-03 22:40:39,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:40:39,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:40:39,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:40:39,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:40:39,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:40:39,700 INFO L87 Difference]: Start difference. First operand 63 states and 94 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 22:40:39,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:40:39,737 INFO L93 Difference]: Finished difference Result 136 states and 201 transitions. [2025-03-03 22:40:39,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:40:39,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 168 [2025-03-03 22:40:39,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:40:39,742 INFO L225 Difference]: With dead ends: 136 [2025-03-03 22:40:39,742 INFO L226 Difference]: Without dead ends: 76 [2025-03-03 22:40:39,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:40:39,743 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 13 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:40:39,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 181 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:40:39,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-03 22:40:39,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2025-03-03 22:40:39,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 22:40:39,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2025-03-03 22:40:39,757 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 168 [2025-03-03 22:40:39,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:40:39,759 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2025-03-03 22:40:39,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 22:40:39,759 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2025-03-03 22:40:39,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 22:40:39,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:40:39,762 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:40:39,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 22:40:39,962 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 [2025-03-03 22:40:39,962 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:40:39,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:40:39,963 INFO L85 PathProgramCache]: Analyzing trace with hash -702264768, now seen corresponding path program 1 times [2025-03-03 22:40:39,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:40:39,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [450510589] [2025-03-03 22:40:39,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:40:39,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:40:39,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:40:39,968 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:40:39,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 22:40:40,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 22:40:40,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 22:40:40,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:40:40,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:40:40,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 22:40:40,061 INFO L279 TraceCheckSpWp]: Computing forward predicates...