./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_codestructure_normal_file-9.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 e812dc698b4655d38d198bd0d019421c12f3fcceff72c56e7a8be5775cf6eb49 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:07:28,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:07:28,231 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:07:28,236 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:07:28,236 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:07:28,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:07:28,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:07:28,264 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:07:28,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:07:28,265 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:07:28,265 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:07:28,266 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:07:28,266 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:07:28,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:07:28,266 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:07:28,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:07:28,266 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:07:28,267 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:07:28,267 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:07:28,267 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:07:28,267 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:07:28,267 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:07:28,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:07:28,267 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:07:28,267 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:07:28,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:07:28,268 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:07:28,268 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:07:28,268 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:07:28,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:07:28,268 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:07:28,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:07:28,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:07:28,268 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:07:28,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:07:28,269 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:07:28,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:07:28,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:07:28,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:07:28,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:07:28,269 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:07:28,269 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:07:28,269 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:07:28,269 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 -> e812dc698b4655d38d198bd0d019421c12f3fcceff72c56e7a8be5775cf6eb49 [2025-03-08 10:07:28,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:07:28,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:07:28,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:07:28,477 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:07:28,477 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:07:28,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-9.i [2025-03-08 10:07:29,601 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5884f3c6/75a30c7637b84f2da641e8cadf3a71c3/FLAG71fb5733c [2025-03-08 10:07:29,834 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:07:29,837 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-9.i [2025-03-08 10:07:29,847 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5884f3c6/75a30c7637b84f2da641e8cadf3a71c3/FLAG71fb5733c [2025-03-08 10:07:30,187 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5884f3c6/75a30c7637b84f2da641e8cadf3a71c3 [2025-03-08 10:07:30,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:07:30,192 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:07:30,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:07:30,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:07:30,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:07:30,198 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:07:30" (1/1) ... [2025-03-08 10:07:30,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@642e99a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:30, skipping insertion in model container [2025-03-08 10:07:30,199 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:07:30" (1/1) ... [2025-03-08 10:07:30,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:07:30,320 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_codestructure_normal_file-9.i[912,925] [2025-03-08 10:07:30,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:07:30,381 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:07:30,391 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_codestructure_normal_file-9.i[912,925] [2025-03-08 10:07:30,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:07:30,435 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:07:30,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:30 WrapperNode [2025-03-08 10:07:30,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:07:30,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:07:30,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:07:30,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:07:30,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:30" (1/1) ... [2025-03-08 10:07:30,452 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:30" (1/1) ... [2025-03-08 10:07:30,487 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-03-08 10:07:30,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:07:30,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:07:30,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:07:30,492 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:07:30,498 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:30" (1/1) ... [2025-03-08 10:07:30,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:30" (1/1) ... [2025-03-08 10:07:30,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:30" (1/1) ... [2025-03-08 10:07:30,526 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-08 10:07:30,526 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:30" (1/1) ... [2025-03-08 10:07:30,526 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:30" (1/1) ... [2025-03-08 10:07:30,531 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:30" (1/1) ... [2025-03-08 10:07:30,537 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:30" (1/1) ... [2025-03-08 10:07:30,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:30" (1/1) ... [2025-03-08 10:07:30,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:30" (1/1) ... [2025-03-08 10:07:30,543 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:07:30,544 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:07:30,544 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:07:30,544 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:07:30,546 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:30" (1/1) ... [2025-03-08 10:07:30,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:07:30,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:07:30,573 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-08 10:07:30,576 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-08 10:07:30,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:07:30,593 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:07:30,593 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:07:30,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:07:30,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:07:30,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:07:30,643 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:07:30,644 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:07:30,948 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L120: havoc property_#t~bitwise18#1;havoc property_#t~ite20#1;havoc property_#t~bitwise19#1;havoc property_#t~bitwise21#1;havoc property_#t~short22#1; [2025-03-08 10:07:30,979 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 10:07:30,979 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:07:30,995 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:07:30,996 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:07:30,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:07:30 BoogieIcfgContainer [2025-03-08 10:07:30,996 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:07:30,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:07:30,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:07:31,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:07:31,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:07:30" (1/3) ... [2025-03-08 10:07:31,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420fe614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:07:31, skipping insertion in model container [2025-03-08 10:07:31,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:30" (2/3) ... [2025-03-08 10:07:31,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420fe614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:07:31, skipping insertion in model container [2025-03-08 10:07:31,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:07:30" (3/3) ... [2025-03-08 10:07:31,003 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-9.i [2025-03-08 10:07:31,013 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:07:31,015 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-9.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:07:31,055 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:07:31,063 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;@70de0e24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:07:31,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:07:31,066 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 55 states have (on average 1.4) internal successors, (77), 56 states have internal predecessors, (77), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 10:07:31,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 10:07:31,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:31,074 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:07:31,075 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:31,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:31,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1508786122, now seen corresponding path program 1 times [2025-03-08 10:07:31,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:07:31,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836325738] [2025-03-08 10:07:31,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:31,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:07:31,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 10:07:31,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 10:07:31,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:31,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:31,312 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-08 10:07:31,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:07:31,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836325738] [2025-03-08 10:07:31,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836325738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:07:31,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003034983] [2025-03-08 10:07:31,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:31,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:07:31,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:07:31,318 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-08 10:07:31,319 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-08 10:07:31,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 10:07:31,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 10:07:31,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:31,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:31,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:07:31,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:07:31,515 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-08 10:07:31,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:07:31,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003034983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:07:31,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:07:31,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:07:31,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569565187] [2025-03-08 10:07:31,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:07:31,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:07:31,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:07:31,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:07:31,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:07:31,535 INFO L87 Difference]: Start difference. First operand has 79 states, 55 states have (on average 1.4) internal successors, (77), 56 states have internal predecessors, (77), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 10:07:31,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:07:31,564 INFO L93 Difference]: Finished difference Result 152 states and 254 transitions. [2025-03-08 10:07:31,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:07:31,566 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 138 [2025-03-08 10:07:31,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:07:31,570 INFO L225 Difference]: With dead ends: 152 [2025-03-08 10:07:31,570 INFO L226 Difference]: Without dead ends: 76 [2025-03-08 10:07:31,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 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-08 10:07:31,574 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:07:31,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:07:31,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-08 10:07:31,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-08 10:07:31,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 10:07:31,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2025-03-08 10:07:31,602 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 138 [2025-03-08 10:07:31,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:07:31,602 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2025-03-08 10:07:31,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 10:07:31,603 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2025-03-08 10:07:31,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 10:07:31,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:31,608 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:07:31,615 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-08 10:07:31,808 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-08 10:07:31,809 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:31,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:31,810 INFO L85 PathProgramCache]: Analyzing trace with hash 569207219, now seen corresponding path program 1 times [2025-03-08 10:07:31,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:07:31,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461172435] [2025-03-08 10:07:31,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:31,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:07:31,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 10:07:31,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 10:07:31,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:31,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:32,028 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-08 10:07:32,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:07:32,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461172435] [2025-03-08 10:07:32,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461172435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:07:32,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:07:32,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:07:32,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647320383] [2025-03-08 10:07:32,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:07:32,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:07:32,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:07:32,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:07:32,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:07:32,030 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 10:07:32,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:07:32,057 INFO L93 Difference]: Finished difference Result 150 states and 227 transitions. [2025-03-08 10:07:32,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:07:32,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 138 [2025-03-08 10:07:32,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:07:32,059 INFO L225 Difference]: With dead ends: 150 [2025-03-08 10:07:32,059 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 10:07:32,061 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-08 10:07:32,061 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:07:32,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 210 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:07:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 10:07:32,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-08 10:07:32,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 10:07:32,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2025-03-08 10:07:32,074 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 115 transitions. Word has length 138 [2025-03-08 10:07:32,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:07:32,075 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 115 transitions. [2025-03-08 10:07:32,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 10:07:32,078 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 115 transitions. [2025-03-08 10:07:32,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 10:07:32,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:32,081 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:07:32,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:07:32,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:32,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:32,082 INFO L85 PathProgramCache]: Analyzing trace with hash 577486566, now seen corresponding path program 1 times [2025-03-08 10:07:32,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:07:32,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107299097] [2025-03-08 10:07:32,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:32,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:07:32,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 10:07:32,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 10:07:32,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:32,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:33,571 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-08 10:07:33,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:07:33,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107299097] [2025-03-08 10:07:33,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107299097] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:07:33,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255312159] [2025-03-08 10:07:33,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:33,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:07:33,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:07:33,574 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:07:33,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 10:07:33,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 10:07:33,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 10:07:33,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:33,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:33,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 10:07:33,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:07:33,937 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-08 10:07:33,937 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:07:33,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255312159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:07:33,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:07:33,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2025-03-08 10:07:33,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852010397] [2025-03-08 10:07:33,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:07:33,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 10:07:33,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:07:33,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 10:07:33,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-08 10:07:33,938 INFO L87 Difference]: Start difference. First operand 77 states and 115 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 10:07:34,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:07:34,187 INFO L93 Difference]: Finished difference Result 234 states and 342 transitions. [2025-03-08 10:07:34,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 10:07:34,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 139 [2025-03-08 10:07:34,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:07:34,192 INFO L225 Difference]: With dead ends: 234 [2025-03-08 10:07:34,192 INFO L226 Difference]: Without dead ends: 160 [2025-03-08 10:07:34,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-08 10:07:34,195 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 101 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:07:34,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 421 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:07:34,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-08 10:07:34,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 131. [2025-03-08 10:07:34,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 103 states have (on average 1.4077669902912622) internal successors, (145), 104 states have internal predecessors, (145), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 10:07:34,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 195 transitions. [2025-03-08 10:07:34,210 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 195 transitions. Word has length 139 [2025-03-08 10:07:34,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:07:34,211 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 195 transitions. [2025-03-08 10:07:34,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 10:07:34,211 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 195 transitions. [2025-03-08 10:07:34,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 10:07:34,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:34,212 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:07:34,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 10:07:34,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 10:07:34,413 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:34,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:34,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2085038375, now seen corresponding path program 1 times [2025-03-08 10:07:34,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:07:34,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469621397] [2025-03-08 10:07:34,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:34,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:07:34,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 10:07:34,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 10:07:34,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:34,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:34,997 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-08 10:07:34,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:07:34,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469621397] [2025-03-08 10:07:34,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469621397] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:07:34,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943152766] [2025-03-08 10:07:34,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:34,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:07:34,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:07:35,000 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:07:35,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 10:07:35,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 10:07:35,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 10:07:35,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:35,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:35,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 10:07:35,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:07:35,401 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-08 10:07:35,402 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:07:35,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943152766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:07:35,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:07:35,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2025-03-08 10:07:35,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073358349] [2025-03-08 10:07:35,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:07:35,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 10:07:35,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:07:35,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 10:07:35,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:07:35,403 INFO L87 Difference]: Start difference. First operand 131 states and 195 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 10:07:35,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:07:35,703 INFO L93 Difference]: Finished difference Result 290 states and 424 transitions. [2025-03-08 10:07:35,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 10:07:35,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 139 [2025-03-08 10:07:35,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:07:35,706 INFO L225 Difference]: With dead ends: 290 [2025-03-08 10:07:35,707 INFO L226 Difference]: Without dead ends: 162 [2025-03-08 10:07:35,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 140 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-08 10:07:35,709 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 101 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:07:35,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 464 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:07:35,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-08 10:07:35,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 117. [2025-03-08 10:07:35,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 89 states have (on average 1.3707865168539326) internal successors, (122), 90 states have internal predecessors, (122), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 10:07:35,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 172 transitions. [2025-03-08 10:07:35,723 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 172 transitions. Word has length 139 [2025-03-08 10:07:35,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:07:35,724 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 172 transitions. [2025-03-08 10:07:35,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 10:07:35,724 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 172 transitions. [2025-03-08 10:07:35,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 10:07:35,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:35,725 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:07:35,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 10:07:35,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:07:35,926 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:35,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:35,927 INFO L85 PathProgramCache]: Analyzing trace with hash 66952389, now seen corresponding path program 1 times [2025-03-08 10:07:35,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:07:35,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675200992] [2025-03-08 10:07:35,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:35,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:07:35,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 10:07:35,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 10:07:35,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:35,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:37,478 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-08 10:07:37,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:07:37,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675200992] [2025-03-08 10:07:37,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675200992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:07:37,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927215233] [2025-03-08 10:07:37,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:37,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:07:37,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:07:37,483 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:07:37,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 10:07:37,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 10:07:37,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 10:07:37,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:37,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:37,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 10:07:37,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:07:37,813 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-08 10:07:37,813 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:07:37,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927215233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:07:37,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:07:37,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 18 [2025-03-08 10:07:37,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945698452] [2025-03-08 10:07:37,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:07:37,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 10:07:37,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:07:37,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 10:07:37,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-08 10:07:37,815 INFO L87 Difference]: Start difference. First operand 117 states and 172 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 10:07:38,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:07:38,118 INFO L93 Difference]: Finished difference Result 380 states and 554 transitions. [2025-03-08 10:07:38,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 10:07:38,122 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 139 [2025-03-08 10:07:38,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:07:38,124 INFO L225 Difference]: With dead ends: 380 [2025-03-08 10:07:38,124 INFO L226 Difference]: Without dead ends: 266 [2025-03-08 10:07:38,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-03-08 10:07:38,125 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 183 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:07:38,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 473 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:07:38,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-08 10:07:38,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 194. [2025-03-08 10:07:38,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 163 states have (on average 1.4417177914110428) internal successors, (235), 165 states have internal predecessors, (235), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 10:07:38,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2025-03-08 10:07:38,147 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 139 [2025-03-08 10:07:38,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:07:38,147 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 289 transitions. [2025-03-08 10:07:38,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 10:07:38,147 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2025-03-08 10:07:38,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 10:07:38,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:38,148 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:07:38,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 10:07:38,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:07:38,349 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:38,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:38,350 INFO L85 PathProgramCache]: Analyzing trace with hash -2062639519, now seen corresponding path program 1 times [2025-03-08 10:07:38,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:07:38,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702551385] [2025-03-08 10:07:38,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:38,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:07:38,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 10:07:38,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 10:07:38,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:38,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:39,042 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-08 10:07:39,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:07:39,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702551385] [2025-03-08 10:07:39,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702551385] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:07:39,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95991670] [2025-03-08 10:07:39,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:39,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:07:39,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:07:39,045 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:07:39,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 10:07:39,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 10:07:39,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 10:07:39,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:39,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:39,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 10:07:39,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:07:39,323 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 456 proven. 54 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-08 10:07:39,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:07:39,532 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-08 10:07:39,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95991670] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:07:39,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:07:39,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 16 [2025-03-08 10:07:39,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061768003] [2025-03-08 10:07:39,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:07:39,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 10:07:39,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:07:39,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 10:07:39,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-03-08 10:07:39,534 INFO L87 Difference]: Start difference. First operand 194 states and 289 transitions. Second operand has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 states have internal predecessors, (93), 5 states have call successors, (57), 3 states have call predecessors, (57), 5 states have return successors, (59), 5 states have call predecessors, (59), 5 states have call successors, (59) [2025-03-08 10:07:40,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:07:40,605 INFO L93 Difference]: Finished difference Result 463 states and 669 transitions. [2025-03-08 10:07:40,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 10:07:40,606 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 states have internal predecessors, (93), 5 states have call successors, (57), 3 states have call predecessors, (57), 5 states have return successors, (59), 5 states have call predecessors, (59), 5 states have call successors, (59) Word has length 139 [2025-03-08 10:07:40,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:07:40,607 INFO L225 Difference]: With dead ends: 463 [2025-03-08 10:07:40,608 INFO L226 Difference]: Without dead ends: 272 [2025-03-08 10:07:40,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=198, Invalid=614, Unknown=0, NotChecked=0, Total=812 [2025-03-08 10:07:40,610 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 142 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 10:07:40,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 622 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 10:07:40,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-08 10:07:40,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 212. [2025-03-08 10:07:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 177 states have (on average 1.4011299435028248) internal successors, (248), 179 states have internal predecessors, (248), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 10:07:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 302 transitions. [2025-03-08 10:07:40,633 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 302 transitions. Word has length 139 [2025-03-08 10:07:40,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:07:40,633 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 302 transitions. [2025-03-08 10:07:40,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 states have internal predecessors, (93), 5 states have call successors, (57), 3 states have call predecessors, (57), 5 states have return successors, (59), 5 states have call predecessors, (59), 5 states have call successors, (59) [2025-03-08 10:07:40,634 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 302 transitions. [2025-03-08 10:07:40,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 10:07:40,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:40,635 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:07:40,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 10:07:40,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:07:40,840 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:40,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:40,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1574504198, now seen corresponding path program 1 times [2025-03-08 10:07:40,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:07:40,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221816236] [2025-03-08 10:07:40,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:40,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:07:40,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 10:07:40,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 10:07:40,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:40,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:41,292 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-08 10:07:41,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:07:41,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221816236] [2025-03-08 10:07:41,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221816236] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:07:41,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660403073] [2025-03-08 10:07:41,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:41,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:07:41,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:07:41,296 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:07:41,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 10:07:41,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 10:07:41,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 10:07:41,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:41,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:41,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 10:07:41,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:07:41,566 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-08 10:07:41,566 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:07:41,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660403073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:07:41,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:07:41,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2025-03-08 10:07:41,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984163254] [2025-03-08 10:07:41,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:07:41,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 10:07:41,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:07:41,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 10:07:41,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-08 10:07:41,568 INFO L87 Difference]: Start difference. First operand 212 states and 302 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 10:07:41,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:07:41,853 INFO L93 Difference]: Finished difference Result 533 states and 742 transitions. [2025-03-08 10:07:41,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 10:07:41,855 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 139 [2025-03-08 10:07:41,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:07:41,856 INFO L225 Difference]: With dead ends: 533 [2025-03-08 10:07:41,856 INFO L226 Difference]: Without dead ends: 328 [2025-03-08 10:07:41,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-08 10:07:41,857 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 149 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:07:41,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 542 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:07:41,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-08 10:07:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 215. [2025-03-08 10:07:41,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 180 states have (on average 1.4055555555555554) internal successors, (253), 182 states have internal predecessors, (253), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 10:07:41,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 307 transitions. [2025-03-08 10:07:41,876 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 307 transitions. Word has length 139 [2025-03-08 10:07:41,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:07:41,877 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 307 transitions. [2025-03-08 10:07:41,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 10:07:41,877 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 307 transitions. [2025-03-08 10:07:41,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 10:07:41,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:41,878 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:07:41,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 10:07:42,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:07:42,079 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:42,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:42,079 INFO L85 PathProgramCache]: Analyzing trace with hash -426004991, now seen corresponding path program 1 times [2025-03-08 10:07:42,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:07:42,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950630955] [2025-03-08 10:07:42,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:42,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:07:42,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 10:07:42,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 10:07:42,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:42,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:42,540 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-08 10:07:42,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:07:42,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950630955] [2025-03-08 10:07:42,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950630955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:07:42,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090291285] [2025-03-08 10:07:42,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:42,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:07:42,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:07:42,543 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:07:42,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 10:07:42,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 10:07:42,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 10:07:42,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:42,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:42,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 10:07:42,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:07:43,482 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 493 proven. 138 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-03-08 10:07:43,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:07:43,732 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-08 10:07:43,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090291285] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 10:07:43,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 10:07:43,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 18] total 25 [2025-03-08 10:07:43,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571461337] [2025-03-08 10:07:43,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:07:43,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 10:07:43,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:07:43,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 10:07:43,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2025-03-08 10:07:43,734 INFO L87 Difference]: Start difference. First operand 215 states and 307 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 10:07:43,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:07:43,982 INFO L93 Difference]: Finished difference Result 516 states and 726 transitions. [2025-03-08 10:07:43,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 10:07:43,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 139 [2025-03-08 10:07:43,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:07:43,984 INFO L225 Difference]: With dead ends: 516 [2025-03-08 10:07:43,984 INFO L226 Difference]: Without dead ends: 308 [2025-03-08 10:07:43,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2025-03-08 10:07:43,985 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 90 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:07:43,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 339 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:07:43,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-08 10:07:43,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 183. [2025-03-08 10:07:43,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 150 states have (on average 1.38) internal successors, (207), 151 states have internal predecessors, (207), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 10:07:43,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 257 transitions. [2025-03-08 10:07:44,000 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 257 transitions. Word has length 139 [2025-03-08 10:07:44,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:07:44,000 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 257 transitions. [2025-03-08 10:07:44,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 10:07:44,000 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 257 transitions. [2025-03-08 10:07:44,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 10:07:44,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:44,001 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:07:44,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 10:07:44,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:07:44,202 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:44,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:44,203 INFO L85 PathProgramCache]: Analyzing trace with hash 87409508, now seen corresponding path program 1 times [2025-03-08 10:07:44,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:07:44,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513663216] [2025-03-08 10:07:44,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:44,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:07:44,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 10:07:44,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 10:07:44,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:44,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:44,259 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-08 10:07:44,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:07:44,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513663216] [2025-03-08 10:07:44,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513663216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:07:44,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:07:44,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:07:44,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910201397] [2025-03-08 10:07:44,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:07:44,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:07:44,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:07:44,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:07:44,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:07:44,263 INFO L87 Difference]: Start difference. First operand 183 states and 257 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 10:07:44,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:07:44,298 INFO L93 Difference]: Finished difference Result 398 states and 554 transitions. [2025-03-08 10:07:44,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:07:44,299 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 141 [2025-03-08 10:07:44,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:07:44,300 INFO L225 Difference]: With dead ends: 398 [2025-03-08 10:07:44,302 INFO L226 Difference]: Without dead ends: 218 [2025-03-08 10:07:44,303 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-08 10:07:44,303 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 41 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 201 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-08 10:07:44,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 201 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:07:44,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-08 10:07:44,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 202. [2025-03-08 10:07:44,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 169 states have (on average 1.3550295857988166) internal successors, (229), 170 states have internal predecessors, (229), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 10:07:44,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 279 transitions. [2025-03-08 10:07:44,319 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 279 transitions. Word has length 141 [2025-03-08 10:07:44,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:07:44,321 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 279 transitions. [2025-03-08 10:07:44,321 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 10:07:44,321 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 279 transitions. [2025-03-08 10:07:44,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 10:07:44,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:44,322 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:07:44,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 10:07:44,323 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:44,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:44,323 INFO L85 PathProgramCache]: Analyzing trace with hash 310435494, now seen corresponding path program 1 times [2025-03-08 10:07:44,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:07:44,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637751434] [2025-03-08 10:07:44,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:44,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:07:44,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 10:07:44,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 10:07:44,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:44,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:44,891 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-08 10:07:44,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:07:44,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637751434] [2025-03-08 10:07:44,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637751434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:07:44,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:07:44,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:07:44,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654203249] [2025-03-08 10:07:44,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:07:44,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:07:44,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:07:44,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:07:44,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:07:44,893 INFO L87 Difference]: Start difference. First operand 202 states and 279 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 10:07:45,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:07:45,086 INFO L93 Difference]: Finished difference Result 476 states and 658 transitions. [2025-03-08 10:07:45,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:07:45,087 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 141 [2025-03-08 10:07:45,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:07:45,088 INFO L225 Difference]: With dead ends: 476 [2025-03-08 10:07:45,089 INFO L226 Difference]: Without dead ends: 277 [2025-03-08 10:07:45,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:07:45,091 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 29 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:07:45,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 319 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:07:45,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-08 10:07:45,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 247. [2025-03-08 10:07:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 214 states have (on average 1.3785046728971964) internal successors, (295), 215 states have internal predecessors, (295), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 10:07:45,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 345 transitions. [2025-03-08 10:07:45,111 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 345 transitions. Word has length 141 [2025-03-08 10:07:45,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:07:45,111 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 345 transitions. [2025-03-08 10:07:45,112 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 10:07:45,112 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 345 transitions. [2025-03-08 10:07:45,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 10:07:45,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:45,116 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:07:45,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 10:07:45,116 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:45,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:45,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1743427487, now seen corresponding path program 1 times [2025-03-08 10:07:45,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:07:45,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704769556] [2025-03-08 10:07:45,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:45,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:07:45,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 10:07:45,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 10:07:45,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:45,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 10:07:45,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [611667792] [2025-03-08 10:07:45,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:45,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:07:45,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:07:45,190 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:07:45,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 10:07:45,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 10:07:45,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 10:07:45,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:45,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:07:45,667 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 10:07:45,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 10:07:45,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 10:07:45,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:45,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:07:45,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 10:07:45,764 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 10:07:45,765 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 10:07:45,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 10:07:45,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 10:07:45,970 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:07:46,043 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 10:07:46,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:07:46 BoogieIcfgContainer [2025-03-08 10:07:46,046 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 10:07:46,047 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 10:07:46,047 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 10:07:46,047 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 10:07:46,047 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:07:30" (3/4) ... [2025-03-08 10:07:46,049 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 10:07:46,049 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 10:07:46,050 INFO L158 Benchmark]: Toolchain (without parser) took 15857.78ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 105.3MB in the beginning and 269.9MB in the end (delta: -164.6MB). Peak memory consumption was 115.9MB. Max. memory is 16.1GB. [2025-03-08 10:07:46,050 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:07:46,051 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.49ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 92.3MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 10:07:46,051 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.34ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 89.3MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 10:07:46,051 INFO L158 Benchmark]: Boogie Preprocessor took 55.27ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 87.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:07:46,051 INFO L158 Benchmark]: IcfgBuilder took 452.60ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 66.1MB in the end (delta: 21.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 10:07:46,052 INFO L158 Benchmark]: TraceAbstraction took 15048.22ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 65.1MB in the beginning and 270.0MB in the end (delta: -204.9MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. [2025-03-08 10:07:46,052 INFO L158 Benchmark]: Witness Printer took 2.67ms. Allocated memory is still 419.4MB. Free memory was 270.0MB in the beginning and 269.9MB in the end (delta: 133.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 10:07:46,053 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.17ms. Allocated memory is still 201.3MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.49ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 92.3MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.34ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 89.3MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.27ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 87.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 452.60ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 66.1MB in the end (delta: 21.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 15048.22ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 65.1MB in the beginning and 270.0MB in the end (delta: -204.9MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. * Witness Printer took 2.67ms. Allocated memory is still 419.4MB. Free memory was 270.0MB in the beginning and 269.9MB in the end (delta: 133.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed char var_1_2 = 100; [L24] signed short int var_1_3 = 1; [L25] signed long int var_1_4 = -16; [L26] signed long int var_1_5 = -64; [L27] signed char var_1_6 = 10; [L28] signed char var_1_7 = 5; [L29] double var_1_8 = 16.25; [L30] double var_1_9 = 1.8; [L31] unsigned char var_1_10 = 32; [L32] unsigned char var_1_11 = 64; [L33] unsigned short int var_1_12 = 16; [L34] unsigned long int var_1_13 = 128; [L35] unsigned char var_1_15 = 1; [L36] unsigned short int var_1_16 = 256; [L37] unsigned short int var_1_17 = 8; [L38] signed char var_1_18 = -2; VAL [isInitial=0, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=100, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] FCALL updateLastVariables() [L128] CALL updateVariables() [L84] var_1_2 = __VERIFIER_nondet_char() [L85] CALL assume_abort_if_not(var_1_2 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L85] RET assume_abort_if_not(var_1_2 >= -128) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L86] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L86] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L87] var_1_3 = __VERIFIER_nondet_short() [L88] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L88] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L89] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L89] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L90] var_1_4 = __VERIFIER_nondet_long() [L91] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L92] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L92] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L93] var_1_5 = __VERIFIER_nondet_long() [L94] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L96] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L96] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L97] var_1_6 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L99] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L99] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L100] var_1_7 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3, var_1_8=65/4, var_1_9=9/5] [L101] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3, var_1_8=65/4, var_1_9=9/5] [L102] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3, var_1_8=65/4, var_1_9=9/5] [L102] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3, var_1_8=65/4, var_1_9=9/5] [L103] var_1_8 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3, var_1_9=9/5] [L104] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3, var_1_9=9/5] [L105] var_1_9 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L106] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L107] var_1_11 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L108] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L109] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L109] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L110] var_1_15 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L111] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L112] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L112] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L113] var_1_17 = __VERIFIER_nondet_ushort() [L114] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L114] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L115] CALL assume_abort_if_not(var_1_17 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L115] RET assume_abort_if_not(var_1_17 <= 65535) VAL [isInitial=1, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L128] RET updateVariables() [L129] CALL step() [L42] EXPR var_1_2 >> var_1_3 VAL [isInitial=1, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L42] COND FALSE !((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) [L49] COND TRUE var_1_6 <= (var_1_4 + var_1_7) [L50] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=254, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L54] COND TRUE ((var_1_6 >> 2) * var_1_10) > var_1_4 [L55] var_1_12 = var_1_6 VAL [isInitial=1, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L57] EXPR 1 << var_1_2 VAL [isInitial=1, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L57] COND TRUE (1 << var_1_2) != (-500 / -100) [L58] COND FALSE !((var_1_6 - var_1_3) >= (var_1_10 + 256)) [L61] var_1_13 = var_1_12 VAL [isInitial=1, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L66] COND FALSE !((- var_1_9) <= var_1_8) [L79] var_1_16 = var_1_10 VAL [isInitial=1, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L81] var_1_18 = var_1_3 VAL [isInitial=1, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR var_1_2 >> var_1_3 VAL [isInitial=1, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L120] EXPR ((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L120] EXPR (((((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (var_1_4 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * var_1_10) > var_1_4) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_2) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_10 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L120] EXPR 1 << var_1_2 VAL [isInitial=1, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L120] EXPR (((((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (var_1_4 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * var_1_10) > var_1_4) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_2) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_10 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L120-L121] return (((((((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (var_1_4 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * var_1_10) > var_1_4) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_2) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_10 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_2) ? ((var_1_17 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_17=0, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] [L19] reach_error() VAL [isInitial=1, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_17=0, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=6, var_1_7=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 140 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.9s, OverallIterations: 11, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 838 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 836 mSDsluCounter, 3699 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2555 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2506 IncrementalHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 1144 mSDtfsCounter, 2506 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1351 GetRequests, 1239 SyntacticMatches, 3 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=10, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 490 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 2646 NumberOfCodeBlocks, 2646 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2623 ConstructedInterpolants, 0 QuantifiedInterpolants, 9960 SizeOfPredicates, 40 NumberOfNonLiveVariables, 2177 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 19 InterpolantComputations, 9 PerfectInterpolantSequences, 15584/15960 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-08 10:07:46,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-9.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 e812dc698b4655d38d198bd0d019421c12f3fcceff72c56e7a8be5775cf6eb49 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:07:47,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:07:47,988 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 10:07:47,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:07:47,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:07:48,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:07:48,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:07:48,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:07:48,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:07:48,021 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:07:48,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:07:48,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:07:48,022 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:07:48,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:07:48,022 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:07:48,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:07:48,023 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:07:48,023 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:07:48,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:07:48,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:07:48,023 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:07:48,023 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:07:48,023 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:07:48,023 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 10:07:48,023 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 10:07:48,024 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 10:07:48,024 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:07:48,024 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:07:48,024 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:07:48,024 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:07:48,024 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:07:48,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:07:48,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:07:48,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:07:48,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:07:48,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:07:48,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:07:48,025 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:07:48,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:07:48,025 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 10:07:48,025 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 10:07:48,026 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:07:48,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:07:48,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:07:48,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:07:48,026 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 -> e812dc698b4655d38d198bd0d019421c12f3fcceff72c56e7a8be5775cf6eb49 [2025-03-08 10:07:48,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:07:48,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:07:48,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:07:48,265 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:07:48,266 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:07:48,268 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-9.i [2025-03-08 10:07:49,379 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71229e358/364c9f457959441a80fdab814e446ed4/FLAG008763d1e [2025-03-08 10:07:49,591 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:07:49,592 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-9.i [2025-03-08 10:07:49,599 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71229e358/364c9f457959441a80fdab814e446ed4/FLAG008763d1e [2025-03-08 10:07:49,955 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71229e358/364c9f457959441a80fdab814e446ed4 [2025-03-08 10:07:49,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:07:49,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:07:49,958 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:07:49,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:07:49,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:07:49,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:07:49" (1/1) ... [2025-03-08 10:07:49,962 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b5b4ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:49, skipping insertion in model container [2025-03-08 10:07:49,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:07:49" (1/1) ... [2025-03-08 10:07:49,974 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:07:50,064 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_codestructure_normal_file-9.i[912,925] [2025-03-08 10:07:50,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:07:50,130 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:07:50,141 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_codestructure_normal_file-9.i[912,925] [2025-03-08 10:07:50,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:07:50,188 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:07:50,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:50 WrapperNode [2025-03-08 10:07:50,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:07:50,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:07:50,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:07:50,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:07:50,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:50" (1/1) ... [2025-03-08 10:07:50,201 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:50" (1/1) ... [2025-03-08 10:07:50,216 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2025-03-08 10:07:50,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:07:50,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:07:50,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:07:50,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:07:50,224 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:50" (1/1) ... [2025-03-08 10:07:50,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:50" (1/1) ... [2025-03-08 10:07:50,227 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:50" (1/1) ... [2025-03-08 10:07:50,235 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-08 10:07:50,235 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:50" (1/1) ... [2025-03-08 10:07:50,236 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:50" (1/1) ... [2025-03-08 10:07:50,240 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:50" (1/1) ... [2025-03-08 10:07:50,241 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:50" (1/1) ... [2025-03-08 10:07:50,242 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:50" (1/1) ... [2025-03-08 10:07:50,243 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:50" (1/1) ... [2025-03-08 10:07:50,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:07:50,245 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:07:50,245 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:07:50,245 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:07:50,246 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:50" (1/1) ... [2025-03-08 10:07:50,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:07:50,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:07:50,269 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-08 10:07:50,272 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-08 10:07:50,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:07:50,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 10:07:50,293 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:07:50,293 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:07:50,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:07:50,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:07:50,343 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:07:50,344 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:07:50,640 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 10:07:50,641 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:07:50,648 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:07:50,648 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:07:50,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:07:50 BoogieIcfgContainer [2025-03-08 10:07:50,648 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:07:50,650 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:07:50,650 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:07:50,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:07:50,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:07:49" (1/3) ... [2025-03-08 10:07:50,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0a09d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:07:50, skipping insertion in model container [2025-03-08 10:07:50,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:50" (2/3) ... [2025-03-08 10:07:50,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0a09d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:07:50, skipping insertion in model container [2025-03-08 10:07:50,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:07:50" (3/3) ... [2025-03-08 10:07:50,655 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-9.i [2025-03-08 10:07:50,665 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:07:50,667 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-9.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:07:50,711 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:07:50,720 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;@24ca03c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:07:50,720 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:07:50,723 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 10:07:50,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 10:07:50,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:50,733 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:07:50,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:50,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:50,738 INFO L85 PathProgramCache]: Analyzing trace with hash 2109188796, now seen corresponding path program 1 times [2025-03-08 10:07:50,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:07:50,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985543904] [2025-03-08 10:07:50,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:50,750 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-08 10:07:50,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:07:50,752 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-08 10:07:50,754 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-08 10:07:50,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 10:07:50,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 10:07:50,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:50,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:50,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:07:50,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:07:50,958 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-03-08 10:07:50,958 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:07:50,962 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:07:50,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985543904] [2025-03-08 10:07:50,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985543904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:07:50,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:07:50,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 10:07:50,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989558909] [2025-03-08 10:07:50,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:07:50,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:07:50,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:07:50,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:07:50,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:07:50,978 INFO L87 Difference]: Start difference. First operand has 61 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 10:07:50,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:07:50,992 INFO L93 Difference]: Finished difference Result 116 states and 202 transitions. [2025-03-08 10:07:50,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:07:50,993 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 131 [2025-03-08 10:07:50,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:07:50,996 INFO L225 Difference]: With dead ends: 116 [2025-03-08 10:07:50,996 INFO L226 Difference]: Without dead ends: 58 [2025-03-08 10:07:51,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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-08 10:07:51,003 INFO L435 NwaCegarLoop]: 87 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, 87 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-08 10:07:51,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:07:51,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-08 10:07:51,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-08 10:07:51,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 10:07:51,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 87 transitions. [2025-03-08 10:07:51,031 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 87 transitions. Word has length 131 [2025-03-08 10:07:51,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:07:51,032 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 87 transitions. [2025-03-08 10:07:51,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 10:07:51,032 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 87 transitions. [2025-03-08 10:07:51,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 10:07:51,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:51,035 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:07:51,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 10:07:51,236 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-08 10:07:51,236 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:51,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:51,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1697648545, now seen corresponding path program 1 times [2025-03-08 10:07:51,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:07:51,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095457615] [2025-03-08 10:07:51,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:51,237 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-08 10:07:51,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:07:51,240 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-08 10:07:51,241 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-08 10:07:51,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 10:07:51,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 10:07:51,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:51,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:51,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 10:07:51,394 INFO L279 TraceCheckSpWp]: Computing forward predicates...