./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-49.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-49.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 17c28f5c9c0d305f6f66e69f023e955b6e145200d4f06514fc000568801e139d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:56:34,448 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:56:34,501 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 22:56:34,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:56:34,506 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:56:34,525 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:56:34,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:56:34,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:56:34,527 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:56:34,528 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:56:34,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:56:34,529 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:56:34,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:56:34,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:56:34,530 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:56:34,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:56:34,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:56:34,530 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 22:56:34,530 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:56:34,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 22:56:34,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:56:34,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:56:34,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:56:34,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:56:34,531 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 22:56:34,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:56:34,531 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:56:34,531 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:56:34,531 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:56:34,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:56:34,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:56:34,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:56:34,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:56:34,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:56:34,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:56:34,533 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:56:34,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:56:34,533 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:56:34,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:56:34,533 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:56:34,533 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:56:34,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:56:34,533 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:56:34,533 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 -> 17c28f5c9c0d305f6f66e69f023e955b6e145200d4f06514fc000568801e139d [2025-03-16 22:56:34,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:56:34,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:56:34,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:56:34,783 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:56:34,784 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:56:34,785 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-49.i [2025-03-16 22:56:36,033 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c4c3f3d9/b7445339552342d29ade0813dbab4efe/FLAG8b0a7ea98 [2025-03-16 22:56:36,301 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:56:36,306 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-49.i [2025-03-16 22:56:36,315 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c4c3f3d9/b7445339552342d29ade0813dbab4efe/FLAG8b0a7ea98 [2025-03-16 22:56:36,592 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c4c3f3d9/b7445339552342d29ade0813dbab4efe [2025-03-16 22:56:36,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:56:36,596 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:56:36,598 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:56:36,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:56:36,601 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:56:36,602 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:56:36" (1/1) ... [2025-03-16 22:56:36,603 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@781d8a73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:36, skipping insertion in model container [2025-03-16 22:56:36,603 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:56:36" (1/1) ... [2025-03-16 22:56:36,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:56:36,724 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_dependencies_file-49.i[919,932] [2025-03-16 22:56:36,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:56:36,799 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:56:36,809 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_dependencies_file-49.i[919,932] [2025-03-16 22:56:36,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:56:36,860 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:56:36,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:36 WrapperNode [2025-03-16 22:56:36,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:56:36,861 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:56:36,861 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:56:36,861 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:56:36,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:36" (1/1) ... [2025-03-16 22:56:36,872 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:36" (1/1) ... [2025-03-16 22:56:36,902 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2025-03-16 22:56:36,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:56:36,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:56:36,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:56:36,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:56:36,914 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:36" (1/1) ... [2025-03-16 22:56:36,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:36" (1/1) ... [2025-03-16 22:56:36,916 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:36" (1/1) ... [2025-03-16 22:56:36,930 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-16 22:56:36,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:36" (1/1) ... [2025-03-16 22:56:36,935 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:36" (1/1) ... [2025-03-16 22:56:36,945 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:36" (1/1) ... [2025-03-16 22:56:36,946 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:36" (1/1) ... [2025-03-16 22:56:36,947 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:36" (1/1) ... [2025-03-16 22:56:36,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:36" (1/1) ... [2025-03-16 22:56:36,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:56:36,954 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:56:36,954 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:56:36,954 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:56:36,955 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:36" (1/1) ... [2025-03-16 22:56:36,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:56:36,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:56:36,981 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-16 22:56:36,984 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-16 22:56:37,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:56:37,002 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 22:56:37,002 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 22:56:37,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:56:37,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:56:37,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:56:37,051 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:56:37,053 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:56:37,292 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: havoc property_#t~bitwise17#1;havoc property_#t~short18#1; [2025-03-16 22:56:37,321 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-16 22:56:37,321 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:56:37,340 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:56:37,340 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:56:37,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:56:37 BoogieIcfgContainer [2025-03-16 22:56:37,341 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:56:37,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:56:37,346 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:56:37,350 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:56:37,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:56:36" (1/3) ... [2025-03-16 22:56:37,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4831d536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:56:37, skipping insertion in model container [2025-03-16 22:56:37,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:36" (2/3) ... [2025-03-16 22:56:37,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4831d536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:56:37, skipping insertion in model container [2025-03-16 22:56:37,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:56:37" (3/3) ... [2025-03-16 22:56:37,354 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-49.i [2025-03-16 22:56:37,368 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:56:37,369 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-49.i that has 2 procedures, 67 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:56:37,419 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:56:37,430 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;@2ac4acec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:56:37,431 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:56:37,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 43 states have (on average 1.441860465116279) internal successors, (62), 44 states have internal predecessors, (62), 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-16 22:56:37,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 22:56:37,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:56:37,446 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-16 22:56:37,448 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:56:37,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:56:37,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1527536593, now seen corresponding path program 1 times [2025-03-16 22:56:37,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:56:37,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963293306] [2025-03-16 22:56:37,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:56:37,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:56:37,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 22:56:37,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 22:56:37,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:56:37,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:56:37,713 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-16 22:56:37,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:56:37,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963293306] [2025-03-16 22:56:37,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963293306] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:56:37,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075680078] [2025-03-16 22:56:37,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:56:37,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:56:37,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:56:37,719 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-16 22:56:37,720 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-16 22:56:37,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 22:56:37,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 22:56:37,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:56:37,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:56:37,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 22:56:37,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:56:37,903 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-16 22:56:37,904 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:56:37,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075680078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:56:37,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 22:56:37,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 22:56:37,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842937448] [2025-03-16 22:56:37,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:56:37,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 22:56:37,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:56:37,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 22:56:37,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 22:56:37,931 INFO L87 Difference]: Start difference. First operand has 67 states, 43 states have (on average 1.441860465116279) internal successors, (62), 44 states have internal predecessors, (62), 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.0) internal successors, (32), 2 states have internal predecessors, (32), 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-16 22:56:37,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:56:37,956 INFO L93 Difference]: Finished difference Result 130 states and 225 transitions. [2025-03-16 22:56:37,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 22:56:37,957 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (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 132 [2025-03-16 22:56:37,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:56:37,961 INFO L225 Difference]: With dead ends: 130 [2025-03-16 22:56:37,962 INFO L226 Difference]: Without dead ends: 64 [2025-03-16 22:56:37,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 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-16 22:56:37,968 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:56:37,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:56:37,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-16 22:56:37,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-16 22:56:37,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 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-16 22:56:38,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 97 transitions. [2025-03-16 22:56:38,005 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 97 transitions. Word has length 132 [2025-03-16 22:56:38,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:56:38,006 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 97 transitions. [2025-03-16 22:56:38,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (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-16 22:56:38,006 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 97 transitions. [2025-03-16 22:56:38,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 22:56:38,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:56:38,011 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-16 22:56:38,018 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-16 22:56:38,212 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-16 22:56:38,212 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:56:38,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:56:38,214 INFO L85 PathProgramCache]: Analyzing trace with hash 353564106, now seen corresponding path program 1 times [2025-03-16 22:56:38,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:56:38,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913514697] [2025-03-16 22:56:38,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:56:38,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:56:38,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 22:56:38,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 22:56:38,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:56:38,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:56:38,761 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-16 22:56:38,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:56:38,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913514697] [2025-03-16 22:56:38,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913514697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:56:38,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:56:38,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:56:38,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641847068] [2025-03-16 22:56:38,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:56:38,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:56:38,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:56:38,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:56:38,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:56:38,765 INFO L87 Difference]: Start difference. First operand 64 states and 97 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-16 22:56:38,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:56:38,941 INFO L93 Difference]: Finished difference Result 190 states and 288 transitions. [2025-03-16 22:56:38,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:56:38,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 132 [2025-03-16 22:56:38,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:56:38,943 INFO L225 Difference]: With dead ends: 190 [2025-03-16 22:56:38,943 INFO L226 Difference]: Without dead ends: 127 [2025-03-16 22:56:38,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:56:38,944 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 69 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:56:38,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 267 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:56:38,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-16 22:56:38,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 106. [2025-03-16 22:56:38,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 61 states have (on average 1.2622950819672132) internal successors, (77), 61 states have internal predecessors, (77), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-16 22:56:38,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 161 transitions. [2025-03-16 22:56:38,971 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 161 transitions. Word has length 132 [2025-03-16 22:56:38,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:56:38,971 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 161 transitions. [2025-03-16 22:56:38,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-16 22:56:38,974 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 161 transitions. [2025-03-16 22:56:38,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 22:56:38,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:56:38,977 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] [2025-03-16 22:56:38,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:56:38,977 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:56:38,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:56:38,978 INFO L85 PathProgramCache]: Analyzing trace with hash 451518094, now seen corresponding path program 1 times [2025-03-16 22:56:38,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:56:38,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611018333] [2025-03-16 22:56:38,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:56:38,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:56:38,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 22:56:39,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 22:56:39,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:56:39,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:56:39,195 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-16 22:56:39,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:56:39,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611018333] [2025-03-16 22:56:39,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611018333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:56:39,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:56:39,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:56:39,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427914927] [2025-03-16 22:56:39,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:56:39,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 22:56:39,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:56:39,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 22:56:39,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 22:56:39,197 INFO L87 Difference]: Start difference. First operand 106 states and 161 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (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-16 22:56:39,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:56:39,236 INFO L93 Difference]: Finished difference Result 170 states and 259 transitions. [2025-03-16 22:56:39,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 22:56:39,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (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 133 [2025-03-16 22:56:39,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:56:39,239 INFO L225 Difference]: With dead ends: 170 [2025-03-16 22:56:39,239 INFO L226 Difference]: Without dead ends: 107 [2025-03-16 22:56:39,239 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-16 22:56:39,240 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:56:39,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:56:39,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-16 22:56:39,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-16 22:56:39,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 62 states have internal predecessors, (78), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-16 22:56:39,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 162 transitions. [2025-03-16 22:56:39,266 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 162 transitions. Word has length 133 [2025-03-16 22:56:39,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:56:39,266 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 162 transitions. [2025-03-16 22:56:39,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (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-16 22:56:39,266 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 162 transitions. [2025-03-16 22:56:39,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 22:56:39,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:56:39,268 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] [2025-03-16 22:56:39,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 22:56:39,270 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:56:39,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:56:39,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1597398298, now seen corresponding path program 1 times [2025-03-16 22:56:39,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:56:39,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146814282] [2025-03-16 22:56:39,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:56:39,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:56:39,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 22:56:39,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 22:56:39,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:56:39,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:56:39,555 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-16 22:56:39,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:56:39,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146814282] [2025-03-16 22:56:39,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146814282] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:56:39,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134286317] [2025-03-16 22:56:39,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:56:39,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:56:39,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:56:39,558 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-16 22:56:39,560 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-16 22:56:39,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 22:56:39,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 22:56:39,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:56:39,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:56:39,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 22:56:39,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:56:39,920 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2025-03-16 22:56:39,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:56:40,154 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-16 22:56:40,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134286317] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:56:40,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:56:40,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-16 22:56:40,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787037514] [2025-03-16 22:56:40,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:56:40,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 22:56:40,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:56:40,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 22:56:40,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:56:40,156 INFO L87 Difference]: Start difference. First operand 107 states and 162 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 3 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) [2025-03-16 22:56:40,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:56:40,341 INFO L93 Difference]: Finished difference Result 183 states and 269 transitions. [2025-03-16 22:56:40,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:56:40,342 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 3 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) Word has length 134 [2025-03-16 22:56:40,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:56:40,345 INFO L225 Difference]: With dead ends: 183 [2025-03-16 22:56:40,346 INFO L226 Difference]: Without dead ends: 119 [2025-03-16 22:56:40,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2025-03-16 22:56:40,348 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 61 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:56:40,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 139 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:56:40,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-16 22:56:40,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2025-03-16 22:56:40,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 68 states have internal predecessors, (81), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-16 22:56:40,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 165 transitions. [2025-03-16 22:56:40,378 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 165 transitions. Word has length 134 [2025-03-16 22:56:40,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:56:40,379 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 165 transitions. [2025-03-16 22:56:40,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 3 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) [2025-03-16 22:56:40,379 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 165 transitions. [2025-03-16 22:56:40,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 22:56:40,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:56:40,382 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] [2025-03-16 22:56:40,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 22:56:40,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-16 22:56:40,583 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:56:40,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:56:40,585 INFO L85 PathProgramCache]: Analyzing trace with hash -451068031, now seen corresponding path program 1 times [2025-03-16 22:56:40,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:56:40,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269425577] [2025-03-16 22:56:40,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:56:40,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:56:40,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 22:56:40,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 22:56:40,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:56:40,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:56:40,856 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-16 22:56:40,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:56:40,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269425577] [2025-03-16 22:56:40,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269425577] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:56:40,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452501905] [2025-03-16 22:56:40,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:56:40,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:56:40,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:56:40,860 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-16 22:56:40,862 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-16 22:56:40,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 22:56:40,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 22:56:40,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:56:40,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:56:40,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 22:56:40,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:56:41,680 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2025-03-16 22:56:41,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:56:42,179 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-16 22:56:42,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452501905] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:56:42,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:56:42,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 17 [2025-03-16 22:56:42,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687734730] [2025-03-16 22:56:42,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:56:42,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 22:56:42,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:56:42,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 22:56:42,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-16 22:56:42,181 INFO L87 Difference]: Start difference. First operand 115 states and 165 transitions. Second operand has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) [2025-03-16 22:56:43,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:56:43,204 INFO L93 Difference]: Finished difference Result 488 states and 682 transitions. [2025-03-16 22:56:43,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-16 22:56:43,205 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) Word has length 134 [2025-03-16 22:56:43,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:56:43,207 INFO L225 Difference]: With dead ends: 488 [2025-03-16 22:56:43,207 INFO L226 Difference]: Without dead ends: 419 [2025-03-16 22:56:43,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=450, Invalid=1190, Unknown=0, NotChecked=0, Total=1640 [2025-03-16 22:56:43,209 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 610 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 22:56:43,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 474 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 22:56:43,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-03-16 22:56:43,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 321. [2025-03-16 22:56:43,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 204 states have (on average 1.2205882352941178) internal successors, (249), 204 states have internal predecessors, (249), 105 states have call successors, (105), 11 states have call predecessors, (105), 11 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-16 22:56:43,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 459 transitions. [2025-03-16 22:56:43,255 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 459 transitions. Word has length 134 [2025-03-16 22:56:43,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:56:43,256 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 459 transitions. [2025-03-16 22:56:43,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) [2025-03-16 22:56:43,256 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 459 transitions. [2025-03-16 22:56:43,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-16 22:56:43,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:56:43,258 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] [2025-03-16 22:56:43,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 22:56:43,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:56:43,459 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:56:43,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:56:43,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1439170681, now seen corresponding path program 1 times [2025-03-16 22:56:43,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:56:43,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377455643] [2025-03-16 22:56:43,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:56:43,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:56:43,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-16 22:56:43,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-16 22:56:43,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:56:43,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 22:56:43,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [183513322] [2025-03-16 22:56:43,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:56:43,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:56:43,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:56:43,530 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-16 22:56:43,533 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-16 22:56:43,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-16 22:56:43,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-16 22:56:43,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:56:43,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:56:43,654 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 22:56:43,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-16 22:56:43,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-16 22:56:43,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:56:43,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:56:43,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 22:56:43,766 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 22:56:43,766 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 22:56:43,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 22:56:43,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:56:43,970 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-16 22:56:44,041 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 22:56:44,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 10:56:44 BoogieIcfgContainer [2025-03-16 22:56:44,046 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 22:56:44,046 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 22:56:44,046 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 22:56:44,047 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 22:56:44,047 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:56:37" (3/4) ... [2025-03-16 22:56:44,048 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 22:56:44,049 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 22:56:44,049 INFO L158 Benchmark]: Toolchain (without parser) took 7453.17ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 113.9MB in the beginning and 157.1MB in the end (delta: -43.2MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2025-03-16 22:56:44,050 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:56:44,050 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.20ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 99.4MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 22:56:44,050 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.91ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 96.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:56:44,051 INFO L158 Benchmark]: Boogie Preprocessor took 49.62ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 91.0MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:56:44,051 INFO L158 Benchmark]: IcfgBuilder took 386.97ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 68.1MB in the end (delta: 23.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 22:56:44,051 INFO L158 Benchmark]: TraceAbstraction took 6700.51ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 67.2MB in the beginning and 157.1MB in the end (delta: -89.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:56:44,052 INFO L158 Benchmark]: Witness Printer took 2.67ms. Allocated memory is still 218.1MB. Free memory is still 157.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:56:44,052 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.20ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 99.4MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.91ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 96.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.62ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 91.0MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 386.97ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 68.1MB in the end (delta: 23.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6700.51ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 67.2MB in the beginning and 157.1MB in the end (delta: -89.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.67ms. Allocated memory is still 218.1MB. Free memory is still 157.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of bitwiseAnd at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 105. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 10; [L23] unsigned long int var_1_3 = 3171453299; [L24] unsigned long int var_1_4 = 2038274679; [L25] unsigned long int var_1_5 = 1375699353; [L26] unsigned short int var_1_8 = 16; [L27] unsigned char var_1_12 = 1; [L28] unsigned char var_1_13 = 1; [L29] double var_1_14 = 64.45; [L30] float var_1_15 = 31.15; [L31] float var_1_16 = 16.4; [L32] double var_1_17 = 100.625; [L33] double var_1_18 = 128.1; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 8; [L36] unsigned char var_1_21 = 100; [L37] unsigned char var_1_22 = 0; [L38] signed char var_1_23 = 2; [L39] unsigned char var_1_24 = 0; [L40] unsigned long int last_1_var_1_1 = 10; [L41] unsigned short int last_1_var_1_8 = 16; [L42] unsigned char last_1_var_1_12 = 1; [L43] unsigned char last_1_var_1_19 = 1; [L44] unsigned char last_1_var_1_22 = 0; [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] CALL updateLastVariables() [L123] last_1_var_1_1 = var_1_1 [L124] last_1_var_1_8 = var_1_8 [L125] last_1_var_1_12 = var_1_12 [L126] last_1_var_1_19 = var_1_19 [L127] last_1_var_1_22 = var_1_22 [L137] RET updateLastVariables() [L138] CALL updateVariables() [L88] var_1_3 = __VERIFIER_nondet_ulong() [L89] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L89] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L90] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L90] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L91] var_1_4 = __VERIFIER_nondet_ulong() [L92] CALL assume_abort_if_not(var_1_4 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1375699353, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1375699353, var_1_8=16] [L92] RET assume_abort_if_not(var_1_4 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1375699353, var_1_8=16] [L93] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1375699353, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1375699353, var_1_8=16] [L93] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1375699353, var_1_8=16] [L94] var_1_5 = __VERIFIER_nondet_ulong() [L95] CALL assume_abort_if_not(var_1_5 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L95] RET assume_abort_if_not(var_1_5 >= 1073741824) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L96] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L96] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L97] var_1_13 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L98] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L99] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L99] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L100] var_1_15 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L101] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L102] var_1_16 = __VERIFIER_nondet_float() [L103] CALL assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L103] RET assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L104] var_1_17 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L105] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L106] var_1_18 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L107] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L108] var_1_20 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L109] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L110] CALL assume_abort_if_not(var_1_20 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L110] RET assume_abort_if_not(var_1_20 <= 254) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L111] var_1_21 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L112] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L113] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L113] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L114] var_1_23 = __VERIFIER_nondet_char() [L115] CALL assume_abort_if_not(var_1_23 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L115] RET assume_abort_if_not(var_1_23 >= -128) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L116] CALL assume_abort_if_not(var_1_23 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L116] RET assume_abort_if_not(var_1_23 <= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L117] CALL assume_abort_if_not(var_1_23 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L117] RET assume_abort_if_not(var_1_23 != 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L118] var_1_24 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L119] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L120] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L120] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L138] RET updateVariables() [L139] CALL step() [L48] COND TRUE ! last_1_var_1_22 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L49] COND TRUE (last_1_var_1_1 * ((((last_1_var_1_19) < (var_1_5)) ? (last_1_var_1_19) : (var_1_5)))) >= last_1_var_1_19 [L50] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L55] COND TRUE \read(last_1_var_1_12) [L56] var_1_1 = (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) - (((((last_1_var_1_19) > (last_1_var_1_8)) ? (last_1_var_1_19) : (last_1_var_1_8))) + 256u)) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=2147483375, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L58] COND FALSE !(var_1_13 && last_1_var_1_22) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=2147483375, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=16] [L65] var_1_8 = ((((25) > ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))) ? (25) : ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19))))) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=2147483375, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=102] [L66] COND TRUE (((((- 9.5f)) > ((- var_1_15))) ? ((- 9.5f)) : ((- var_1_15)))) < var_1_16 [L67] var_1_14 = ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=2147483375, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=102] [L69] EXPR var_1_19 & var_1_4 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=2147483375, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=102] [L69] COND FALSE !((-2 / var_1_23) >= (var_1_19 & var_1_4)) [L84] var_1_22 = var_1_13 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=2147483375, var_1_20=0, var_1_21=256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=102] [L139] RET step() [L140] CALL, EXPR property() [L130] EXPR (((((last_1_var_1_12 ? (var_1_1 == ((unsigned long int) (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) - (((((last_1_var_1_19) > (last_1_var_1_8)) ? (last_1_var_1_19) : (last_1_var_1_8))) + 256u)))) : 1) && (var_1_8 == ((unsigned short int) ((((25) > ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))) ? (25) : ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))))))) && ((! last_1_var_1_22) ? (((last_1_var_1_1 * ((((last_1_var_1_19) < (var_1_5)) ? (last_1_var_1_19) : (var_1_5)))) >= last_1_var_1_19) ? (var_1_12 == ((unsigned char) var_1_13)) : 1) : (var_1_12 == ((unsigned char) 0)))) && (((((((- 9.5f)) > ((- var_1_15))) ? ((- 9.5f)) : ((- var_1_15)))) < var_1_16) ? (var_1_14 == ((double) ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))))) : 1)) && ((var_1_13 && last_1_var_1_22) ? ((var_1_4 > (256u * last_1_var_1_8)) ? (var_1_19 == ((unsigned char) ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))))) : (var_1_19 == ((unsigned char) var_1_20))) : 1)) && (((-2 / var_1_23) >= (var_1_19 & var_1_4)) ? ((var_1_21 >= (var_1_1 + var_1_5)) ? (((~ var_1_19) > var_1_20) ? (var_1_12 ? (var_1_22 == ((unsigned char) var_1_24)) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=2147483375, var_1_20=0, var_1_21=256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=102] [L130-L131] return (((((last_1_var_1_12 ? (var_1_1 == ((unsigned long int) (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) - (((((last_1_var_1_19) > (last_1_var_1_8)) ? (last_1_var_1_19) : (last_1_var_1_8))) + 256u)))) : 1) && (var_1_8 == ((unsigned short int) ((((25) > ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))) ? (25) : ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))))))) && ((! last_1_var_1_22) ? (((last_1_var_1_1 * ((((last_1_var_1_19) < (var_1_5)) ? (last_1_var_1_19) : (var_1_5)))) >= last_1_var_1_19) ? (var_1_12 == ((unsigned char) var_1_13)) : 1) : (var_1_12 == ((unsigned char) 0)))) && (((((((- 9.5f)) > ((- var_1_15))) ? ((- 9.5f)) : ((- var_1_15)))) < var_1_16) ? (var_1_14 == ((double) ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))))) : 1)) && ((var_1_13 && last_1_var_1_22) ? ((var_1_4 > (256u * last_1_var_1_8)) ? (var_1_19 == ((unsigned char) ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))))) : (var_1_19 == ((unsigned char) var_1_20))) : 1)) && (((-2 / var_1_23) >= (var_1_19 & var_1_4)) ? ((var_1_21 >= (var_1_1 + var_1_5)) ? (((~ var_1_19) > var_1_20) ? (var_1_12 ? (var_1_22 == ((unsigned char) var_1_24)) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) ; [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=2147483375, var_1_20=0, var_1_21=256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=102] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=2147483375, var_1_20=0, var_1_21=256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1073741824, var_1_8=102] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 125 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 6, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 764 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 740 mSDsluCounter, 1158 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 738 mSDsCounter, 335 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 802 IncrementalHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 335 mSolverCounterUnsat, 420 mSDtfsCounter, 802 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 720 GetRequests, 667 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=321occurred in iteration=5, InterpolantAutomatonStates: 51, 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, 5 MinimizatonAttempts, 123 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1335 NumberOfCodeBlocks, 1335 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1323 ConstructedInterpolants, 0 QuantifiedInterpolants, 4794 SizeOfPredicates, 6 NumberOfNonLiveVariables, 950 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 8036/8400 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-16 22:56:44,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-49.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 17c28f5c9c0d305f6f66e69f023e955b6e145200d4f06514fc000568801e139d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:56:45,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:56:45,939 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 22:56:45,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:56:45,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:56:45,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:56:45,984 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:56:45,984 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:56:45,984 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:56:45,984 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:56:45,984 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:56:45,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:56:45,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:56:45,985 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:56:45,985 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:56:45,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:56:45,985 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:56:45,985 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 22:56:45,985 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 22:56:45,985 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:56:45,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:56:45,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:56:45,985 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:56:45,985 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 22:56:45,985 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 22:56:45,985 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 22:56:45,985 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 22:56:45,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:56:45,985 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:56:45,986 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:56:45,986 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:56:45,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:56:45,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:56:45,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:56:45,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:56:45,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:56:45,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:56:45,986 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:56:45,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:56:45,986 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 22:56:45,986 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 22:56:45,986 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:56:45,986 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:56:45,986 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:56:45,986 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:56:45,986 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 -> 17c28f5c9c0d305f6f66e69f023e955b6e145200d4f06514fc000568801e139d [2025-03-16 22:56:46,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:56:46,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:56:46,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:56:46,248 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:56:46,248 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:56:46,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-49.i [2025-03-16 22:56:47,452 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3248b7327/da40152263014006938dad18d8323a32/FLAG0d8fc31f4 [2025-03-16 22:56:47,670 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:56:47,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-49.i [2025-03-16 22:56:47,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3248b7327/da40152263014006938dad18d8323a32/FLAG0d8fc31f4 [2025-03-16 22:56:48,001 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3248b7327/da40152263014006938dad18d8323a32 [2025-03-16 22:56:48,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:56:48,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:56:48,005 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:56:48,005 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:56:48,008 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:56:48,008 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:56:48" (1/1) ... [2025-03-16 22:56:48,009 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53466432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:48, skipping insertion in model container [2025-03-16 22:56:48,009 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:56:48" (1/1) ... [2025-03-16 22:56:48,021 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:56:48,113 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_dependencies_file-49.i[919,932] [2025-03-16 22:56:48,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:56:48,157 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:56:48,165 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_dependencies_file-49.i[919,932] [2025-03-16 22:56:48,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:56:48,199 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:56:48,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:48 WrapperNode [2025-03-16 22:56:48,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:56:48,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:56:48,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:56:48,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:56:48,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:48" (1/1) ... [2025-03-16 22:56:48,220 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:48" (1/1) ... [2025-03-16 22:56:48,243 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2025-03-16 22:56:48,243 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:56:48,244 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:56:48,244 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:56:48,244 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:56:48,250 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:48" (1/1) ... [2025-03-16 22:56:48,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:48" (1/1) ... [2025-03-16 22:56:48,257 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:48" (1/1) ... [2025-03-16 22:56:48,269 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-16 22:56:48,269 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:48" (1/1) ... [2025-03-16 22:56:48,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:48" (1/1) ... [2025-03-16 22:56:48,278 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:48" (1/1) ... [2025-03-16 22:56:48,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:48" (1/1) ... [2025-03-16 22:56:48,284 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:48" (1/1) ... [2025-03-16 22:56:48,285 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:48" (1/1) ... [2025-03-16 22:56:48,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:56:48,292 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:56:48,292 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:56:48,293 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:56:48,293 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:48" (1/1) ... [2025-03-16 22:56:48,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:56:48,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:56:48,324 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-16 22:56:48,327 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-16 22:56:48,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:56:48,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 22:56:48,345 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 22:56:48,345 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 22:56:48,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:56:48,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:56:48,400 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:56:48,401 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:56:48,716 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 22:56:48,717 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:56:48,725 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:56:48,725 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:56:48,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:56:48 BoogieIcfgContainer [2025-03-16 22:56:48,726 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:56:48,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:56:48,727 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:56:48,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:56:48,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:56:48" (1/3) ... [2025-03-16 22:56:48,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a31ecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:56:48, skipping insertion in model container [2025-03-16 22:56:48,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:48" (2/3) ... [2025-03-16 22:56:48,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a31ecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:56:48, skipping insertion in model container [2025-03-16 22:56:48,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:56:48" (3/3) ... [2025-03-16 22:56:48,732 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-49.i [2025-03-16 22:56:48,742 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:56:48,743 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-49.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:56:48,778 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:56:48,785 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;@5bd5e25c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:56:48,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:56:48,788 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 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-16 22:56:48,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 22:56:48,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:56:48,795 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] [2025-03-16 22:56:48,795 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:56:48,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:56:48,799 INFO L85 PathProgramCache]: Analyzing trace with hash 944611662, now seen corresponding path program 1 times [2025-03-16 22:56:48,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:56:48,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [570506932] [2025-03-16 22:56:48,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:56:48,807 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-16 22:56:48,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 22:56:48,809 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-16 22:56:48,811 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-16 22:56:48,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 22:56:49,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 22:56:49,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:56:49,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:56:49,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 22:56:49,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:56:49,067 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-16 22:56:49,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:56:49,067 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:56:49,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [570506932] [2025-03-16 22:56:49,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [570506932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:56:49,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:56:49,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 22:56:49,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567331791] [2025-03-16 22:56:49,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:56:49,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 22:56:49,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:56:49,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 22:56:49,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 22:56:49,084 INFO L87 Difference]: Start difference. First operand has 57 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 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 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-16 22:56:49,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:56:49,107 INFO L93 Difference]: Finished difference Result 110 states and 195 transitions. [2025-03-16 22:56:49,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 22:56:49,108 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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 128 [2025-03-16 22:56:49,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:56:49,115 INFO L225 Difference]: With dead ends: 110 [2025-03-16 22:56:49,115 INFO L226 Difference]: Without dead ends: 54 [2025-03-16 22:56:49,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 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-16 22:56:49,120 INFO L435 NwaCegarLoop]: 82 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, 82 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-16 22:56:49,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:56:49,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-16 22:56:49,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-16 22:56:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 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-16 22:56:49,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 82 transitions. [2025-03-16 22:56:49,156 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 82 transitions. Word has length 128 [2025-03-16 22:56:49,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:56:49,157 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 82 transitions. [2025-03-16 22:56:49,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-16 22:56:49,157 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 82 transitions. [2025-03-16 22:56:49,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 22:56:49,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:56:49,162 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] [2025-03-16 22:56:49,172 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-16 22:56:49,362 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-16 22:56:49,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:56:49,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:56:49,363 INFO L85 PathProgramCache]: Analyzing trace with hash 536082537, now seen corresponding path program 1 times [2025-03-16 22:56:49,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:56:49,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484871635] [2025-03-16 22:56:49,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:56:49,364 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-16 22:56:49,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 22:56:49,366 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-16 22:56:49,367 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-16 22:56:49,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 22:56:49,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 22:56:49,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:56:49,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:56:49,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 22:56:49,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:56:49,774 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-16 22:56:49,774 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:56:49,774 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:56:49,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484871635] [2025-03-16 22:56:49,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [484871635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:56:49,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:56:49,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:56:49,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969508018] [2025-03-16 22:56:49,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:56:49,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:56:49,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:56:49,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:56:49,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:56:49,777 INFO L87 Difference]: Start difference. First operand 54 states and 82 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-16 22:56:49,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:56:49,987 INFO L93 Difference]: Finished difference Result 167 states and 255 transitions. [2025-03-16 22:56:49,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:56:49,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 128 [2025-03-16 22:56:49,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:56:49,995 INFO L225 Difference]: With dead ends: 167 [2025-03-16 22:56:49,995 INFO L226 Difference]: Without dead ends: 114 [2025-03-16 22:56:49,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:56:49,996 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 59 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:56:49,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 234 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:56:49,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-16 22:56:50,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 95. [2025-03-16 22:56:50,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 50 states have (on average 1.2) internal successors, (60), 50 states have internal predecessors, (60), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-16 22:56:50,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 144 transitions. [2025-03-16 22:56:50,016 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 144 transitions. Word has length 128 [2025-03-16 22:56:50,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:56:50,016 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 144 transitions. [2025-03-16 22:56:50,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-16 22:56:50,016 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 144 transitions. [2025-03-16 22:56:50,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-16 22:56:50,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:56:50,018 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] [2025-03-16 22:56:50,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-16 22:56:50,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 22:56:50,219 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:56:50,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:56:50,219 INFO L85 PathProgramCache]: Analyzing trace with hash 951702298, now seen corresponding path program 1 times [2025-03-16 22:56:50,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:56:50,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055380302] [2025-03-16 22:56:50,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:56:50,224 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-16 22:56:50,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 22:56:50,226 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 22:56:50,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-16 22:56:50,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 22:56:50,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 22:56:50,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:56:50,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:56:50,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-16 22:56:50,404 INFO L279 TraceCheckSpWp]: Computing forward predicates...