./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.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 8f8bcfdb6015d440e6a1a4eaadd74459c55c3a05418feb55db2c008576c462ad --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:34:34,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:34:34,187 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:34:34,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:34:34,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:34:34,214 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:34:34,215 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:34:34,215 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:34:34,215 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:34:34,216 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:34:34,216 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:34:34,216 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:34:34,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:34:34,216 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:34:34,216 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:34:34,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:34:34,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:34:34,217 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:34:34,217 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:34:34,217 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:34:34,217 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:34:34,217 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:34:34,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:34:34,217 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:34:34,217 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:34:34,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:34:34,217 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:34:34,217 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:34:34,218 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:34:34,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:34:34,218 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:34:34,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:34:34,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:34:34,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:34:34,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:34:34,218 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:34:34,218 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:34:34,218 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:34:34,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:34:34,218 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:34:34,218 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:34:34,218 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:34:34,218 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:34:34,218 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 -> 8f8bcfdb6015d440e6a1a4eaadd74459c55c3a05418feb55db2c008576c462ad [2025-03-03 23:34:34,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:34:34,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:34:34,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:34:34,499 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:34:34,499 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:34:34,500 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i [2025-03-03 23:34:35,715 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c041e5ba/c07b5031afcf49b198b17ed2e72b942a/FLAG1f25ce5cc [2025-03-03 23:34:35,982 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:34:35,983 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i [2025-03-03 23:34:35,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c041e5ba/c07b5031afcf49b198b17ed2e72b942a/FLAG1f25ce5cc [2025-03-03 23:34:36,294 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c041e5ba/c07b5031afcf49b198b17ed2e72b942a [2025-03-03 23:34:36,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:34:36,297 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:34:36,298 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:34:36,298 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:34:36,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:34:36,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:34:36" (1/1) ... [2025-03-03 23:34:36,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b5e713b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:36, skipping insertion in model container [2025-03-03 23:34:36,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:34:36" (1/1) ... [2025-03-03 23:34:36,316 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:34:36,423 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_loopvsstraightlinecode_50-1loop_file-63.i[915,928] [2025-03-03 23:34:36,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:34:36,503 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:34:36,512 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_loopvsstraightlinecode_50-1loop_file-63.i[915,928] [2025-03-03 23:34:36,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:34:36,561 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:34:36,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:36 WrapperNode [2025-03-03 23:34:36,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:34:36,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:34:36,563 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:34:36,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:34:36,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:36" (1/1) ... [2025-03-03 23:34:36,577 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:36" (1/1) ... [2025-03-03 23:34:36,608 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2025-03-03 23:34:36,613 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:34:36,613 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:34:36,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:34:36,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:34:36,624 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:36" (1/1) ... [2025-03-03 23:34:36,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:36" (1/1) ... [2025-03-03 23:34:36,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:36" (1/1) ... [2025-03-03 23:34:36,654 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:34:36,655 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:36" (1/1) ... [2025-03-03 23:34:36,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:36" (1/1) ... [2025-03-03 23:34:36,663 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:36" (1/1) ... [2025-03-03 23:34:36,668 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:36" (1/1) ... [2025-03-03 23:34:36,671 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:36" (1/1) ... [2025-03-03 23:34:36,672 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:36" (1/1) ... [2025-03-03 23:34:36,677 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:34:36,680 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:34:36,681 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:34:36,681 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:34:36,682 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:36" (1/1) ... [2025-03-03 23:34:36,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:34:36,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:34:36,710 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:34:36,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:34:36,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:34:36,735 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:34:36,735 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:34:36,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:34:36,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:34:36,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:34:36,801 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:34:36,803 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:34:37,105 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L124: havoc property_#t~bitwise17#1;havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2025-03-03 23:34:37,124 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 23:34:37,124 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:34:37,144 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:34:37,145 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:34:37,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:34:37 BoogieIcfgContainer [2025-03-03 23:34:37,146 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:34:37,148 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:34:37,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:34:37,151 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:34:37,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:34:36" (1/3) ... [2025-03-03 23:34:37,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628c7488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:34:37, skipping insertion in model container [2025-03-03 23:34:37,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:36" (2/3) ... [2025-03-03 23:34:37,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628c7488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:34:37, skipping insertion in model container [2025-03-03 23:34:37,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:34:37" (3/3) ... [2025-03-03 23:34:37,153 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-63.i [2025-03-03 23:34:37,164 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:34:37,165 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-63.i that has 2 procedures, 71 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:34:37,208 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:34:37,218 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;@1b34ed02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:34:37,218 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:34:37,222 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:34:37,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 23:34:37,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:34:37,233 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:34:37,234 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:34:37,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:34:37,238 INFO L85 PathProgramCache]: Analyzing trace with hash -899292378, now seen corresponding path program 1 times [2025-03-03 23:34:37,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:34:37,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935997291] [2025-03-03 23:34:37,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:34:37,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:34:37,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 23:34:37,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 23:34:37,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:34:37,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:34:37,528 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-03 23:34:37,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:34:37,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935997291] [2025-03-03 23:34:37,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935997291] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:34:37,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321838370] [2025-03-03 23:34:37,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:34:37,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:34:37,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:34:37,533 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:34:37,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:34:37,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 23:34:37,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 23:34:37,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:34:37,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:34:37,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:34:37,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:34:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-03 23:34:37,736 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:34:37,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321838370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:34:37,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:34:37,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:34:37,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688022893] [2025-03-03 23:34:37,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:34:37,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:34:37,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:34:37,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:34:37,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:34:37,762 INFO L87 Difference]: Start difference. First operand has 71 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 23:34:37,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:34:37,794 INFO L93 Difference]: Finished difference Result 139 states and 221 transitions. [2025-03-03 23:34:37,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:34:37,797 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 116 [2025-03-03 23:34:37,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:34:37,802 INFO L225 Difference]: With dead ends: 139 [2025-03-03 23:34:37,803 INFO L226 Difference]: Without dead ends: 68 [2025-03-03 23:34:37,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:34:37,811 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:34:37,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:34:37,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-03 23:34:37,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-03 23:34:37,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:34:37,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 99 transitions. [2025-03-03 23:34:37,849 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 99 transitions. Word has length 116 [2025-03-03 23:34:37,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:34:37,850 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 99 transitions. [2025-03-03 23:34:37,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 23:34:37,850 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 99 transitions. [2025-03-03 23:34:37,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 23:34:37,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:34:37,854 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:34:37,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 23:34:38,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 23:34:38,055 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:34:38,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:34:38,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1875554176, now seen corresponding path program 1 times [2025-03-03 23:34:38,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:34:38,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059760093] [2025-03-03 23:34:38,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:34:38,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:34:38,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 23:34:38,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 23:34:38,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:34:38,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:34:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-03 23:34:38,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:34:38,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059760093] [2025-03-03 23:34:38,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059760093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:34:38,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:34:38,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:34:38,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107816722] [2025-03-03 23:34:38,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:34:38,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:34:38,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:34:38,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:34:38,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:34:38,274 INFO L87 Difference]: Start difference. First operand 68 states and 99 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:38,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:34:38,336 INFO L93 Difference]: Finished difference Result 163 states and 238 transitions. [2025-03-03 23:34:38,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:34:38,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2025-03-03 23:34:38,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:34:38,338 INFO L225 Difference]: With dead ends: 163 [2025-03-03 23:34:38,338 INFO L226 Difference]: Without dead ends: 98 [2025-03-03 23:34:38,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:34:38,339 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 33 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:34:38,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 189 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:34:38,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-03 23:34:38,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 81. [2025-03-03 23:34:38,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:34:38,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 118 transitions. [2025-03-03 23:34:38,347 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 118 transitions. Word has length 116 [2025-03-03 23:34:38,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:34:38,348 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 118 transitions. [2025-03-03 23:34:38,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:38,348 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 118 transitions. [2025-03-03 23:34:38,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 23:34:38,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:34:38,349 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:34:38,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:34:38,350 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:34:38,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:34:38,350 INFO L85 PathProgramCache]: Analyzing trace with hash -2063175776, now seen corresponding path program 1 times [2025-03-03 23:34:38,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:34:38,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716913410] [2025-03-03 23:34:38,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:34:38,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:34:38,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 23:34:38,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 23:34:38,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:34:38,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:34:38,961 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-03 23:34:38,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:34:38,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716913410] [2025-03-03 23:34:38,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716913410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:34:38,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:34:38,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:34:38,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700297735] [2025-03-03 23:34:38,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:34:38,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:34:38,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:34:38,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:34:38,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:34:38,964 INFO L87 Difference]: Start difference. First operand 81 states and 118 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:39,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:34:39,155 INFO L93 Difference]: Finished difference Result 263 states and 386 transitions. [2025-03-03 23:34:39,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:34:39,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2025-03-03 23:34:39,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:34:39,158 INFO L225 Difference]: With dead ends: 263 [2025-03-03 23:34:39,158 INFO L226 Difference]: Without dead ends: 185 [2025-03-03 23:34:39,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:34:39,159 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 244 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:34:39,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 281 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:34:39,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-03 23:34:39,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 102. [2025-03-03 23:34:39,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 84 states have internal predecessors, (118), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:34:39,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 150 transitions. [2025-03-03 23:34:39,168 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 150 transitions. Word has length 116 [2025-03-03 23:34:39,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:34:39,171 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 150 transitions. [2025-03-03 23:34:39,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:39,172 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 150 transitions. [2025-03-03 23:34:39,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 23:34:39,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:34:39,173 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:34:39,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:34:39,173 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:34:39,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:34:39,173 INFO L85 PathProgramCache]: Analyzing trace with hash -53874317, now seen corresponding path program 1 times [2025-03-03 23:34:39,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:34:39,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376963475] [2025-03-03 23:34:39,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:34:39,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:34:39,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 23:34:39,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 23:34:39,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:34:39,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:34:39,697 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-03 23:34:39,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:34:39,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376963475] [2025-03-03 23:34:39,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376963475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:34:39,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:34:39,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 23:34:39,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301584840] [2025-03-03 23:34:39,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:34:39,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:34:39,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:34:39,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:34:39,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:34:39,699 INFO L87 Difference]: Start difference. First operand 102 states and 150 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:40,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:34:40,013 INFO L93 Difference]: Finished difference Result 263 states and 385 transitions. [2025-03-03 23:34:40,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 23:34:40,014 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2025-03-03 23:34:40,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:34:40,015 INFO L225 Difference]: With dead ends: 263 [2025-03-03 23:34:40,015 INFO L226 Difference]: Without dead ends: 164 [2025-03-03 23:34:40,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:34:40,016 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 74 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:34:40,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 809 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:34:40,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-03 23:34:40,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 115. [2025-03-03 23:34:40,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 97 states have (on average 1.402061855670103) internal successors, (136), 97 states have internal predecessors, (136), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:34:40,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2025-03-03 23:34:40,036 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 117 [2025-03-03 23:34:40,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:34:40,037 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2025-03-03 23:34:40,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:40,037 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2025-03-03 23:34:40,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 23:34:40,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:34:40,039 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:34:40,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 23:34:40,039 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:34:40,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:34:40,039 INFO L85 PathProgramCache]: Analyzing trace with hash -385683346, now seen corresponding path program 1 times [2025-03-03 23:34:40,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:34:40,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309310610] [2025-03-03 23:34:40,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:34:40,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:34:40,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 23:34:40,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 23:34:40,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:34:40,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:34:40,534 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-03 23:34:40,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:34:40,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309310610] [2025-03-03 23:34:40,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309310610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:34:40,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:34:40,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 23:34:40,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607005364] [2025-03-03 23:34:40,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:34:40,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 23:34:40,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:34:40,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 23:34:40,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 23:34:40,536 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:40,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:34:40,861 INFO L93 Difference]: Finished difference Result 304 states and 432 transitions. [2025-03-03 23:34:40,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:34:40,862 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2025-03-03 23:34:40,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:34:40,865 INFO L225 Difference]: With dead ends: 304 [2025-03-03 23:34:40,865 INFO L226 Difference]: Without dead ends: 192 [2025-03-03 23:34:40,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:34:40,868 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 93 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:34:40,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 475 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:34:40,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-03 23:34:40,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 121. [2025-03-03 23:34:40,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:34:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 170 transitions. [2025-03-03 23:34:40,876 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 170 transitions. Word has length 118 [2025-03-03 23:34:40,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:34:40,876 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 170 transitions. [2025-03-03 23:34:40,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:40,877 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 170 transitions. [2025-03-03 23:34:40,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 23:34:40,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:34:40,878 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:34:40,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 23:34:40,878 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:34:40,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:34:40,879 INFO L85 PathProgramCache]: Analyzing trace with hash 202418416, now seen corresponding path program 1 times [2025-03-03 23:34:40,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:34:40,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365856549] [2025-03-03 23:34:40,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:34:40,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:34:40,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 23:34:40,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 23:34:40,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:34:40,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:34:40,945 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-03 23:34:40,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:34:40,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365856549] [2025-03-03 23:34:40,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365856549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:34:40,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:34:40,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:34:40,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480821493] [2025-03-03 23:34:40,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:34:40,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:34:40,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:34:40,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:34:40,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:34:40,947 INFO L87 Difference]: Start difference. First operand 121 states and 170 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:40,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:34:40,984 INFO L93 Difference]: Finished difference Result 298 states and 417 transitions. [2025-03-03 23:34:40,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:34:40,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2025-03-03 23:34:40,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:34:40,986 INFO L225 Difference]: With dead ends: 298 [2025-03-03 23:34:40,986 INFO L226 Difference]: Without dead ends: 180 [2025-03-03 23:34:40,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:34:40,987 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 76 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:34:40,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 180 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:34:40,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-03 23:34:40,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 111. [2025-03-03 23:34:40,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 93 states have (on average 1.3225806451612903) internal successors, (123), 93 states have internal predecessors, (123), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:34:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 155 transitions. [2025-03-03 23:34:40,993 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 155 transitions. Word has length 118 [2025-03-03 23:34:40,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:34:40,994 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 155 transitions. [2025-03-03 23:34:40,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:40,994 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 155 transitions. [2025-03-03 23:34:40,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 23:34:40,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:34:40,995 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:34:40,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 23:34:40,995 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:34:40,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:34:40,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1415926980, now seen corresponding path program 1 times [2025-03-03 23:34:40,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:34:40,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745638486] [2025-03-03 23:34:40,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:34:40,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:34:41,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 23:34:41,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 23:34:41,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:34:41,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:34:41,417 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-03 23:34:41,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:34:41,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745638486] [2025-03-03 23:34:41,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745638486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:34:41,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:34:41,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 23:34:41,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168827887] [2025-03-03 23:34:41,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:34:41,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 23:34:41,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:34:41,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 23:34:41,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 23:34:41,419 INFO L87 Difference]: Start difference. First operand 111 states and 155 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:41,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:34:41,733 INFO L93 Difference]: Finished difference Result 317 states and 444 transitions. [2025-03-03 23:34:41,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 23:34:41,734 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2025-03-03 23:34:41,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:34:41,735 INFO L225 Difference]: With dead ends: 317 [2025-03-03 23:34:41,736 INFO L226 Difference]: Without dead ends: 209 [2025-03-03 23:34:41,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:34:41,736 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 161 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:34:41,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1129 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:34:41,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-03 23:34:41,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 121. [2025-03-03 23:34:41,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 103 states have (on average 1.3300970873786409) internal successors, (137), 103 states have internal predecessors, (137), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:34:41,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 169 transitions. [2025-03-03 23:34:41,744 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 169 transitions. Word has length 118 [2025-03-03 23:34:41,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:34:41,744 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 169 transitions. [2025-03-03 23:34:41,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:41,744 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 169 transitions. [2025-03-03 23:34:41,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 23:34:41,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:34:41,745 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:34:41,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 23:34:41,749 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:34:41,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:34:41,749 INFO L85 PathProgramCache]: Analyzing trace with hash -159559019, now seen corresponding path program 1 times [2025-03-03 23:34:41,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:34:41,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599906131] [2025-03-03 23:34:41,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:34:41,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:34:41,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 23:34:41,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 23:34:41,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:34:41,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:34:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-03 23:34:42,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:34:42,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599906131] [2025-03-03 23:34:42,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599906131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:34:42,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:34:42,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 23:34:42,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976956629] [2025-03-03 23:34:42,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:34:42,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:34:42,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:34:42,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:34:42,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:34:42,068 INFO L87 Difference]: Start difference. First operand 121 states and 169 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:42,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:34:42,763 INFO L93 Difference]: Finished difference Result 526 states and 732 transitions. [2025-03-03 23:34:42,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:34:42,764 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2025-03-03 23:34:42,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:34:42,768 INFO L225 Difference]: With dead ends: 526 [2025-03-03 23:34:42,768 INFO L226 Difference]: Without dead ends: 408 [2025-03-03 23:34:42,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-03-03 23:34:42,771 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 546 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 23:34:42,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 510 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 23:34:42,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-03 23:34:42,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 142. [2025-03-03 23:34:42,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.3387096774193548) internal successors, (166), 124 states have internal predecessors, (166), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:34:42,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 198 transitions. [2025-03-03 23:34:42,794 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 198 transitions. Word has length 119 [2025-03-03 23:34:42,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:34:42,796 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 198 transitions. [2025-03-03 23:34:42,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:42,796 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 198 transitions. [2025-03-03 23:34:42,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 23:34:42,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:34:42,797 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:34:42,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 23:34:42,799 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:34:42,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:34:42,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1967013482, now seen corresponding path program 1 times [2025-03-03 23:34:42,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:34:42,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833681229] [2025-03-03 23:34:42,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:34:42,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:34:42,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 23:34:42,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 23:34:42,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:34:42,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:34:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-03 23:34:43,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:34:43,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833681229] [2025-03-03 23:34:43,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833681229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:34:43,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:34:43,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 23:34:43,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728101926] [2025-03-03 23:34:43,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:34:43,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 23:34:43,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:34:43,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 23:34:43,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:34:43,121 INFO L87 Difference]: Start difference. First operand 142 states and 198 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:43,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:34:43,404 INFO L93 Difference]: Finished difference Result 347 states and 471 transitions. [2025-03-03 23:34:43,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:34:43,404 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2025-03-03 23:34:43,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:34:43,405 INFO L225 Difference]: With dead ends: 347 [2025-03-03 23:34:43,405 INFO L226 Difference]: Without dead ends: 208 [2025-03-03 23:34:43,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:34:43,406 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 86 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:34:43,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 730 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:34:43,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-03 23:34:43,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 138. [2025-03-03 23:34:43,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 120 states have (on average 1.3333333333333333) internal successors, (160), 120 states have internal predecessors, (160), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:34:43,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 192 transitions. [2025-03-03 23:34:43,412 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 192 transitions. Word has length 119 [2025-03-03 23:34:43,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:34:43,413 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 192 transitions. [2025-03-03 23:34:43,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:43,413 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 192 transitions. [2025-03-03 23:34:43,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 23:34:43,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:34:43,414 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:34:43,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 23:34:43,414 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:34:43,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:34:43,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1060010319, now seen corresponding path program 1 times [2025-03-03 23:34:43,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:34:43,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445402317] [2025-03-03 23:34:43,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:34:43,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:34:43,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 23:34:43,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 23:34:43,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:34:43,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:34:43,463 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-03 23:34:43,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:34:43,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445402317] [2025-03-03 23:34:43,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445402317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:34:43,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:34:43,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:34:43,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237844208] [2025-03-03 23:34:43,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:34:43,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:34:43,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:34:43,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:34:43,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:34:43,465 INFO L87 Difference]: Start difference. First operand 138 states and 192 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:43,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:34:43,496 INFO L93 Difference]: Finished difference Result 352 states and 489 transitions. [2025-03-03 23:34:43,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:34:43,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2025-03-03 23:34:43,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:34:43,500 INFO L225 Difference]: With dead ends: 352 [2025-03-03 23:34:43,500 INFO L226 Difference]: Without dead ends: 217 [2025-03-03 23:34:43,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:34:43,501 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 83 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:34:43,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 173 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:34:43,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-03 23:34:43,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 170. [2025-03-03 23:34:43,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 152 states have (on average 1.3355263157894737) internal successors, (203), 152 states have internal predecessors, (203), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:34:43,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 235 transitions. [2025-03-03 23:34:43,509 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 235 transitions. Word has length 119 [2025-03-03 23:34:43,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:34:43,510 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 235 transitions. [2025-03-03 23:34:43,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:43,510 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 235 transitions. [2025-03-03 23:34:43,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 23:34:43,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:34:43,511 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:34:43,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 23:34:43,511 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:34:43,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:34:43,512 INFO L85 PathProgramCache]: Analyzing trace with hash 75612250, now seen corresponding path program 1 times [2025-03-03 23:34:43,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:34:43,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662872038] [2025-03-03 23:34:43,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:34:43,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:34:43,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 23:34:43,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 23:34:43,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:34:43,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:34:43,563 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-03 23:34:43,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:34:43,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662872038] [2025-03-03 23:34:43,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662872038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:34:43,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:34:43,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:34:43,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641788469] [2025-03-03 23:34:43,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:34:43,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:34:43,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:34:43,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:34:43,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:34:43,566 INFO L87 Difference]: Start difference. First operand 170 states and 235 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:43,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:34:43,601 INFO L93 Difference]: Finished difference Result 380 states and 526 transitions. [2025-03-03 23:34:43,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:34:43,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2025-03-03 23:34:43,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:34:43,604 INFO L225 Difference]: With dead ends: 380 [2025-03-03 23:34:43,604 INFO L226 Difference]: Without dead ends: 213 [2025-03-03 23:34:43,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:34:43,605 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 67 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:34:43,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 227 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:34:43,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-03 23:34:43,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 149. [2025-03-03 23:34:43,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 131 states have (on average 1.3358778625954197) internal successors, (175), 131 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:34:43,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 207 transitions. [2025-03-03 23:34:43,616 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 207 transitions. Word has length 119 [2025-03-03 23:34:43,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:34:43,616 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 207 transitions. [2025-03-03 23:34:43,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:43,617 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 207 transitions. [2025-03-03 23:34:43,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 23:34:43,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:34:43,619 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:34:43,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 23:34:43,619 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:34:43,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:34:43,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1641373042, now seen corresponding path program 1 times [2025-03-03 23:34:43,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:34:43,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916935508] [2025-03-03 23:34:43,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:34:43,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:34:43,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 23:34:43,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 23:34:43,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:34:43,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:34:43,657 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-03 23:34:43,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:34:43,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916935508] [2025-03-03 23:34:43,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916935508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:34:43,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:34:43,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:34:43,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694652123] [2025-03-03 23:34:43,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:34:43,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:34:43,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:34:43,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:34:43,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:34:43,659 INFO L87 Difference]: Start difference. First operand 149 states and 207 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:43,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:34:43,686 INFO L93 Difference]: Finished difference Result 371 states and 511 transitions. [2025-03-03 23:34:43,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:34:43,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2025-03-03 23:34:43,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:34:43,689 INFO L225 Difference]: With dead ends: 371 [2025-03-03 23:34:43,689 INFO L226 Difference]: Without dead ends: 225 [2025-03-03 23:34:43,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:34:43,689 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 75 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:34:43,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 240 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:34:43,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-03 23:34:43,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 169. [2025-03-03 23:34:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 151 states have (on average 1.2913907284768211) internal successors, (195), 151 states have internal predecessors, (195), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:34:43,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 227 transitions. [2025-03-03 23:34:43,695 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 227 transitions. Word has length 119 [2025-03-03 23:34:43,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:34:43,695 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 227 transitions. [2025-03-03 23:34:43,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:43,695 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 227 transitions. [2025-03-03 23:34:43,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 23:34:43,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:34:43,696 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:34:43,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 23:34:43,696 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:34:43,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:34:43,697 INFO L85 PathProgramCache]: Analyzing trace with hash -88319735, now seen corresponding path program 1 times [2025-03-03 23:34:43,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:34:43,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424880908] [2025-03-03 23:34:43,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:34:43,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:34:43,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 23:34:43,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 23:34:43,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:34:43,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:34:44,011 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-03 23:34:44,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:34:44,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424880908] [2025-03-03 23:34:44,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424880908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:34:44,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:34:44,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 23:34:44,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002492004] [2025-03-03 23:34:44,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:34:44,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 23:34:44,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:34:44,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 23:34:44,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:34:44,013 INFO L87 Difference]: Start difference. First operand 169 states and 227 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:44,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:34:44,256 INFO L93 Difference]: Finished difference Result 395 states and 519 transitions. [2025-03-03 23:34:44,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:34:44,256 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2025-03-03 23:34:44,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:34:44,258 INFO L225 Difference]: With dead ends: 395 [2025-03-03 23:34:44,258 INFO L226 Difference]: Without dead ends: 229 [2025-03-03 23:34:44,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:34:44,260 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 49 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:34:44,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 822 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:34:44,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-03-03 23:34:44,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 165. [2025-03-03 23:34:44,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 147 states have (on average 1.2993197278911566) internal successors, (191), 147 states have internal predecessors, (191), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:34:44,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 223 transitions. [2025-03-03 23:34:44,266 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 223 transitions. Word has length 119 [2025-03-03 23:34:44,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:34:44,266 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 223 transitions. [2025-03-03 23:34:44,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:44,267 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 223 transitions. [2025-03-03 23:34:44,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 23:34:44,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:34:44,270 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:34:44,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 23:34:44,270 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:34:44,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:34:44,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1044213092, now seen corresponding path program 1 times [2025-03-03 23:34:44,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:34:44,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574573970] [2025-03-03 23:34:44,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:34:44,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:34:44,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 23:34:44,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 23:34:44,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:34:44,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:34:44,321 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-03 23:34:44,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:34:44,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574573970] [2025-03-03 23:34:44,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574573970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:34:44,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:34:44,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:34:44,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714950622] [2025-03-03 23:34:44,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:34:44,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:34:44,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:34:44,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:34:44,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:34:44,323 INFO L87 Difference]: Start difference. First operand 165 states and 223 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:44,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:34:44,350 INFO L93 Difference]: Finished difference Result 402 states and 547 transitions. [2025-03-03 23:34:44,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:34:44,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2025-03-03 23:34:44,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:34:44,352 INFO L225 Difference]: With dead ends: 402 [2025-03-03 23:34:44,352 INFO L226 Difference]: Without dead ends: 240 [2025-03-03 23:34:44,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:34:44,353 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 81 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:34:44,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 190 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:34:44,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-03 23:34:44,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 173. [2025-03-03 23:34:44,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 155 states have (on average 1.2838709677419355) internal successors, (199), 155 states have internal predecessors, (199), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:34:44,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 231 transitions. [2025-03-03 23:34:44,361 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 231 transitions. Word has length 119 [2025-03-03 23:34:44,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:34:44,362 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 231 transitions. [2025-03-03 23:34:44,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:44,362 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 231 transitions. [2025-03-03 23:34:44,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 23:34:44,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:34:44,363 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:34:44,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 23:34:44,363 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:34:44,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:34:44,363 INFO L85 PathProgramCache]: Analyzing trace with hash -14511134, now seen corresponding path program 1 times [2025-03-03 23:34:44,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:34:44,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488388569] [2025-03-03 23:34:44,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:34:44,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:34:44,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 23:34:44,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 23:34:44,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:34:44,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:34:44,615 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-03 23:34:44,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:34:44,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488388569] [2025-03-03 23:34:44,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488388569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:34:44,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:34:44,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 23:34:44,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502168426] [2025-03-03 23:34:44,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:34:44,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 23:34:44,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:34:44,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 23:34:44,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:34:44,617 INFO L87 Difference]: Start difference. First operand 173 states and 231 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:44,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:34:44,783 INFO L93 Difference]: Finished difference Result 395 states and 517 transitions. [2025-03-03 23:34:44,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:34:44,784 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 120 [2025-03-03 23:34:44,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:34:44,785 INFO L225 Difference]: With dead ends: 395 [2025-03-03 23:34:44,785 INFO L226 Difference]: Without dead ends: 225 [2025-03-03 23:34:44,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:34:44,803 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 64 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:34:44,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 666 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:34:44,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-03 23:34:44,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 161. [2025-03-03 23:34:44,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 143 states have (on average 1.2937062937062938) internal successors, (185), 143 states have internal predecessors, (185), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:34:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 217 transitions. [2025-03-03 23:34:44,807 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 217 transitions. Word has length 120 [2025-03-03 23:34:44,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:34:44,807 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 217 transitions. [2025-03-03 23:34:44,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:44,808 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 217 transitions. [2025-03-03 23:34:44,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 23:34:44,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:34:44,808 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:34:44,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 23:34:44,809 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:34:44,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:34:44,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1077379550, now seen corresponding path program 1 times [2025-03-03 23:34:44,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:34:44,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978860588] [2025-03-03 23:34:44,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:34:44,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:34:44,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 23:34:44,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 23:34:44,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:34:44,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:34:44,994 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-03 23:34:44,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:34:44,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978860588] [2025-03-03 23:34:44,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978860588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:34:44,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:34:44,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:34:44,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628359473] [2025-03-03 23:34:44,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:34:44,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:34:44,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:34:44,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:34:44,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:34:44,996 INFO L87 Difference]: Start difference. First operand 161 states and 217 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:45,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:34:45,108 INFO L93 Difference]: Finished difference Result 478 states and 646 transitions. [2025-03-03 23:34:45,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:34:45,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 120 [2025-03-03 23:34:45,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:34:45,111 INFO L225 Difference]: With dead ends: 478 [2025-03-03 23:34:45,111 INFO L226 Difference]: Without dead ends: 320 [2025-03-03 23:34:45,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:34:45,111 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 89 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:34:45,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 309 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:34:45,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-03 23:34:45,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 195. [2025-03-03 23:34:45,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 160 states have (on average 1.2625) internal successors, (202), 160 states have internal predecessors, (202), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 23:34:45,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 266 transitions. [2025-03-03 23:34:45,121 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 266 transitions. Word has length 120 [2025-03-03 23:34:45,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:34:45,121 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 266 transitions. [2025-03-03 23:34:45,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:34:45,122 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 266 transitions. [2025-03-03 23:34:45,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 23:34:45,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:34:45,122 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:34:45,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 23:34:45,123 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:34:45,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:34:45,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1144386303, now seen corresponding path program 1 times [2025-03-03 23:34:45,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:34:45,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281462680] [2025-03-03 23:34:45,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:34:45,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:34:45,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 23:34:45,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 23:34:45,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:34:45,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:34:45,162 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:34:45,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 23:34:45,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 23:34:45,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:34:45,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:34:45,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:34:45,233 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:34:45,234 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:34:45,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 23:34:45,238 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:34:45,319 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:34:45,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:34:45 BoogieIcfgContainer [2025-03-03 23:34:45,322 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:34:45,323 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:34:45,323 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:34:45,323 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:34:45,324 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:34:37" (3/4) ... [2025-03-03 23:34:45,326 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:34:45,327 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:34:45,328 INFO L158 Benchmark]: Toolchain (without parser) took 9030.69ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 106.5MB in the beginning and 128.0MB in the end (delta: -21.4MB). Peak memory consumption was 179.4MB. Max. memory is 16.1GB. [2025-03-03 23:34:45,328 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:34:45,328 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.22ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 92.2MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:34:45,328 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.29ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 88.4MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:34:45,329 INFO L158 Benchmark]: Boogie Preprocessor took 65.97ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 84.8MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:34:45,329 INFO L158 Benchmark]: IcfgBuilder took 465.22ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 60.4MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 23:34:45,329 INFO L158 Benchmark]: TraceAbstraction took 8174.82ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 59.6MB in the beginning and 128.1MB in the end (delta: -68.5MB). Peak memory consumption was 137.4MB. Max. memory is 16.1GB. [2025-03-03 23:34:45,329 INFO L158 Benchmark]: Witness Printer took 4.10ms. Allocated memory is still 343.9MB. Free memory was 128.1MB in the beginning and 128.0MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:34:45,330 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.29ms. Allocated memory is still 201.3MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.22ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 92.2MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.29ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 88.4MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 65.97ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 84.8MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 465.22ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 60.4MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8174.82ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 59.6MB in the beginning and 128.1MB in the end (delta: -68.5MB). Peak memory consumption was 137.4MB. Max. memory is 16.1GB. * Witness Printer took 4.10ms. Allocated memory is still 343.9MB. Free memory was 128.1MB in the beginning and 128.0MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 124, overapproximation of shiftRight at line 64, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] signed long int last_1_var_1_1 = 64; [L44] unsigned char last_1_var_1_13 = 64; VAL [isInitial=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L128] isInitial = 1 [L129] FCALL initially() [L130] int k_loop; [L131] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L131] COND TRUE k_loop < 1 [L132] CALL updateLastVariables() [L120] last_1_var_1_1 = var_1_1 [L121] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L132] RET updateLastVariables() [L133] CALL updateVariables() [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L92] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L93] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L93] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L94] var_1_15 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L95] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L97] var_1_16 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L98] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L100] var_1_18 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L101] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L102] var_1_19 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L103] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L104] var_1_20 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L105] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L106] var_1_21 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L107] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L108] var_1_22 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L109] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L110] var_1_23 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L111] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L112] var_1_27 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L113] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L115] var_1_28 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L116] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L133] RET updateVariables() [L134] CALL step() [L48] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L49] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L52] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L53] COND FALSE !(\read(var_1_7)) [L56] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L58] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L61] var_1_32 = var_1_16 [L62] var_1_30 = var_1_32 [L63] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L64] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L64] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L65] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L67] COND TRUE var_1_11 >= var_1_30 [L68] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L70] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L70] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L71] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=66, var_1_22=505, var_1_24=10, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L79] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=66, var_1_22=505, var_1_24=10, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L80] COND TRUE ! var_1_7 [L81] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=66, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L134] RET step() [L135] CALL, EXPR property() [L124] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=66, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=66, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=66, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=66, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124-L125] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L135] RET, EXPR property() [L135] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=66, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=66, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 17, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1821 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1821 mSDsluCounter, 7028 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5003 mSDsCounter, 404 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2532 IncrementalHoareTripleChecker+Invalid, 2936 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 404 mSolverCounterUnsat, 2025 mSDtfsCounter, 2532 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=195occurred in iteration=16, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 1200 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2128 NumberOfCodeBlocks, 2128 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1991 ConstructedInterpolants, 0 QuantifiedInterpolants, 4250 SizeOfPredicates, 0 NumberOfNonLiveVariables, 295 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 8130/8160 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 23:34:45,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 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_loopvsstraightlinecode_50-1loop_file-63.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 8f8bcfdb6015d440e6a1a4eaadd74459c55c3a05418feb55db2c008576c462ad --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:34:47,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:34:47,272 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:34:47,280 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:34:47,281 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:34:47,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:34:47,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:34:47,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:34:47,299 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:34:47,299 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:34:47,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:34:47,300 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:34:47,300 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:34:47,300 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:34:47,300 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:34:47,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:34:47,300 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:34:47,300 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:34:47,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:34:47,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:34:47,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:34:47,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:34:47,302 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:34:47,302 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:34:47,302 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:34:47,302 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:34:47,302 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:34:47,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:34:47,302 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:34:47,303 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:34:47,303 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:34:47,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:34:47,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:34:47,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:34:47,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:34:47,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:34:47,304 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:34:47,304 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:34:47,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:34:47,304 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:34:47,304 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:34:47,304 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:34:47,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:34:47,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:34:47,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:34:47,304 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 -> 8f8bcfdb6015d440e6a1a4eaadd74459c55c3a05418feb55db2c008576c462ad [2025-03-03 23:34:47,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:34:47,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:34:47,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:34:47,547 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:34:47,547 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:34:47,548 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i [2025-03-03 23:34:48,754 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/692060d21/87f9e47e2ee64840adb368d7d754b5be/FLAG92444b679 [2025-03-03 23:34:48,912 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:34:48,916 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i [2025-03-03 23:34:48,922 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/692060d21/87f9e47e2ee64840adb368d7d754b5be/FLAG92444b679 [2025-03-03 23:34:49,303 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/692060d21/87f9e47e2ee64840adb368d7d754b5be [2025-03-03 23:34:49,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:34:49,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:34:49,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:34:49,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:34:49,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:34:49,309 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:34:49" (1/1) ... [2025-03-03 23:34:49,310 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184066a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:49, skipping insertion in model container [2025-03-03 23:34:49,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:34:49" (1/1) ... [2025-03-03 23:34:49,329 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:34:49,423 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_loopvsstraightlinecode_50-1loop_file-63.i[915,928] [2025-03-03 23:34:49,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:34:49,470 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:34:49,477 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_loopvsstraightlinecode_50-1loop_file-63.i[915,928] [2025-03-03 23:34:49,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:34:49,506 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:34:49,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:49 WrapperNode [2025-03-03 23:34:49,507 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:34:49,508 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:34:49,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:34:49,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:34:49,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:49" (1/1) ... [2025-03-03 23:34:49,518 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:49" (1/1) ... [2025-03-03 23:34:49,534 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2025-03-03 23:34:49,534 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:34:49,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:34:49,535 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:34:49,535 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:34:49,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:49" (1/1) ... [2025-03-03 23:34:49,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:49" (1/1) ... [2025-03-03 23:34:49,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:49" (1/1) ... [2025-03-03 23:34:49,559 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:34:49,559 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:49" (1/1) ... [2025-03-03 23:34:49,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:49" (1/1) ... [2025-03-03 23:34:49,572 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:49" (1/1) ... [2025-03-03 23:34:49,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:49" (1/1) ... [2025-03-03 23:34:49,574 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:49" (1/1) ... [2025-03-03 23:34:49,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:49" (1/1) ... [2025-03-03 23:34:49,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:34:49,585 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:34:49,585 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:34:49,585 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:34:49,586 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:49" (1/1) ... [2025-03-03 23:34:49,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:34:49,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:34:49,614 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:34:49,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:34:49,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:34:49,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:34:49,635 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:34:49,635 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:34:49,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:34:49,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:34:49,693 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:34:49,695 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:34:57,980 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-03 23:34:57,980 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:34:57,989 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:34:57,990 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:34:57,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:34:57 BoogieIcfgContainer [2025-03-03 23:34:57,990 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:34:58,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:34:58,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:34:58,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:34:58,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:34:49" (1/3) ... [2025-03-03 23:34:58,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b649e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:34:58, skipping insertion in model container [2025-03-03 23:34:58,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:49" (2/3) ... [2025-03-03 23:34:58,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b649e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:34:58, skipping insertion in model container [2025-03-03 23:34:58,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:34:57" (3/3) ... [2025-03-03 23:34:58,013 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-63.i [2025-03-03 23:34:58,023 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:34:58,024 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-63.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:34:58,060 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:34:58,067 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;@7631638, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:34:58,067 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:34:58,070 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:34:58,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 23:34:58,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:34:58,076 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:34:58,077 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:34:58,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:34:58,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1281553777, now seen corresponding path program 1 times [2025-03-03 23:34:58,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:34:58,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105591261] [2025-03-03 23:34:58,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:34:58,087 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:34:58,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:34:58,089 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:34:58,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 23:34:58,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 23:34:58,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 23:34:58,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:34:58,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:34:58,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:34:58,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:34:58,440 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-03-03 23:34:58,441 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:34:58,441 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:34:58,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105591261] [2025-03-03 23:34:58,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105591261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:34:58,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:34:58,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:34:58,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141731848] [2025-03-03 23:34:58,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:34:58,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:34:58,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:34:58,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:34:58,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:34:58,459 INFO L87 Difference]: Start difference. First operand has 57 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 23:34:58,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:34:58,473 INFO L93 Difference]: Finished difference Result 111 states and 179 transitions. [2025-03-03 23:34:58,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:34:58,475 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 110 [2025-03-03 23:34:58,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:34:58,479 INFO L225 Difference]: With dead ends: 111 [2025-03-03 23:34:58,479 INFO L226 Difference]: Without dead ends: 54 [2025-03-03 23:34:58,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:34:58,482 INFO L435 NwaCegarLoop]: 81 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, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:34:58,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:34:58,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-03 23:34:58,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-03 23:34:58,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:34:58,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2025-03-03 23:34:58,515 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 110 [2025-03-03 23:34:58,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:34:58,515 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2025-03-03 23:34:58,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 23:34:58,516 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2025-03-03 23:34:58,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 23:34:58,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:34:58,517 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:34:58,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-03 23:34:58,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:34:58,718 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:34:58,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:34:58,719 INFO L85 PathProgramCache]: Analyzing trace with hash -553218741, now seen corresponding path program 1 times [2025-03-03 23:34:58,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:34:58,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880442172] [2025-03-03 23:34:58,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:34:58,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:34:58,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:34:58,722 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:34:58,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 23:34:58,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 23:34:59,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 23:34:59,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:34:59,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:34:59,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 23:34:59,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:34:59,116 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-03 23:34:59,116 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:34:59,116 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:34:59,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880442172] [2025-03-03 23:34:59,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880442172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:34:59,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:34:59,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:34:59,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364951580] [2025-03-03 23:34:59,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:34:59,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:34:59,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:34:59,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:34:59,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:34:59,120 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:35:01,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:35:01,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:35:01,706 INFO L93 Difference]: Finished difference Result 121 states and 175 transitions. [2025-03-03 23:35:01,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:35:01,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2025-03-03 23:35:01,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:35:01,708 INFO L225 Difference]: With dead ends: 121 [2025-03-03 23:35:01,708 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 23:35:01,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:35:01,709 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 14 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 23:35:01,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 145 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 23:35:01,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 23:35:01,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2025-03-03 23:35:01,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:35:01,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 89 transitions. [2025-03-03 23:35:01,717 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 89 transitions. Word has length 110 [2025-03-03 23:35:01,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:35:01,718 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 89 transitions. [2025-03-03 23:35:01,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:35:01,718 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 89 transitions. [2025-03-03 23:35:01,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 23:35:01,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:35:01,719 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:35:01,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 23:35:01,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:35:01,919 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:35:01,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:35:01,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2073879915, now seen corresponding path program 1 times [2025-03-03 23:35:01,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:35:01,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914616910] [2025-03-03 23:35:01,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:35:01,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:35:01,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:35:01,923 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:35:01,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 23:35:01,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 23:35:02,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 23:35:02,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:35:02,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:35:02,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 23:35:02,228 INFO L279 TraceCheckSpWp]: Computing forward predicates...