./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 02:59:18,225 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:59:18,278 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:59:18,285 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:59:18,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:59:18,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:59:18,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:59:18,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:59:18,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:59:18,310 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:59:18,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:59:18,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:59:18,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:59:18,312 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:59:18,312 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:59:18,312 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:59:18,312 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:59:18,312 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:59:18,312 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:59:18,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:59:18,313 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:59:18,313 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:59:18,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:59:18,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:59:18,313 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:59:18,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:59:18,313 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:59:18,313 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:59:18,313 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:59:18,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:59:18,314 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:59:18,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:59:18,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:59:18,314 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:59:18,314 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:59:18,314 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:59:18,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:59:18,315 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:59:18,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:59:18,315 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:59:18,315 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:59:18,315 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:59:18,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:59:18,315 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-17 02:59:18,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:59:18,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:59:18,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:59:18,575 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:59:18,575 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:59:18,576 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-17 02:59:19,881 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f518952f/55b7a7f69b5b44d485013b0a33ef9013/FLAGc37984177 [2025-03-17 02:59:20,127 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:59:20,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-86.i [2025-03-17 02:59:20,136 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f518952f/55b7a7f69b5b44d485013b0a33ef9013/FLAGc37984177 [2025-03-17 02:59:20,152 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f518952f/55b7a7f69b5b44d485013b0a33ef9013 [2025-03-17 02:59:20,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:59:20,155 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:59:20,157 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:59:20,157 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:59:20,160 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:59:20,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:59:20" (1/1) ... [2025-03-17 02:59:20,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@126c0674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:20, skipping insertion in model container [2025-03-17 02:59:20,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:59:20" (1/1) ... [2025-03-17 02:59:20,179 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:59:20,291 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-17 02:59:20,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:59:20,359 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:59:20,370 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-17 02:59:20,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:59:20,400 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:59:20,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:20 WrapperNode [2025-03-17 02:59:20,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:59:20,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:59:20,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:59:20,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:59:20,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:20" (1/1) ... [2025-03-17 02:59:20,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:20" (1/1) ... [2025-03-17 02:59:20,473 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2025-03-17 02:59:20,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:59:20,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:59:20,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:59:20,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:59:20,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:20" (1/1) ... [2025-03-17 02:59:20,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:20" (1/1) ... [2025-03-17 02:59:20,486 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:20" (1/1) ... [2025-03-17 02:59:20,509 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-17 02:59:20,510 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:20" (1/1) ... [2025-03-17 02:59:20,510 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:20" (1/1) ... [2025-03-17 02:59:20,523 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:20" (1/1) ... [2025-03-17 02:59:20,524 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:20" (1/1) ... [2025-03-17 02:59:20,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:20" (1/1) ... [2025-03-17 02:59:20,526 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:20" (1/1) ... [2025-03-17 02:59:20,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:59:20,529 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:59:20,529 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:59:20,529 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:59:20,530 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:20" (1/1) ... [2025-03-17 02:59:20,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:59:20,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:59:20,563 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-17 02:59:20,564 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-17 02:59:20,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:59:20,582 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:59:20,582 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:59:20,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:59:20,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:59:20,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:59:20,640 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:59:20,641 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:59:20,964 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: havoc property_#t~ite20#1;havoc property_#t~bitwise19#1;havoc property_#t~short21#1; [2025-03-17 02:59:20,995 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-17 02:59:20,996 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:59:21,012 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:59:21,013 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:59:21,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:59:21 BoogieIcfgContainer [2025-03-17 02:59:21,013 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:59:21,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:59:21,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:59:21,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:59:21,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:59:20" (1/3) ... [2025-03-17 02:59:21,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6967af1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:59:21, skipping insertion in model container [2025-03-17 02:59:21,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:20" (2/3) ... [2025-03-17 02:59:21,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6967af1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:59:21, skipping insertion in model container [2025-03-17 02:59:21,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:59:21" (3/3) ... [2025-03-17 02:59:21,021 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-86.i [2025-03-17 02:59:21,033 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:59:21,034 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-86.i that has 2 procedures, 71 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:59:21,078 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:59:21,089 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;@52db6ae6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:59:21,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:59:21,095 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 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-17 02:59:21,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-17 02:59:21,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:21,105 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] [2025-03-17 02:59:21,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:21,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:21,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1572177977, now seen corresponding path program 1 times [2025-03-17 02:59:21,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:21,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212429908] [2025-03-17 02:59:21,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:21,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:21,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-17 02:59:21,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-17 02:59:21,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:21,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:21,388 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-17 02:59:21,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:21,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212429908] [2025-03-17 02:59:21,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212429908] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:59:21,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96698726] [2025-03-17 02:59:21,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:21,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:59:21,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:59:21,397 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-17 02:59:21,398 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-17 02:59:21,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-17 02:59:21,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-17 02:59:21,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:21,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:21,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:59:21,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:59:21,575 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-17 02:59:21,578 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:59:21,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96698726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:21,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:59:21,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:59:21,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580974935] [2025-03-17 02:59:21,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:21,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:59:21,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:21,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:59:21,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:59:21,595 INFO L87 Difference]: Start difference. First operand has 71 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 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.0) internal successors, (32), 2 states have internal predecessors, (32), 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-17 02:59:21,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:21,614 INFO L93 Difference]: Finished difference Result 139 states and 242 transitions. [2025-03-17 02:59:21,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:59:21,616 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 167 [2025-03-17 02:59:21,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:21,621 INFO L225 Difference]: With dead ends: 139 [2025-03-17 02:59:21,621 INFO L226 Difference]: Without dead ends: 69 [2025-03-17 02:59:21,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 168 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-17 02:59:21,626 INFO L435 NwaCegarLoop]: 102 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, 102 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-17 02:59:21,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:59:21,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-17 02:59:21,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-17 02:59:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 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-17 02:59:21,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 104 transitions. [2025-03-17 02:59:21,660 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 104 transitions. Word has length 167 [2025-03-17 02:59:21,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:21,660 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 104 transitions. [2025-03-17 02:59:21,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-17 02:59:21,661 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 104 transitions. [2025-03-17 02:59:21,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-17 02:59:21,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:21,663 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] [2025-03-17 02:59:21,676 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-17 02:59:21,864 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-17 02:59:21,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:21,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:21,866 INFO L85 PathProgramCache]: Analyzing trace with hash 294976455, now seen corresponding path program 1 times [2025-03-17 02:59:21,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:21,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638731715] [2025-03-17 02:59:21,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:21,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:21,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-17 02:59:21,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-17 02:59:21,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:21,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:22,049 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-17 02:59:22,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:22,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638731715] [2025-03-17 02:59:22,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638731715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:22,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:22,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:59:22,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781334424] [2025-03-17 02:59:22,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:22,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:59:22,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:22,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:59:22,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:59:22,053 INFO L87 Difference]: Start difference. First operand 69 states and 104 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-17 02:59:22,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:22,103 INFO L93 Difference]: Finished difference Result 158 states and 235 transitions. [2025-03-17 02:59:22,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:59:22,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 167 [2025-03-17 02:59:22,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:22,108 INFO L225 Difference]: With dead ends: 158 [2025-03-17 02:59:22,108 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 02:59:22,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:59:22,112 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 22 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 205 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-17 02:59:22,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 205 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:59:22,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 02:59:22,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 79. [2025-03-17 02:59:22,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 49 states have internal predecessors, (62), 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-17 02:59:22,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 118 transitions. [2025-03-17 02:59:22,129 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 118 transitions. Word has length 167 [2025-03-17 02:59:22,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:22,131 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 118 transitions. [2025-03-17 02:59:22,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-17 02:59:22,133 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 118 transitions. [2025-03-17 02:59:22,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-17 02:59:22,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:22,135 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] [2025-03-17 02:59:22,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:59:22,137 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:22,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:22,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1501974904, now seen corresponding path program 1 times [2025-03-17 02:59:22,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:22,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841346320] [2025-03-17 02:59:22,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:22,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:22,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-17 02:59:22,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-17 02:59:22,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:22,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:22,870 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-17 02:59:22,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:22,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841346320] [2025-03-17 02:59:22,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841346320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:22,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:22,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 02:59:22,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482019751] [2025-03-17 02:59:22,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:22,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 02:59:22,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:22,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 02:59:22,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:59:22,876 INFO L87 Difference]: Start difference. First operand 79 states and 118 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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-17 02:59:23,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:23,027 INFO L93 Difference]: Finished difference Result 187 states and 272 transitions. [2025-03-17 02:59:23,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 02:59:23,027 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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 167 [2025-03-17 02:59:23,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:23,029 INFO L225 Difference]: With dead ends: 187 [2025-03-17 02:59:23,029 INFO L226 Difference]: Without dead ends: 109 [2025-03-17 02:59:23,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:59:23,030 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 46 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:59:23,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 688 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:59:23,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-17 02:59:23,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 86. [2025-03-17 02:59:23,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 56 states have internal predecessors, (72), 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-17 02:59:23,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 128 transitions. [2025-03-17 02:59:23,040 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 128 transitions. Word has length 167 [2025-03-17 02:59:23,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:23,040 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 128 transitions. [2025-03-17 02:59:23,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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-17 02:59:23,040 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 128 transitions. [2025-03-17 02:59:23,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-17 02:59:23,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:23,044 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] [2025-03-17 02:59:23,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:59:23,044 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:23,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:23,045 INFO L85 PathProgramCache]: Analyzing trace with hash 985537929, now seen corresponding path program 1 times [2025-03-17 02:59:23,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:23,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992543220] [2025-03-17 02:59:23,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:23,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:23,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-17 02:59:23,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-17 02:59:23,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:23,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:23,421 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-17 02:59:23,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:23,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992543220] [2025-03-17 02:59:23,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992543220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:23,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:23,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 02:59:23,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506096742] [2025-03-17 02:59:23,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:23,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 02:59:23,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:23,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 02:59:23,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:59:23,424 INFO L87 Difference]: Start difference. First operand 86 states and 128 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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-17 02:59:23,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:23,561 INFO L93 Difference]: Finished difference Result 194 states and 281 transitions. [2025-03-17 02:59:23,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 02:59:23,561 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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 167 [2025-03-17 02:59:23,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:23,564 INFO L225 Difference]: With dead ends: 194 [2025-03-17 02:59:23,565 INFO L226 Difference]: Without dead ends: 109 [2025-03-17 02:59:23,566 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-17 02:59:23,566 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 45 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:59:23,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 691 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:59:23,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-17 02:59:23,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 79. [2025-03-17 02:59:23,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 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-17 02:59:23,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 117 transitions. [2025-03-17 02:59:23,580 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 117 transitions. Word has length 167 [2025-03-17 02:59:23,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:23,581 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 117 transitions. [2025-03-17 02:59:23,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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-17 02:59:23,581 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 117 transitions. [2025-03-17 02:59:23,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-17 02:59:23,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:23,584 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] [2025-03-17 02:59:23,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 02:59:23,584 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:23,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:23,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1608148556, now seen corresponding path program 1 times [2025-03-17 02:59:23,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:23,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421831066] [2025-03-17 02:59:23,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:23,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:23,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 02:59:23,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 02:59:23,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:23,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:24,623 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-17 02:59:24,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:24,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421831066] [2025-03-17 02:59:24,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421831066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:24,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:24,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 02:59:24,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199004254] [2025-03-17 02:59:24,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:24,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 02:59:24,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:24,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 02:59:24,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:59:24,625 INFO L87 Difference]: Start difference. First operand 79 states and 117 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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-17 02:59:24,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:24,890 INFO L93 Difference]: Finished difference Result 187 states and 268 transitions. [2025-03-17 02:59:24,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 02:59:24,890 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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 169 [2025-03-17 02:59:24,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:24,892 INFO L225 Difference]: With dead ends: 187 [2025-03-17 02:59:24,892 INFO L226 Difference]: Without dead ends: 109 [2025-03-17 02:59:24,892 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-17 02:59:24,893 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 51 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:59:24,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 514 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:59:24,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-17 02:59:24,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 86. [2025-03-17 02:59:24,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.25) internal successors, (70), 56 states have internal predecessors, (70), 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-17 02:59:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 126 transitions. [2025-03-17 02:59:24,900 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 126 transitions. Word has length 169 [2025-03-17 02:59:24,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:24,901 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 126 transitions. [2025-03-17 02:59:24,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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-17 02:59:24,901 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 126 transitions. [2025-03-17 02:59:24,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-17 02:59:24,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:24,903 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] [2025-03-17 02:59:24,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 02:59:24,903 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:24,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:24,903 INFO L85 PathProgramCache]: Analyzing trace with hash -188802803, now seen corresponding path program 1 times [2025-03-17 02:59:24,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:24,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249312767] [2025-03-17 02:59:24,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:24,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:24,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 02:59:24,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 02:59:24,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:24,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:25,823 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-17 02:59:25,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:25,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249312767] [2025-03-17 02:59:25,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249312767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:25,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:25,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 02:59:25,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913918813] [2025-03-17 02:59:25,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:25,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:59:25,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:25,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:59:25,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:59:25,826 INFO L87 Difference]: Start difference. First operand 86 states and 126 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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-17 02:59:26,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:26,084 INFO L93 Difference]: Finished difference Result 194 states and 276 transitions. [2025-03-17 02:59:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 02:59:26,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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 169 [2025-03-17 02:59:26,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:26,085 INFO L225 Difference]: With dead ends: 194 [2025-03-17 02:59:26,086 INFO L226 Difference]: Without dead ends: 109 [2025-03-17 02:59:26,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:59:26,087 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 39 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 586 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-17 02:59:26,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 586 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:59:26,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-17 02:59:26,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 79. [2025-03-17 02:59:26,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 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-17 02:59:26,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 116 transitions. [2025-03-17 02:59:26,095 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 116 transitions. Word has length 169 [2025-03-17 02:59:26,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:26,096 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 116 transitions. [2025-03-17 02:59:26,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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-17 02:59:26,096 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 116 transitions. [2025-03-17 02:59:26,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-17 02:59:26,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:26,102 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] [2025-03-17 02:59:26,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 02:59:26,102 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:26,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:26,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1115270618, now seen corresponding path program 1 times [2025-03-17 02:59:26,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:26,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164836664] [2025-03-17 02:59:26,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:26,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:26,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 02:59:26,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 02:59:26,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:26,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:29,485 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-17 02:59:29,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:29,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164836664] [2025-03-17 02:59:29,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164836664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:29,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:29,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 02:59:29,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950195091] [2025-03-17 02:59:29,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:29,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 02:59:29,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:29,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 02:59:29,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:59:29,487 INFO L87 Difference]: Start difference. First operand 79 states and 116 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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-17 02:59:30,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:30,269 INFO L93 Difference]: Finished difference Result 174 states and 255 transitions. [2025-03-17 02:59:30,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 02:59:30,270 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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 169 [2025-03-17 02:59:30,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:30,272 INFO L225 Difference]: With dead ends: 174 [2025-03-17 02:59:30,273 INFO L226 Difference]: Without dead ends: 172 [2025-03-17 02:59:30,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-17 02:59:30,274 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 183 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 02:59:30,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 690 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 02:59:30,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-17 02:59:30,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 168. [2025-03-17 02:59:30,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 92 states have (on average 1.1521739130434783) internal successors, (106), 94 states have internal predecessors, (106), 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-17 02:59:30,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2025-03-17 02:59:30,316 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 169 [2025-03-17 02:59:30,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:30,318 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2025-03-17 02:59:30,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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-17 02:59:30,318 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2025-03-17 02:59:30,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 02:59:30,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:30,319 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] [2025-03-17 02:59:30,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 02:59:30,320 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:30,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:30,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2004002527, now seen corresponding path program 1 times [2025-03-17 02:59:30,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:30,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779767191] [2025-03-17 02:59:30,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:30,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:30,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 02:59:30,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 02:59:30,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:30,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:30,381 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-17 02:59:30,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:30,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779767191] [2025-03-17 02:59:30,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779767191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:30,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:30,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:59:30,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138385316] [2025-03-17 02:59:30,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:30,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:59:30,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:30,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:59:30,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:59:30,383 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-17 02:59:30,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:30,432 INFO L93 Difference]: Finished difference Result 308 states and 445 transitions. [2025-03-17 02:59:30,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:59:30,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 171 [2025-03-17 02:59:30,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:30,436 INFO L225 Difference]: With dead ends: 308 [2025-03-17 02:59:30,436 INFO L226 Difference]: Without dead ends: 180 [2025-03-17 02:59:30,437 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-17 02:59:30,437 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 29 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:59:30,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 309 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:59:30,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-17 02:59:30,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 161. [2025-03-17 02:59:30,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 87 states have internal predecessors, (96), 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-17 02:59:30,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 240 transitions. [2025-03-17 02:59:30,474 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 240 transitions. Word has length 171 [2025-03-17 02:59:30,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:30,474 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 240 transitions. [2025-03-17 02:59:30,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-17 02:59:30,475 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 240 transitions. [2025-03-17 02:59:30,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 02:59:30,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:30,476 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] [2025-03-17 02:59:30,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 02:59:30,476 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:30,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:30,477 INFO L85 PathProgramCache]: Analyzing trace with hash -76311765, now seen corresponding path program 1 times [2025-03-17 02:59:30,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:30,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413633136] [2025-03-17 02:59:30,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:30,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:30,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 02:59:30,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 02:59:30,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:30,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:30,539 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-17 02:59:30,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:30,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413633136] [2025-03-17 02:59:30,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413633136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:30,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:30,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:59:30,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579080753] [2025-03-17 02:59:30,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:30,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:59:30,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:30,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:59:30,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:59:30,541 INFO L87 Difference]: Start difference. First operand 161 states and 240 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-17 02:59:30,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:30,599 INFO L93 Difference]: Finished difference Result 321 states and 469 transitions. [2025-03-17 02:59:30,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:59:30,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 171 [2025-03-17 02:59:30,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:30,602 INFO L225 Difference]: With dead ends: 321 [2025-03-17 02:59:30,602 INFO L226 Difference]: Without dead ends: 200 [2025-03-17 02:59:30,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:59:30,603 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 81 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 393 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-17 02:59:30,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 393 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:59:30,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-17 02:59:30,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2025-03-17 02:59:30,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 104 states have (on average 1.1153846153846154) internal successors, (116), 107 states have internal predecessors, (116), 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-17 02:59:30,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 292 transitions. [2025-03-17 02:59:30,625 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 292 transitions. Word has length 171 [2025-03-17 02:59:30,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:30,626 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 292 transitions. [2025-03-17 02:59:30,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-17 02:59:30,626 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 292 transitions. [2025-03-17 02:59:30,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 02:59:30,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:30,627 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] [2025-03-17 02:59:30,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 02:59:30,628 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:30,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:30,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1350267163, now seen corresponding path program 1 times [2025-03-17 02:59:30,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:30,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742336909] [2025-03-17 02:59:30,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:30,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:30,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 02:59:30,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 02:59:30,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:30,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:31,643 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-17 02:59:31,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:31,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742336909] [2025-03-17 02:59:31,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742336909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:31,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:31,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:59:31,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900316436] [2025-03-17 02:59:31,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:31,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:59:31,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:31,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:59:31,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:59:31,645 INFO L87 Difference]: Start difference. First operand 197 states and 292 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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-17 02:59:32,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:32,321 INFO L93 Difference]: Finished difference Result 240 states and 342 transitions. [2025-03-17 02:59:32,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 02:59:32,321 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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 173 [2025-03-17 02:59:32,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:32,324 INFO L225 Difference]: With dead ends: 240 [2025-03-17 02:59:32,325 INFO L226 Difference]: Without dead ends: 238 [2025-03-17 02:59:32,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-17 02:59:32,326 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 108 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 02:59:32,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 808 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 02:59:32,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-17 02:59:32,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 235. [2025-03-17 02:59:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 136 states have (on average 1.1176470588235294) internal successors, (152), 141 states have internal predecessors, (152), 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-17 02:59:32,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 336 transitions. [2025-03-17 02:59:32,365 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 336 transitions. Word has length 173 [2025-03-17 02:59:32,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:32,365 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 336 transitions. [2025-03-17 02:59:32,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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-17 02:59:32,366 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 336 transitions. [2025-03-17 02:59:32,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 02:59:32,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:32,367 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] [2025-03-17 02:59:32,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 02:59:32,368 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:32,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:32,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1147748774, now seen corresponding path program 1 times [2025-03-17 02:59:32,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:32,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043321410] [2025-03-17 02:59:32,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:32,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:32,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 02:59:32,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 02:59:32,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:32,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:33,068 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-17 02:59:33,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:33,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043321410] [2025-03-17 02:59:33,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043321410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:33,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:33,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:59:33,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880661839] [2025-03-17 02:59:33,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:33,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:59:33,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:33,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:59:33,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:59:33,071 INFO L87 Difference]: Start difference. First operand 235 states and 336 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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-17 02:59:33,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:33,508 INFO L93 Difference]: Finished difference Result 288 states and 395 transitions. [2025-03-17 02:59:33,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 02:59:33,509 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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 173 [2025-03-17 02:59:33,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:33,510 INFO L225 Difference]: With dead ends: 288 [2025-03-17 02:59:33,511 INFO L226 Difference]: Without dead ends: 286 [2025-03-17 02:59:33,511 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-17 02:59:33,511 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 115 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:59:33,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 892 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 02:59:33,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-17 02:59:33,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 255. [2025-03-17 02:59:33,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 156 states have (on average 1.1282051282051282) internal successors, (176), 161 states have internal predecessors, (176), 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-17 02:59:33,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 360 transitions. [2025-03-17 02:59:33,539 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 360 transitions. Word has length 173 [2025-03-17 02:59:33,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:33,539 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 360 transitions. [2025-03-17 02:59:33,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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-17 02:59:33,540 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 360 transitions. [2025-03-17 02:59:33,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-17 02:59:33,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:33,543 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-17 02:59:33,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 02:59:33,543 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:33,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:33,544 INFO L85 PathProgramCache]: Analyzing trace with hash 736068344, now seen corresponding path program 1 times [2025-03-17 02:59:33,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:33,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107749085] [2025-03-17 02:59:33,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:33,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:33,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-17 02:59:33,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-17 02:59:33,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:33,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:33,592 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-17 02:59:33,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:33,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107749085] [2025-03-17 02:59:33,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107749085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:33,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:33,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:59:33,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832257305] [2025-03-17 02:59:33,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:33,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:59:33,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:33,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:59:33,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:59:33,594 INFO L87 Difference]: Start difference. First operand 255 states and 360 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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-17 02:59:33,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:33,633 INFO L93 Difference]: Finished difference Result 556 states and 783 transitions. [2025-03-17 02:59:33,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:59:33,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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-17 02:59:33,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:33,636 INFO L225 Difference]: With dead ends: 556 [2025-03-17 02:59:33,636 INFO L226 Difference]: Without dead ends: 341 [2025-03-17 02:59:33,639 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-17 02:59:33,640 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 89 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 280 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-17 02:59:33,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 280 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:59:33,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-17 02:59:33,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 323. [2025-03-17 02:59:33,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 177 states have (on average 1.0903954802259888) internal successors, (193), 184 states have internal predecessors, (193), 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-17 02:59:33,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 465 transitions. [2025-03-17 02:59:33,686 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 465 transitions. Word has length 174 [2025-03-17 02:59:33,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:33,686 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 465 transitions. [2025-03-17 02:59:33,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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-17 02:59:33,687 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 465 transitions. [2025-03-17 02:59:33,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-17 02:59:33,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:33,688 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-17 02:59:33,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 02:59:33,688 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:33,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:33,689 INFO L85 PathProgramCache]: Analyzing trace with hash 385707526, now seen corresponding path program 1 times [2025-03-17 02:59:33,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:33,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116729666] [2025-03-17 02:59:33,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:33,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:33,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-17 02:59:33,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-17 02:59:33,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:33,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:33,725 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-17 02:59:33,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:33,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116729666] [2025-03-17 02:59:33,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116729666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:33,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:33,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:59:33,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51338429] [2025-03-17 02:59:33,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:33,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:59:33,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:33,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:59:33,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:59:33,728 INFO L87 Difference]: Start difference. First operand 323 states and 465 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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-17 02:59:33,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:33,771 INFO L93 Difference]: Finished difference Result 619 states and 882 transitions. [2025-03-17 02:59:33,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:59:33,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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-17 02:59:33,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:33,774 INFO L225 Difference]: With dead ends: 619 [2025-03-17 02:59:33,774 INFO L226 Difference]: Without dead ends: 336 [2025-03-17 02:59:33,775 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-17 02:59:33,776 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 90 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 202 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-17 02:59:33,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 202 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:59:33,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-17 02:59:33,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 321. [2025-03-17 02:59:33,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 170 states have (on average 1.0705882352941176) internal successors, (182), 175 states have internal predecessors, (182), 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-17 02:59:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 462 transitions. [2025-03-17 02:59:33,821 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 462 transitions. Word has length 174 [2025-03-17 02:59:33,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:33,821 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 462 transitions. [2025-03-17 02:59:33,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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-17 02:59:33,822 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 462 transitions. [2025-03-17 02:59:33,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-17 02:59:33,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:33,823 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] [2025-03-17 02:59:33,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 02:59:33,823 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:33,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:33,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1412373864, now seen corresponding path program 1 times [2025-03-17 02:59:33,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:33,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114879824] [2025-03-17 02:59:33,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:33,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:33,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-17 02:59:33,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-17 02:59:33,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:33,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:59:33,867 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 02:59:33,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-17 02:59:33,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-17 02:59:33,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:33,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:59:33,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 02:59:33,967 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 02:59:33,969 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:59:33,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 02:59:33,975 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:59:34,073 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 02:59:34,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:59:34 BoogieIcfgContainer [2025-03-17 02:59:34,075 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 02:59:34,076 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 02:59:34,076 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 02:59:34,076 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 02:59:34,078 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:59:21" (3/4) ... [2025-03-17 02:59:34,091 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 02:59:34,093 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 02:59:34,094 INFO L158 Benchmark]: Toolchain (without parser) took 13938.55ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 112.2MB in the beginning and 432.2MB in the end (delta: -320.0MB). Peak memory consumption was 275.3MB. Max. memory is 16.1GB. [2025-03-17 02:59:34,094 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:59:34,095 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.28ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 97.9MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:59:34,095 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.80ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 93.6MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:59:34,095 INFO L158 Benchmark]: Boogie Preprocessor took 54.56ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 86.0MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:59:34,095 INFO L158 Benchmark]: IcfgBuilder took 484.07ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 61.5MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 02:59:34,096 INFO L158 Benchmark]: TraceAbstraction took 13060.40ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 61.0MB in the beginning and 168.9MB in the end (delta: -107.9MB). Peak memory consumption was 215.6MB. Max. memory is 16.1GB. [2025-03-17 02:59:34,096 INFO L158 Benchmark]: Witness Printer took 17.34ms. Allocated memory is still 469.8MB. Free memory was 168.9MB in the beginning and 432.2MB in the end (delta: -263.2MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2025-03-17 02:59:34,097 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.20ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.28ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 97.9MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.80ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 93.6MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.56ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 86.0MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 484.07ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 61.5MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13060.40ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 61.0MB in the beginning and 168.9MB in the end (delta: -107.9MB). Peak memory consumption was 215.6MB. Max. memory is 16.1GB. * Witness Printer took 17.34ms. Allocated memory is still 469.8MB. Free memory was 168.9MB in the beginning and 432.2MB in the end (delta: -263.2MB). Peak memory consumption was 9.3MB. 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; [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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, var_1_4=-8191, 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=4, var_1_4=-8191, 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=4, var_1_4=-8191, 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=4, var_1_4=-8191, 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=4, var_1_4=-8191, 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=4, var_1_4=-8191, 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=4, var_1_4=-8191, var_1_5=8191, 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=4, var_1_4=-8191, var_1_5=8191, 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=4, var_1_4=-8191, var_1_5=8191, 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=4, var_1_4=-8191, var_1_5=8191, 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=4, var_1_4=-8191, var_1_5=8191, 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=4, var_1_4=-8191, var_1_5=8191, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, 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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, var_1_14=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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, var_1_14=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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, var_1_14=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=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, var_1_14=32767, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, var_1_14=32767, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, var_1_14=32767, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_16=32767, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_16=32767, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_16=32767, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_16=32767, var_1_17=2147581951, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_16=32767, var_1_17=2147581951, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_16=32767, var_1_17=2147581951, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_16=32767, var_1_17=2147581951, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_16=32767, var_1_17=2147581951, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_16=32767, var_1_17=2147581951, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_16=32767, var_1_17=2147581951, var_1_18=64, var_1_1=4, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=8191, var_1_10=0, var_1_11=10, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_16=32767, var_1_17=2147581951, var_1_18=64, var_1_1=4, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_16=32767, var_1_17=2147581951, var_1_18=64, var_1_1=4, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_16=32767, var_1_17=2147581951, var_1_18=32767, var_1_1=4, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_16=32767, var_1_17=2147581951, var_1_18=32767, var_1_1=4, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_16=32767, var_1_17=2147581951, var_1_18=32767, var_1_1=4, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=32766, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_16=32767, var_1_17=2147581951, var_1_18=32767, var_1_1=4, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=32766, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_16=32767, var_1_17=2147581951, var_1_18=32767, var_1_1=4, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=32766, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_16=32767, var_1_17=2147581951, var_1_18=32767, var_1_1=4, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=32766, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_16=32767, var_1_17=2147581951, var_1_18=32767, var_1_1=4, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=32766, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_16=32767, var_1_17=2147581951, var_1_18=32767, var_1_1=4, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=32766, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_16=32767, var_1_17=2147581951, var_1_18=32767, var_1_1=4, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=32766, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_16=32767, var_1_17=2147581951, var_1_18=32767, var_1_1=4, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, 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=32766, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=-32770, var_1_16=32767, var_1_17=2147581951, var_1_18=32767, var_1_1=4, var_1_2=0, var_1_3=4, var_1_4=-8191, var_1_5=8191, var_1_6=4, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 71 locations, 136 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.9s, OverallIterations: 14, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 898 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 898 mSDsluCounter, 6360 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4610 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1892 IncrementalHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 1750 mSDtfsCounter, 1892 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=323occurred 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, 210 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 2553 NumberOfCodeBlocks, 2553 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2364 ConstructedInterpolants, 0 QuantifiedInterpolants, 6719 SizeOfPredicates, 0 NumberOfNonLiveVariables, 363 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-17 02:59:34,135 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-?-8fc3dc6-m [2025-03-17 02:59:36,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:59:36,343 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 02:59:36,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:59:36,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:59:36,367 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:59:36,367 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:59:36,368 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:59:36,368 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:59:36,368 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:59:36,368 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:59:36,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:59:36,368 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:59:36,368 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:59:36,369 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:59:36,369 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:59:36,369 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:59:36,369 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:59:36,369 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:59:36,369 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:59:36,369 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:59:36,369 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:59:36,369 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:59:36,369 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 02:59:36,369 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 02:59:36,369 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 02:59:36,370 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:59:36,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:59:36,370 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:59:36,370 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:59:36,370 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:59:36,372 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:59:36,372 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:59:36,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:59:36,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:59:36,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:59:36,372 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:59:36,372 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:59:36,373 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:59:36,373 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 02:59:36,373 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 02:59:36,373 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:59:36,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:59:36,373 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:59:36,373 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:59:36,373 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-17 02:59:36,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:59:36,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:59:36,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:59:36,670 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:59:36,670 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:59:36,671 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-17 02:59:37,944 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aae83e8ea/f6a7884572e64ecca20b4006807917b0/FLAG72439493a [2025-03-17 02:59:38,139 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:59:38,139 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-86.i [2025-03-17 02:59:38,148 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aae83e8ea/f6a7884572e64ecca20b4006807917b0/FLAG72439493a [2025-03-17 02:59:38,495 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aae83e8ea/f6a7884572e64ecca20b4006807917b0 [2025-03-17 02:59:38,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:59:38,499 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:59:38,500 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:59:38,500 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:59:38,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:59:38,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:59:38" (1/1) ... [2025-03-17 02:59:38,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4706bba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:38, skipping insertion in model container [2025-03-17 02:59:38,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:59:38" (1/1) ... [2025-03-17 02:59:38,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:59:38,630 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-17 02:59:38,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:59:38,694 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:59:38,703 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-17 02:59:38,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:59:38,737 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:59:38,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:38 WrapperNode [2025-03-17 02:59:38,738 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:59:38,738 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:59:38,738 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:59:38,739 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:59:38,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:38" (1/1) ... [2025-03-17 02:59:38,752 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:38" (1/1) ... [2025-03-17 02:59:38,774 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2025-03-17 02:59:38,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:59:38,775 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:59:38,775 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:59:38,775 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:59:38,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:38" (1/1) ... [2025-03-17 02:59:38,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:38" (1/1) ... [2025-03-17 02:59:38,784 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:38" (1/1) ... [2025-03-17 02:59:38,793 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-17 02:59:38,794 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:38" (1/1) ... [2025-03-17 02:59:38,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:38" (1/1) ... [2025-03-17 02:59:38,800 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:38" (1/1) ... [2025-03-17 02:59:38,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:38" (1/1) ... [2025-03-17 02:59:38,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:38" (1/1) ... [2025-03-17 02:59:38,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:38" (1/1) ... [2025-03-17 02:59:38,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:59:38,806 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:59:38,806 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:59:38,807 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:59:38,807 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:38" (1/1) ... [2025-03-17 02:59:38,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:59:38,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:59:38,836 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-17 02:59:38,844 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-17 02:59:38,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:59:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 02:59:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:59:38,864 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:59:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:59:38,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:59:38,928 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:59:38,929 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:59:39,145 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 02:59:39,145 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:59:39,158 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:59:39,159 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:59:39,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:59:39 BoogieIcfgContainer [2025-03-17 02:59:39,159 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:59:39,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:59:39,161 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:59:39,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:59:39,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:59:38" (1/3) ... [2025-03-17 02:59:39,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ad43f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:59:39, skipping insertion in model container [2025-03-17 02:59:39,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:38" (2/3) ... [2025-03-17 02:59:39,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ad43f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:59:39, skipping insertion in model container [2025-03-17 02:59:39,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:59:39" (3/3) ... [2025-03-17 02:59:39,167 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-86.i [2025-03-17 02:59:39,177 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:59:39,178 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-86.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:59:39,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:59:39,228 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;@4ca5a411, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:59:39,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:59:39,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 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-17 02:59:39,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 02:59:39,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:39,245 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] [2025-03-17 02:59:39,246 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:39,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:39,250 INFO L85 PathProgramCache]: Analyzing trace with hash 197299142, now seen corresponding path program 1 times [2025-03-17 02:59:39,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:59:39,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1553351007] [2025-03-17 02:59:39,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:39,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:59:39,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:59:39,263 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-17 02:59:39,265 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-17 02:59:39,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 02:59:39,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 02:59:39,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:39,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:39,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:59:39,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:59:39,491 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-17 02:59:39,491 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:59:39,492 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:59:39,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553351007] [2025-03-17 02:59:39,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553351007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:39,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:39,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 02:59:39,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320503458] [2025-03-17 02:59:39,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:39,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:59:39,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:59:39,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:59:39,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:59:39,520 INFO L87 Difference]: Start difference. First operand has 61 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 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) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-17 02:59:39,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:39,543 INFO L93 Difference]: Finished difference Result 119 states and 214 transitions. [2025-03-17 02:59:39,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:59:39,544 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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 164 [2025-03-17 02:59:39,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:39,548 INFO L225 Difference]: With dead ends: 119 [2025-03-17 02:59:39,548 INFO L226 Difference]: Without dead ends: 59 [2025-03-17 02:59:39,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 163 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-17 02:59:39,552 INFO L435 NwaCegarLoop]: 90 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, 90 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-17 02:59:39,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:59:39,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-17 02:59:39,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-17 02:59:39,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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-17 02:59:39,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 90 transitions. [2025-03-17 02:59:39,582 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 90 transitions. Word has length 164 [2025-03-17 02:59:39,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:39,583 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 90 transitions. [2025-03-17 02:59:39,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-17 02:59:39,583 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 90 transitions. [2025-03-17 02:59:39,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 02:59:39,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:39,585 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] [2025-03-17 02:59:39,591 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-17 02:59:39,787 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-17 02:59:39,788 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:39,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:39,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1876523066, now seen corresponding path program 1 times [2025-03-17 02:59:39,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:59:39,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1208222484] [2025-03-17 02:59:39,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:39,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:59:39,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:59:39,791 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-17 02:59:39,793 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-17 02:59:39,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 02:59:39,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 02:59:39,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:39,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:39,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 02:59:39,910 INFO L279 TraceCheckSpWp]: Computing forward predicates...