./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-50.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 66f1eaff1668198cade3519081680d7c9a1e8dcb8eb833aff0537b3d232f166a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:28:51,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:28:52,005 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 08:28:52,010 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:28:52,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:28:52,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:28:52,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:28:52,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:28:52,028 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:28:52,028 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:28:52,028 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:28:52,028 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:28:52,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:28:52,029 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:28:52,029 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:28:52,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:28:52,029 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:28:52,029 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:28:52,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:28:52,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:28:52,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:28:52,029 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:28:52,029 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:28:52,030 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:28:52,030 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:28:52,030 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:28:52,030 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:28:52,030 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:28:52,030 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:28:52,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:28:52,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:28:52,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:28:52,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:28:52,030 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:28:52,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:28:52,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:28:52,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:28:52,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:28:52,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:28:52,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:28:52,030 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:28:52,031 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:28:52,031 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:28:52,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:28:52,031 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:28:52,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:28:52,031 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:28:52,031 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:28:52,031 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-jdk21/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 -> 66f1eaff1668198cade3519081680d7c9a1e8dcb8eb833aff0537b3d232f166a [2025-01-09 08:28:52,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:28:52,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:28:52,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:28:52,247 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:28:52,247 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:28:52,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-50.i [2025-01-09 08:28:53,568 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f3044a48/18f43480790a4d3fae368ca4caac148a/FLAG1800cd772 [2025-01-09 08:28:53,849 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:28:53,850 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-50.i [2025-01-09 08:28:53,858 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f3044a48/18f43480790a4d3fae368ca4caac148a/FLAG1800cd772 [2025-01-09 08:28:54,147 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f3044a48/18f43480790a4d3fae368ca4caac148a [2025-01-09 08:28:54,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:28:54,153 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:28:54,158 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:28:54,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:28:54,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:28:54,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:28:54" (1/1) ... [2025-01-09 08:28:54,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a80055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:54, skipping insertion in model container [2025-01-09 08:28:54,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:28:54" (1/1) ... [2025-01-09 08:28:54,182 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:28:54,317 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-50.i[919,932] [2025-01-09 08:28:54,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:28:54,396 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:28:54,410 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-50.i[919,932] [2025-01-09 08:28:54,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:28:54,457 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:28:54,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:54 WrapperNode [2025-01-09 08:28:54,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:28:54,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:28:54,463 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:28:54,463 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:28:54,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:54" (1/1) ... [2025-01-09 08:28:54,488 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:54" (1/1) ... [2025-01-09 08:28:54,522 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2025-01-09 08:28:54,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:28:54,526 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:28:54,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:28:54,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:28:54,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:54" (1/1) ... [2025-01-09 08:28:54,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:54" (1/1) ... [2025-01-09 08:28:54,541 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:54" (1/1) ... [2025-01-09 08:28:54,562 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-01-09 08:28:54,564 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:54" (1/1) ... [2025-01-09 08:28:54,564 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:54" (1/1) ... [2025-01-09 08:28:54,573 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:54" (1/1) ... [2025-01-09 08:28:54,574 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:54" (1/1) ... [2025-01-09 08:28:54,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:54" (1/1) ... [2025-01-09 08:28:54,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:54" (1/1) ... [2025-01-09 08:28:54,581 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:54" (1/1) ... [2025-01-09 08:28:54,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:28:54,588 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:28:54,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:28:54,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:28:54,589 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:54" (1/1) ... [2025-01-09 08:28:54,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:28:54,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:28:54,619 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 08:28:54,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 08:28:54,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:28:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:28:54,646 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:28:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:28:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:28:54,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:28:54,703 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:28:54,704 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:28:54,882 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 08:28:54,882 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:28:54,888 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:28:54,889 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:28:54,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:28:54 BoogieIcfgContainer [2025-01-09 08:28:54,889 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:28:54,891 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:28:54,891 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:28:54,894 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:28:54,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:28:54" (1/3) ... [2025-01-09 08:28:54,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f75e5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:28:54, skipping insertion in model container [2025-01-09 08:28:54,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:54" (2/3) ... [2025-01-09 08:28:54,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f75e5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:28:54, skipping insertion in model container [2025-01-09 08:28:54,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:28:54" (3/3) ... [2025-01-09 08:28:54,897 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-50.i [2025-01-09 08:28:54,908 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:28:54,909 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-50.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:28:54,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:28:54,955 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;@53309f9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:28:54,955 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:28:54,960 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 08:28:54,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 08:28:54,971 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:28:54,971 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:28:54,972 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:28:54,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:28:54,976 INFO L85 PathProgramCache]: Analyzing trace with hash -73823671, now seen corresponding path program 1 times [2025-01-09 08:28:54,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:28:54,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406960763] [2025-01-09 08:28:54,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:28:54,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:28:55,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 08:28:55,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 08:28:55,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:28:55,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:28:55,187 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 08:28:55,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:28:55,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406960763] [2025-01-09 08:28:55,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406960763] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:28:55,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828005834] [2025-01-09 08:28:55,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:28:55,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:28:55,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:28:55,190 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:28:55,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 08:28:55,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 08:28:55,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 08:28:55,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:28:55,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:28:55,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:28:55,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:28:55,326 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 08:28:55,326 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:28:55,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828005834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:28:55,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:28:55,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 08:28:55,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783538942] [2025-01-09 08:28:55,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:28:55,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:28:55,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:28:55,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:28:55,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:28:55,343 INFO L87 Difference]: Start difference. First operand has 59 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 08:28:55,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:28:55,357 INFO L93 Difference]: Finished difference Result 111 states and 189 transitions. [2025-01-09 08:28:55,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:28:55,358 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 128 [2025-01-09 08:28:55,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:28:55,362 INFO L225 Difference]: With dead ends: 111 [2025-01-09 08:28:55,362 INFO L226 Difference]: Without dead ends: 55 [2025-01-09 08:28:55,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 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-01-09 08:28:55,366 INFO L435 NwaCegarLoop]: 80 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, 80 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-01-09 08:28:55,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:28:55,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-09 08:28:55,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-01-09 08:28:55,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 08:28:55,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2025-01-09 08:28:55,390 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 128 [2025-01-09 08:28:55,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:28:55,390 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2025-01-09 08:28:55,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 08:28:55,390 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2025-01-09 08:28:55,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 08:28:55,393 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:28:55,393 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:28:55,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 08:28:55,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 08:28:55,594 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:28:55,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:28:55,595 INFO L85 PathProgramCache]: Analyzing trace with hash -252810227, now seen corresponding path program 1 times [2025-01-09 08:28:55,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:28:55,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107737400] [2025-01-09 08:28:55,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:28:55,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:28:55,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 08:28:55,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 08:28:55,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:28:55,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:28:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 08:28:55,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:28:55,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107737400] [2025-01-09 08:28:55,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107737400] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:28:55,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:28:55,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 08:28:55,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438692480] [2025-01-09 08:28:55,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:28:55,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 08:28:55,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:28:55,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 08:28:55,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 08:28:55,876 INFO L87 Difference]: Start difference. First operand 55 states and 80 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 08:28:55,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:28:55,941 INFO L93 Difference]: Finished difference Result 158 states and 232 transitions. [2025-01-09 08:28:55,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 08:28:55,943 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 128 [2025-01-09 08:28:55,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:28:55,945 INFO L225 Difference]: With dead ends: 158 [2025-01-09 08:28:55,945 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 08:28:55,946 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-01-09 08:28:55,946 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 73 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:28:55,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 145 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:28:55,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 08:28:55,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 58. [2025-01-09 08:28:55,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 08:28:55,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2025-01-09 08:28:55,968 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 128 [2025-01-09 08:28:55,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:28:55,971 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2025-01-09 08:28:55,972 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 08:28:55,972 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2025-01-09 08:28:55,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 08:28:55,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:28:55,974 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:28:55,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:28:55,974 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:28:55,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:28:55,975 INFO L85 PathProgramCache]: Analyzing trace with hash -195551925, now seen corresponding path program 1 times [2025-01-09 08:28:55,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:28:55,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807395681] [2025-01-09 08:28:55,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:28:55,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:28:55,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 08:28:56,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 08:28:56,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:28:56,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:28:56,700 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2025-01-09 08:28:56,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:28:56,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807395681] [2025-01-09 08:28:56,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807395681] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:28:56,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264326297] [2025-01-09 08:28:56,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:28:56,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:28:56,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:28:56,707 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:28:56,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 08:28:56,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 08:28:56,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 08:28:56,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:28:56,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:28:56,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 08:28:56,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:28:57,045 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 216 proven. 27 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2025-01-09 08:28:57,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:28:57,622 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 105 proven. 6 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-01-09 08:28:57,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264326297] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:28:57,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:28:57,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 22 [2025-01-09 08:28:57,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279471436] [2025-01-09 08:28:57,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:28:57,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 08:28:57,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:28:57,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 08:28:57,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2025-01-09 08:28:57,624 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 states have internal predecessors, (61), 3 states have call successors, (24), 2 states have call predecessors, (24), 6 states have return successors, (26), 6 states have call predecessors, (26), 3 states have call successors, (26) [2025-01-09 08:28:59,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:28:59,505 INFO L93 Difference]: Finished difference Result 365 states and 497 transitions. [2025-01-09 08:28:59,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-01-09 08:28:59,506 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 states have internal predecessors, (61), 3 states have call successors, (24), 2 states have call predecessors, (24), 6 states have return successors, (26), 6 states have call predecessors, (26), 3 states have call successors, (26) Word has length 128 [2025-01-09 08:28:59,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:28:59,508 INFO L225 Difference]: With dead ends: 365 [2025-01-09 08:28:59,508 INFO L226 Difference]: Without dead ends: 310 [2025-01-09 08:28:59,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1619 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1197, Invalid=4353, Unknown=0, NotChecked=0, Total=5550 [2025-01-09 08:28:59,511 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 501 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 510 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 510 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 08:28:59,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 475 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [510 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 08:28:59,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-01-09 08:28:59,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 128. [2025-01-09 08:28:59,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 81 states have internal predecessors, (96), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 08:28:59,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 176 transitions. [2025-01-09 08:28:59,546 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 176 transitions. Word has length 128 [2025-01-09 08:28:59,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:28:59,546 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 176 transitions. [2025-01-09 08:28:59,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 states have internal predecessors, (61), 3 states have call successors, (24), 2 states have call predecessors, (24), 6 states have return successors, (26), 6 states have call predecessors, (26), 3 states have call successors, (26) [2025-01-09 08:28:59,547 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 176 transitions. [2025-01-09 08:28:59,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 08:28:59,548 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:28:59,548 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:28:59,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 08:28:59,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:28:59,749 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:28:59,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:28:59,749 INFO L85 PathProgramCache]: Analyzing trace with hash 427248143, now seen corresponding path program 1 times [2025-01-09 08:28:59,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:28:59,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769475204] [2025-01-09 08:28:59,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:28:59,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:28:59,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 08:28:59,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 08:28:59,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:28:59,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:28:59,874 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 08:28:59,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:28:59,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769475204] [2025-01-09 08:28:59,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769475204] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:28:59,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:28:59,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 08:28:59,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254369768] [2025-01-09 08:28:59,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:28:59,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 08:28:59,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:28:59,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 08:28:59,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 08:28:59,876 INFO L87 Difference]: Start difference. First operand 128 states and 176 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 08:28:59,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:28:59,912 INFO L93 Difference]: Finished difference Result 253 states and 349 transitions. [2025-01-09 08:28:59,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 08:28:59,913 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 128 [2025-01-09 08:28:59,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:28:59,914 INFO L225 Difference]: With dead ends: 253 [2025-01-09 08:28:59,914 INFO L226 Difference]: Without dead ends: 128 [2025-01-09 08:28:59,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-01-09 08:28:59,915 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 72 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:28:59,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 73 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:28:59,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-01-09 08:28:59,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2025-01-09 08:28:59,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 75 states have (on average 1.1466666666666667) internal successors, (86), 75 states have internal predecessors, (86), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 08:28:59,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 166 transitions. [2025-01-09 08:28:59,951 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 166 transitions. Word has length 128 [2025-01-09 08:28:59,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:28:59,951 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 166 transitions. [2025-01-09 08:28:59,952 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 08:28:59,952 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 166 transitions. [2025-01-09 08:28:59,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 08:28:59,953 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:28:59,953 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:28:59,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 08:28:59,953 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:28:59,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:28:59,953 INFO L85 PathProgramCache]: Analyzing trace with hash 484506445, now seen corresponding path program 1 times [2025-01-09 08:28:59,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:28:59,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321343444] [2025-01-09 08:28:59,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:28:59,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:28:59,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 08:29:00,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 08:29:00,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:29:00,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 08:29:00,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1652911044] [2025-01-09 08:29:00,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:29:00,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:29:00,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:29:00,020 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:29:00,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 08:29:00,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 08:29:00,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 08:29:00,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:29:00,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:29:00,439 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 08:29:00,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 08:29:00,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 08:29:00,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:29:00,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:29:00,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 08:29:00,509 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 08:29:00,510 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 08:29:00,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 08:29:00,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:29:00,714 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 08:29:00,804 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 08:29:00,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 08:29:00 BoogieIcfgContainer [2025-01-09 08:29:00,810 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 08:29:00,810 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 08:29:00,810 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 08:29:00,810 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 08:29:00,811 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:28:54" (3/4) ... [2025-01-09 08:29:00,813 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 08:29:00,814 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 08:29:00,815 INFO L158 Benchmark]: Toolchain (without parser) took 6664.51ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 112.1MB in the beginning and 120.0MB in the end (delta: -8.0MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. [2025-01-09 08:29:00,816 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:29:00,816 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.08ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 98.0MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:29:00,816 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.46ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 94.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:29:00,817 INFO L158 Benchmark]: Boogie Preprocessor took 61.78ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 87.4MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:29:00,818 INFO L158 Benchmark]: RCFGBuilder took 301.01ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 67.0MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 08:29:00,818 INFO L158 Benchmark]: TraceAbstraction took 5919.09ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 66.5MB in the beginning and 120.1MB in the end (delta: -53.6MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2025-01-09 08:29:00,818 INFO L158 Benchmark]: Witness Printer took 3.96ms. Allocated memory is still 201.3MB. Free memory was 120.1MB in the beginning and 120.0MB in the end (delta: 39.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:29:00,820 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.23ms. Allocated memory is still 201.3MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.08ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 98.0MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.46ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 94.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.78ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 87.4MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 301.01ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 67.0MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5919.09ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 66.5MB in the beginning and 120.1MB in the end (delta: -53.6MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. * Witness Printer took 3.96ms. Allocated memory is still 201.3MB. Free memory was 120.1MB in the beginning and 120.0MB in the end (delta: 39.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 46, overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryArithmeticFLOAToperation at line 46, overapproximation of someUnaryFLOAToperation at line 46. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_7 = 0; [L24] unsigned char var_1_8 = 1; [L25] signed short int var_1_9 = -2; [L26] float var_1_13 = 999.4; [L27] float var_1_14 = 100.425; [L28] float var_1_15 = 3.375; [L29] float var_1_16 = 15.9; [L30] signed short int var_1_17 = -10; [L31] signed short int var_1_18 = 18060; [L32] unsigned char var_1_20 = 0; [L33] unsigned long int var_1_21 = 4; [L34] unsigned char var_1_23 = 0; [L35] unsigned char var_1_24 = 0; [L36] unsigned char var_1_25 = 100; [L37] unsigned char var_1_26 = 32; [L38] unsigned char var_1_27 = 10; [L39] unsigned char var_1_28 = 1; [L40] unsigned short int var_1_29 = 256; [L41] unsigned char var_1_30 = 1; VAL [isInitial=0, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=0, var_1_8=1, var_1_9=-2] [L121] isInitial = 1 [L122] FCALL initially() [L124] FCALL updateLastVariables() [L125] CALL updateVariables() [L82] var_1_7 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L83] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L84] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L84] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L85] var_1_8 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L86] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L87] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L87] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L88] var_1_14 = __VERIFIER_nondet_float() [L89] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L89] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L90] var_1_15 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L91] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L92] var_1_16 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L93] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L94] var_1_18 = __VERIFIER_nondet_short() [L95] CALL assume_abort_if_not(var_1_18 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L95] RET assume_abort_if_not(var_1_18 >= 16382) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L96] CALL assume_abort_if_not(var_1_18 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L96] RET assume_abort_if_not(var_1_18 <= 32766) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L97] var_1_21 = __VERIFIER_nondet_ulong() [L98] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L98] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L99] CALL assume_abort_if_not(var_1_21 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L99] RET assume_abort_if_not(var_1_21 <= 4294967295) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L100] CALL assume_abort_if_not(var_1_21 != 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L100] RET assume_abort_if_not(var_1_21 != 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L101] var_1_23 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L102] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L103] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L103] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L104] var_1_24 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L105] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L106] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L106] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L107] var_1_26 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L108] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L109] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=512, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=512, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L109] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=512, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L110] var_1_27 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=512, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=512, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L111] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=512, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L112] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=512, var_1_27=383, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=512, var_1_27=383, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L112] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=512, var_1_27=383, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L125] RET updateVariables() [L126] CALL step() [L45] COND TRUE \read(var_1_8) [L46] var_1_13 = (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=512, var_1_27=383, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L48] COND TRUE \read(var_1_8) [L49] var_1_25 = (var_1_26 + var_1_27) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=512, var_1_27=383, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L51] var_1_29 = var_1_27 [L52] var_1_30 = var_1_8 VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=512, var_1_27=383, var_1_28=1, var_1_29=127, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L53] COND FALSE !((var_1_29 > var_1_25) && var_1_30) [L56] var_1_9 = ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=512, var_1_27=383, var_1_28=1, var_1_29=127, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=127] [L58] var_1_17 = ((var_1_18 - 25) - var_1_25) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=16230, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=512, var_1_27=383, var_1_28=1, var_1_29=127, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=127] [L59] COND TRUE ((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < (var_1_25 + var_1_17) [L60] var_1_20 = (var_1_23 || var_1_24) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=16230, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=512, var_1_27=383, var_1_28=1, var_1_29=127, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=127] [L64] COND FALSE !((~ var_1_29) > var_1_9) [L67] var_1_28 = (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=16230, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=512, var_1_27=383, var_1_28=1, var_1_29=127, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=127] [L69] COND FALSE !(((((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25))) <= (var_1_25 - var_1_25)) [L78] var_1_1 = 0 VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=16230, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=512, var_1_27=383, var_1_28=1, var_1_29=127, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=127] [L126] RET step() [L127] CALL, EXPR property() [L117-L118] return (((((((((((((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25))) <= (var_1_25 - var_1_25)) ? ((var_1_25 < var_1_25) ? (var_1_20 ? (var_1_1 == ((unsigned char) var_1_7)) : (var_1_1 == ((unsigned char) var_1_8))) : 1) : (var_1_1 == ((unsigned char) 0))) && (((var_1_29 > var_1_25) && var_1_30) ? (var_1_9 == ((signed short int) var_1_25)) : (var_1_9 == ((signed short int) ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))))))) && (var_1_8 ? (var_1_13 == ((float) (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))))) : 1)) && (var_1_17 == ((signed short int) ((var_1_18 - 25) - var_1_25)))) && ((((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < (var_1_25 + var_1_17)) ? (var_1_20 == ((unsigned char) (var_1_23 || var_1_24))) : (var_1_20 == ((unsigned char) var_1_7)))) && (var_1_8 ? (var_1_25 == ((unsigned char) (var_1_26 + var_1_27))) : 1)) && (((~ var_1_29) > var_1_9) ? (var_1_28 == ((unsigned char) (! var_1_7))) : (var_1_28 == ((unsigned char) (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))))))) && (var_1_29 == ((unsigned short int) var_1_27))) && (var_1_30 == ((unsigned char) var_1_8)) ; VAL [\result=0, isInitial=1, var_1_13=2, var_1_16=0, var_1_17=16230, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=512, var_1_27=383, var_1_28=1, var_1_29=127, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=127] [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=16230, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=512, var_1_27=383, var_1_28=1, var_1_29=127, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=127] [L19] reach_error() VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=16230, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=512, var_1_27=383, var_1_28=1, var_1_29=127, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 666 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 646 mSDsluCounter, 773 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 415 mSDsCounter, 513 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 952 IncrementalHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 513 mSolverCounterUnsat, 358 mSDtfsCounter, 952 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 462 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1619 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=3, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 236 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1024 NumberOfCodeBlocks, 1024 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 889 ConstructedInterpolants, 0 QuantifiedInterpolants, 1422 SizeOfPredicates, 7 NumberOfNonLiveVariables, 596 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 5246/5320 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-01-09 08:29:00,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-50.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 66f1eaff1668198cade3519081680d7c9a1e8dcb8eb833aff0537b3d232f166a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:29:02,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:29:03,048 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 08:29:03,054 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:29:03,054 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:29:03,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:29:03,083 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:29:03,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:29:03,084 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:29:03,084 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:29:03,084 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:29:03,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:29:03,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:29:03,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:29:03,084 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:29:03,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:29:03,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:29:03,084 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:29:03,084 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:29:03,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:29:03,085 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:29:03,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:29:03,085 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:29:03,085 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 08:29:03,085 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 08:29:03,085 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 08:29:03,085 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:29:03,085 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:29:03,085 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:29:03,085 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:29:03,085 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:29:03,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:29:03,085 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:29:03,085 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:29:03,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:29:03,085 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:29:03,087 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:29:03,087 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:29:03,087 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:29:03,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:29:03,088 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:29:03,088 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:29:03,088 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:29:03,088 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:29:03,088 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 08:29:03,088 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 08:29:03,088 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:29:03,088 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:29:03,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:29:03,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:29:03,089 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-jdk21/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 -> 66f1eaff1668198cade3519081680d7c9a1e8dcb8eb833aff0537b3d232f166a [2025-01-09 08:29:03,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:29:03,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:29:03,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:29:03,338 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:29:03,338 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:29:03,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-50.i [2025-01-09 08:29:05,287 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/319e9a7cd/0e953765e52c42e199207d260b4452be/FLAG4d90fb926 [2025-01-09 08:29:05,478 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:29:05,479 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-50.i [2025-01-09 08:29:05,488 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/319e9a7cd/0e953765e52c42e199207d260b4452be/FLAG4d90fb926 [2025-01-09 08:29:05,504 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/319e9a7cd/0e953765e52c42e199207d260b4452be [2025-01-09 08:29:05,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:29:05,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:29:05,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:29:05,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:29:05,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:29:05,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:29:05" (1/1) ... [2025-01-09 08:29:05,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@386413f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:05, skipping insertion in model container [2025-01-09 08:29:05,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:29:05" (1/1) ... [2025-01-09 08:29:05,529 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:29:05,626 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-50.i[919,932] [2025-01-09 08:29:05,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:29:05,698 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:29:05,708 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-50.i[919,932] [2025-01-09 08:29:05,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:29:05,753 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:29:05,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:05 WrapperNode [2025-01-09 08:29:05,754 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:29:05,755 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:29:05,755 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:29:05,755 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:29:05,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:05" (1/1) ... [2025-01-09 08:29:05,766 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:05" (1/1) ... [2025-01-09 08:29:05,789 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2025-01-09 08:29:05,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:29:05,794 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:29:05,794 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:29:05,794 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:29:05,800 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:05" (1/1) ... [2025-01-09 08:29:05,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:05" (1/1) ... [2025-01-09 08:29:05,806 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:05" (1/1) ... [2025-01-09 08:29:05,814 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-01-09 08:29:05,815 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:05" (1/1) ... [2025-01-09 08:29:05,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:05" (1/1) ... [2025-01-09 08:29:05,820 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:05" (1/1) ... [2025-01-09 08:29:05,821 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:05" (1/1) ... [2025-01-09 08:29:05,828 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:05" (1/1) ... [2025-01-09 08:29:05,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:05" (1/1) ... [2025-01-09 08:29:05,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:05" (1/1) ... [2025-01-09 08:29:05,835 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:29:05,836 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:29:05,836 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:29:05,836 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:29:05,838 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:05" (1/1) ... [2025-01-09 08:29:05,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:29:05,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:29:05,866 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 08:29:05,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 08:29:05,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:29:05,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 08:29:05,888 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:29:05,888 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:29:05,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:29:05,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:29:05,938 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:29:05,939 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:29:06,231 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 08:29:06,231 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:29:06,237 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:29:06,237 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:29:06,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:29:06 BoogieIcfgContainer [2025-01-09 08:29:06,238 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:29:06,239 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:29:06,239 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:29:06,243 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:29:06,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:29:05" (1/3) ... [2025-01-09 08:29:06,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4813fa0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:29:06, skipping insertion in model container [2025-01-09 08:29:06,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:05" (2/3) ... [2025-01-09 08:29:06,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4813fa0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:29:06, skipping insertion in model container [2025-01-09 08:29:06,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:29:06" (3/3) ... [2025-01-09 08:29:06,244 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-50.i [2025-01-09 08:29:06,253 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:29:06,254 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-50.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:29:06,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:29:06,293 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;@6c78f418, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:29:06,293 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:29:06,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 08:29:06,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 08:29:06,301 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:29:06,301 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:29:06,302 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:29:06,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:29:06,306 INFO L85 PathProgramCache]: Analyzing trace with hash -73823671, now seen corresponding path program 1 times [2025-01-09 08:29:06,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:29:06,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1797963193] [2025-01-09 08:29:06,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:29:06,317 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-01-09 08:29:06,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:29:06,319 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-01-09 08:29:06,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 08:29:06,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 08:29:06,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 08:29:06,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:29:06,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:29:06,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:29:06,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:29:06,644 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2025-01-09 08:29:06,644 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:29:06,645 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:29:06,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1797963193] [2025-01-09 08:29:06,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1797963193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:29:06,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:29:06,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 08:29:06,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991250509] [2025-01-09 08:29:06,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:29:06,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:29:06,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:29:06,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:29:06,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:29:06,664 INFO L87 Difference]: Start difference. First operand has 59 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 08:29:06,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:29:06,682 INFO L93 Difference]: Finished difference Result 111 states and 189 transitions. [2025-01-09 08:29:06,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:29:06,683 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 128 [2025-01-09 08:29:06,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:29:06,686 INFO L225 Difference]: With dead ends: 111 [2025-01-09 08:29:06,686 INFO L226 Difference]: Without dead ends: 55 [2025-01-09 08:29:06,688 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-01-09 08:29:06,692 INFO L435 NwaCegarLoop]: 80 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, 80 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-01-09 08:29:06,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:29:06,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-09 08:29:06,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-01-09 08:29:06,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 08:29:06,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2025-01-09 08:29:06,724 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 128 [2025-01-09 08:29:06,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:29:06,725 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2025-01-09 08:29:06,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 08:29:06,725 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2025-01-09 08:29:06,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 08:29:06,729 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:29:06,729 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:29:06,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 08:29:06,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-01-09 08:29:06,930 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:29:06,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:29:06,931 INFO L85 PathProgramCache]: Analyzing trace with hash -252810227, now seen corresponding path program 1 times [2025-01-09 08:29:06,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:29:06,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256698828] [2025-01-09 08:29:06,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:29:06,931 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-01-09 08:29:06,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:29:06,934 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-01-09 08:29:06,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 08:29:06,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 08:29:07,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 08:29:07,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:29:07,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:29:07,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 08:29:07,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:29:07,249 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 08:29:07,250 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:29:07,250 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:29:07,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256698828] [2025-01-09 08:29:07,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256698828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:29:07,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:29:07,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 08:29:07,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877521898] [2025-01-09 08:29:07,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:29:07,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 08:29:07,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:29:07,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 08:29:07,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 08:29:07,252 INFO L87 Difference]: Start difference. First operand 55 states and 80 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 08:29:07,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:29:07,414 INFO L93 Difference]: Finished difference Result 148 states and 220 transitions. [2025-01-09 08:29:07,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 08:29:07,430 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 128 [2025-01-09 08:29:07,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:29:07,432 INFO L225 Difference]: With dead ends: 148 [2025-01-09 08:29:07,432 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 08:29:07,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 126 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-01-09 08:29:07,437 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 72 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:29:07,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 201 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:29:07,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 08:29:07,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 55. [2025-01-09 08:29:07,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 08:29:07,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2025-01-09 08:29:07,446 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 128 [2025-01-09 08:29:07,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:29:07,447 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 79 transitions. [2025-01-09 08:29:07,447 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 08:29:07,447 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2025-01-09 08:29:07,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 08:29:07,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:29:07,449 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:29:07,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 08:29:07,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-01-09 08:29:07,650 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:29:07,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:29:07,651 INFO L85 PathProgramCache]: Analyzing trace with hash -195551925, now seen corresponding path program 1 times [2025-01-09 08:29:07,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:29:07,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082110190] [2025-01-09 08:29:07,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:29:07,653 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-01-09 08:29:07,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:29:07,657 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-01-09 08:29:07,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 08:29:07,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 08:29:07,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 08:29:07,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:29:07,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:29:07,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 08:29:07,959 INFO L279 TraceCheckSpWp]: Computing forward predicates...