./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-91.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_variablewrapping_normal_file-91.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 0101e68cd769ee86bcffa133d99498f55c4b5621d6fd69302f6e63627d783b8c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:16:23,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:16:23,824 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:16:23,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:16:23,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:16:23,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:16:23,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:16:23,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:16:23,858 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:16:23,858 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:16:23,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:16:23,862 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:16:23,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:16:23,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:16:23,862 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:16:23,862 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:16:23,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:16:23,862 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:16:23,862 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:16:23,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:16:23,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:16:23,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:16:23,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:16:23,862 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:16:23,862 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:16:23,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:16:23,862 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:16:23,862 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:16:23,862 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:16:23,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:16:23,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:16:23,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:16:23,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:16:23,863 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:16:23,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:16:23,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:16:23,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:16:23,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:16:23,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:16:23,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:16:23,863 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:16:23,863 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:16:23,863 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:16:23,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:16:23,863 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:16:23,863 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:16:23,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:16:23,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:16:23,863 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 -> 0101e68cd769ee86bcffa133d99498f55c4b5621d6fd69302f6e63627d783b8c [2025-01-09 15:16:24,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:16:24,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:16:24,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:16:24,105 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:16:24,106 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:16:24,106 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-91.i [2025-01-09 15:16:25,274 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df9345b5b/4e9ca5258b7d4922890f0673b2265521/FLAGdec794859 [2025-01-09 15:16:25,529 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:16:25,530 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-91.i [2025-01-09 15:16:25,553 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df9345b5b/4e9ca5258b7d4922890f0673b2265521/FLAGdec794859 [2025-01-09 15:16:25,871 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df9345b5b/4e9ca5258b7d4922890f0673b2265521 [2025-01-09 15:16:25,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:16:25,876 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:16:25,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:16:25,881 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:16:25,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:16:25,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:16:25" (1/1) ... [2025-01-09 15:16:25,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6812484a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:25, skipping insertion in model container [2025-01-09 15:16:25,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:16:25" (1/1) ... [2025-01-09 15:16:25,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:16:26,032 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_variablewrapping_normal_file-91.i[913,926] [2025-01-09 15:16:26,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:16:26,068 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:16:26,074 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_variablewrapping_normal_file-91.i[913,926] [2025-01-09 15:16:26,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:16:26,093 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:16:26,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:26 WrapperNode [2025-01-09 15:16:26,094 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:16:26,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:16:26,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:16:26,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:16:26,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:26" (1/1) ... [2025-01-09 15:16:26,103 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:26" (1/1) ... [2025-01-09 15:16:26,115 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2025-01-09 15:16:26,115 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:16:26,116 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:16:26,116 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:16:26,116 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:16:26,121 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:26" (1/1) ... [2025-01-09 15:16:26,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:26" (1/1) ... [2025-01-09 15:16:26,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:26" (1/1) ... [2025-01-09 15:16:26,129 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 15:16:26,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:26" (1/1) ... [2025-01-09 15:16:26,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:26" (1/1) ... [2025-01-09 15:16:26,136 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:26" (1/1) ... [2025-01-09 15:16:26,136 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:26" (1/1) ... [2025-01-09 15:16:26,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:26" (1/1) ... [2025-01-09 15:16:26,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:26" (1/1) ... [2025-01-09 15:16:26,143 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:26" (1/1) ... [2025-01-09 15:16:26,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:16:26,151 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:16:26,152 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:16:26,152 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:16:26,152 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:26" (1/1) ... [2025-01-09 15:16:26,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:16:26,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:16:26,174 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 15:16:26,176 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 15:16:26,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:16:26,190 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:16:26,190 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:16:26,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:16:26,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:16:26,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:16:26,231 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:16:26,232 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:16:26,354 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 15:16:26,354 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:16:26,362 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:16:26,363 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:16:26,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:16:26 BoogieIcfgContainer [2025-01-09 15:16:26,363 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:16:26,364 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:16:26,364 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:16:26,367 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:16:26,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:16:25" (1/3) ... [2025-01-09 15:16:26,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb317f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:16:26, skipping insertion in model container [2025-01-09 15:16:26,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:26" (2/3) ... [2025-01-09 15:16:26,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb317f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:16:26, skipping insertion in model container [2025-01-09 15:16:26,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:16:26" (3/3) ... [2025-01-09 15:16:26,369 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-91.i [2025-01-09 15:16:26,378 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:16:26,379 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-91.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:16:26,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:16:26,427 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;@53262f7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:16:26,427 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:16:26,429 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:16:26,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:16:26,435 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:16:26,436 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:16:26,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:16:26,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:16:26,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2141342555, now seen corresponding path program 1 times [2025-01-09 15:16:26,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:16:26,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73527528] [2025-01-09 15:16:26,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:16:26,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:16:26,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:16:26,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:16:26,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:16:26,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:16:26,611 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-01-09 15:16:26,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:16:26,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73527528] [2025-01-09 15:16:26,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73527528] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:16:26,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180624380] [2025-01-09 15:16:26,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:16:26,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:16:26,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:16:26,615 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 15:16:26,616 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 15:16:26,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:16:26,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:16:26,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:16:26,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:16:26,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:16:26,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:16:26,742 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-01-09 15:16:26,744 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:16:26,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180624380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:16:26,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:16:26,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:16:26,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382735683] [2025-01-09 15:16:26,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:16:26,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:16:26,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:16:26,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:16:26,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:16:26,765 INFO L87 Difference]: Start difference. First operand has 52 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:16:26,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:16:26,788 INFO L93 Difference]: Finished difference Result 98 states and 166 transitions. [2025-01-09 15:16:26,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:16:26,789 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 108 [2025-01-09 15:16:26,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:16:26,793 INFO L225 Difference]: With dead ends: 98 [2025-01-09 15:16:26,793 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 15:16:26,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:16:26,797 INFO L435 NwaCegarLoop]: 72 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, 72 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 15:16:26,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:16:26,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 15:16:26,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 15:16:26,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:16:26,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 72 transitions. [2025-01-09 15:16:26,834 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 72 transitions. Word has length 108 [2025-01-09 15:16:26,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:16:26,835 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 72 transitions. [2025-01-09 15:16:26,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:16:26,835 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 72 transitions. [2025-01-09 15:16:26,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:16:26,839 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:16:26,839 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:16:26,846 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 15:16:27,040 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 15:16:27,041 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:16:27,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:16:27,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1715978261, now seen corresponding path program 1 times [2025-01-09 15:16:27,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:16:27,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902711007] [2025-01-09 15:16:27,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:16:27,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:16:27,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:16:27,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:16:27,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:16:27,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:16:45,383 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:16:45,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:16:45,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902711007] [2025-01-09 15:16:45,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902711007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:16:45,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:16:45,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:16:45,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283231238] [2025-01-09 15:16:45,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:16:45,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:16:45,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:16:45,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:16:45,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:16:45,386 INFO L87 Difference]: Start difference. First operand 49 states and 72 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:16:54,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:16:54,360 INFO L93 Difference]: Finished difference Result 118 states and 154 transitions. [2025-01-09 15:16:54,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:16:54,360 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2025-01-09 15:16:54,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:16:54,365 INFO L225 Difference]: With dead ends: 118 [2025-01-09 15:16:54,366 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 15:16:54,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:16:54,369 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 78 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:16:54,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 423 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 15:16:54,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 15:16:54,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 71. [2025-01-09 15:16:54,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.34) internal successors, (67), 51 states have internal predecessors, (67), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:16:54,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 103 transitions. [2025-01-09 15:16:54,385 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 103 transitions. Word has length 108 [2025-01-09 15:16:54,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:16:54,385 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 103 transitions. [2025-01-09 15:16:54,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:16:54,386 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 103 transitions. [2025-01-09 15:16:54,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:16:54,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:16:54,390 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:16:54,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:16:54,391 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:16:54,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:16:54,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1658719959, now seen corresponding path program 1 times [2025-01-09 15:16:54,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:16:54,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709614460] [2025-01-09 15:16:54,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:16:54,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:16:54,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:16:54,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:16:54,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:16:54,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:17:02,685 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:17:02,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:17:02,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709614460] [2025-01-09 15:17:02,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709614460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:17:02,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:17:02,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:17:02,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808685327] [2025-01-09 15:17:02,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:17:02,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:17:02,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:17:02,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:17:02,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:17:02,689 INFO L87 Difference]: Start difference. First operand 71 states and 103 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:17:06,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:17:06,405 INFO L93 Difference]: Finished difference Result 172 states and 240 transitions. [2025-01-09 15:17:06,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:17:06,408 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2025-01-09 15:17:06,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:17:06,410 INFO L225 Difference]: With dead ends: 172 [2025-01-09 15:17:06,410 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 15:17:06,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:17:06,411 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 82 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:17:06,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 342 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 15:17:06,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 15:17:06,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 72. [2025-01-09 15:17:06,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 52 states have internal predecessors, (68), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:17:06,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 104 transitions. [2025-01-09 15:17:06,419 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 104 transitions. Word has length 108 [2025-01-09 15:17:06,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:17:06,419 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 104 transitions. [2025-01-09 15:17:06,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:17:06,419 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 104 transitions. [2025-01-09 15:17:06,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:17:06,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:17:06,420 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:17:06,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:17:06,420 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:17:06,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:17:06,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1769642409, now seen corresponding path program 1 times [2025-01-09 15:17:06,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:17:06,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499431306] [2025-01-09 15:17:06,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:17:06,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:17:06,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:17:06,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:17:06,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:17:06,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:17:06,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [201760325] [2025-01-09 15:17:06,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:17:06,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:17:06,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:17:06,476 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 15:17:06,478 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 15:17:06,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:17:06,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:17:06,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:17:06,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:17:06,576 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:17:06,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:17:06,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:17:06,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:17:06,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:17:06,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:17:06,628 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:17:06,629 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:17:06,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 15:17:06,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:17:06,833 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 15:17:06,877 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:17:06,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:17:06 BoogieIcfgContainer [2025-01-09 15:17:06,884 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:17:06,884 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:17:06,884 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:17:06,884 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:17:06,885 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:16:26" (3/4) ... [2025-01-09 15:17:06,887 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:17:06,891 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:17:06,892 INFO L158 Benchmark]: Toolchain (without parser) took 41015.69ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 111.4MB in the beginning and 240.7MB in the end (delta: -129.4MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2025-01-09 15:17:06,892 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:17:06,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.47ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 98.5MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:17:06,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.50ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 96.7MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:17:06,892 INFO L158 Benchmark]: Boogie Preprocessor took 31.02ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 94.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:17:06,893 INFO L158 Benchmark]: RCFGBuilder took 211.60ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 80.1MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:17:06,893 INFO L158 Benchmark]: TraceAbstraction took 40519.53ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 79.2MB in the beginning and 240.8MB in the end (delta: -161.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:17:06,893 INFO L158 Benchmark]: Witness Printer took 6.64ms. Allocated memory is still 293.6MB. Free memory was 240.8MB in the beginning and 240.7MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:17:06,894 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.16ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.47ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 98.5MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.50ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 96.7MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.02ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 94.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 211.60ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 80.1MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 40519.53ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 79.2MB in the beginning and 240.8MB in the end (delta: -161.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.64ms. Allocated memory is still 293.6MB. Free memory was 240.8MB in the beginning and 240.7MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 39, overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someUnaryDOUBLEoperation at line 28, overapproximation of someBinaryDOUBLEComparisonOperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 100000000; [L23] float var_1_2 = 49.25; [L24] unsigned long int var_1_3 = 64; [L25] unsigned long int var_1_4 = 64; [L26] signed short int var_1_5 = 1; [L27] float var_1_6 = 8.4; [L28] float var_1_7 = -0.25; [L29] signed short int var_1_8 = -4; [L30] unsigned long int var_1_9 = 64; [L31] unsigned long int var_1_10 = 16; [L32] unsigned long int var_1_11 = 10; [L33] signed short int var_1_12 = 100; [L34] signed short int var_1_14 = 128; [L35] signed short int var_1_15 = 10; VAL [isInitial=0, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=197/4, var_1_3=64, var_1_4=64, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L104] isInitial = 1 [L105] FCALL initially() [L107] FCALL updateLastVariables() [L108] CALL updateVariables() [L69] var_1_2 = __VERIFIER_nondet_float() [L70] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=64, var_1_4=64, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=64, var_1_4=64, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L70] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=64, var_1_4=64, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L71] var_1_3 = __VERIFIER_nondet_ulong() [L72] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_4=64, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_4=64, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L72] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_4=64, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L73] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=64, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=64, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L73] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=64, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L74] var_1_4 = __VERIFIER_nondet_ulong() [L75] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L75] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L76] CALL assume_abort_if_not(var_1_4 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L76] RET assume_abort_if_not(var_1_4 <= 4294967294) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L77] var_1_6 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-4, var_1_9=64] [L78] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-4, var_1_9=64] [L79] var_1_7 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-4, var_1_9=64] [L80] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-4, var_1_9=64] [L81] var_1_8 = __VERIFIER_nondet_short() [L82] CALL assume_abort_if_not(var_1_8 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L82] RET assume_abort_if_not(var_1_8 >= -32767) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L83] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L83] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L84] var_1_10 = __VERIFIER_nondet_ulong() [L85] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L85] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L86] CALL assume_abort_if_not(var_1_10 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L86] RET assume_abort_if_not(var_1_10 <= 4294967294) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L87] var_1_11 = __VERIFIER_nondet_ulong() [L88] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L88] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L89] CALL assume_abort_if_not(var_1_11 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L89] RET assume_abort_if_not(var_1_11 <= 4294967294) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L90] var_1_14 = __VERIFIER_nondet_short() [L91] CALL assume_abort_if_not(var_1_14 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L91] RET assume_abort_if_not(var_1_14 >= -1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L92] CALL assume_abort_if_not(var_1_14 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L92] RET assume_abort_if_not(var_1_14 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=10, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L93] var_1_15 = __VERIFIER_nondet_short() [L94] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L94] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L95] CALL assume_abort_if_not(var_1_15 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L95] RET assume_abort_if_not(var_1_15 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L108] RET updateVariables() [L109] CALL step() [L39] COND FALSE !(var_1_2 >= 50.4f) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=1, var_1_8=-32767, var_1_9=64] [L42] COND FALSE !(var_1_3 == (var_1_1 * var_1_4)) [L49] var_1_5 = var_1_8 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=-32767, var_1_8=-32767, var_1_9=64] [L51] COND TRUE ! (var_1_4 < var_1_3) [L52] var_1_9 = ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))))) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=-32767, var_1_8=-32767, var_1_9=0] [L56] COND FALSE !(var_1_10 > var_1_9) [L65] var_1_12 = var_1_15 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=-32767, var_1_8=-32767, var_1_9=0] [L109] RET step() [L110] CALL, EXPR property() [L100-L101] return ((((var_1_2 >= 50.4f) ? (var_1_1 == ((unsigned long int) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : 1) && ((var_1_3 == (var_1_1 * var_1_4)) ? ((var_1_2 >= (var_1_6 + var_1_7)) ? (var_1_5 == ((signed short int) var_1_8)) : (var_1_5 == ((signed short int) 32))) : (var_1_5 == ((signed short int) var_1_8)))) && ((! (var_1_4 < var_1_3)) ? (var_1_9 == ((unsigned long int) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))))) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))))) : (var_1_9 == ((unsigned long int) ((((var_1_11) > (var_1_10)) ? (var_1_11) : (var_1_10))))))) && ((var_1_10 > var_1_9) ? ((63.1 >= var_1_7) ? ((var_1_7 >= var_1_2) ? (var_1_12 == ((signed short int) (var_1_14 - var_1_15))) : (var_1_12 == ((signed short int) var_1_14))) : 1) : (var_1_12 == ((signed short int) var_1_15))) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=-32767, var_1_8=-32767, var_1_9=0] [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=-32767, var_1_8=-32767, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_3=-12784901887, var_1_4=4394967297, var_1_5=-32767, var_1_8=-32767, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.4s, OverallIterations: 4, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 160 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 160 mSDsluCounter, 837 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 606 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 165 IncrementalHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 231 mSDtfsCounter, 165 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 19.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=3, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 77 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 26.5s InterpolantComputationTime, 648 NumberOfCodeBlocks, 648 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 428 ConstructedInterpolants, 0 QuantifiedInterpolants, 987 SizeOfPredicates, 0 NumberOfNonLiveVariables, 245 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 2144/2176 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 15:17:06,922 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_variablewrapping_normal_file-91.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 0101e68cd769ee86bcffa133d99498f55c4b5621d6fd69302f6e63627d783b8c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:17:08,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:17:08,988 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:17:09,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:17:09,008 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:17:09,036 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:17:09,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:17:09,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:17:09,040 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:17:09,040 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:17:09,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:17:09,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:17:09,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:17:09,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:17:09,045 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:17:09,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:17:09,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:17:09,045 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:17:09,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:17:09,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:17:09,045 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:17:09,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:17:09,045 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:17:09,045 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:17:09,046 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:17:09,046 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:17:09,046 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:17:09,046 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:17:09,046 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:17:09,046 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:17:09,046 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:17:09,047 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:17:09,047 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:17:09,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:17:09,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:17:09,047 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:17:09,047 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:17:09,047 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:17:09,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:17:09,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:17:09,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:17:09,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:17:09,048 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:17:09,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:17:09,048 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:17:09,048 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:17:09,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:17:09,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:17:09,049 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:17:09,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:17:09,049 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 -> 0101e68cd769ee86bcffa133d99498f55c4b5621d6fd69302f6e63627d783b8c [2025-01-09 15:17:09,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:17:09,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:17:09,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:17:09,267 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:17:09,267 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:17:09,268 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-91.i [2025-01-09 15:17:10,437 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05fcbc646/beebcca569c84412bd2b12878d9ca6f5/FLAG157de050e [2025-01-09 15:17:10,595 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:17:10,595 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-91.i [2025-01-09 15:17:10,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05fcbc646/beebcca569c84412bd2b12878d9ca6f5/FLAG157de050e [2025-01-09 15:17:10,992 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05fcbc646/beebcca569c84412bd2b12878d9ca6f5 [2025-01-09 15:17:10,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:17:10,997 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:17:10,998 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:17:10,998 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:17:11,001 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:17:11,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:17:10" (1/1) ... [2025-01-09 15:17:11,002 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207c4489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:11, skipping insertion in model container [2025-01-09 15:17:11,002 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:17:10" (1/1) ... [2025-01-09 15:17:11,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:17:11,102 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_variablewrapping_normal_file-91.i[913,926] [2025-01-09 15:17:11,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:17:11,142 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:17:11,150 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_variablewrapping_normal_file-91.i[913,926] [2025-01-09 15:17:11,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:17:11,177 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:17:11,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:11 WrapperNode [2025-01-09 15:17:11,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:17:11,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:17:11,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:17:11,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:17:11,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:11" (1/1) ... [2025-01-09 15:17:11,188 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:11" (1/1) ... [2025-01-09 15:17:11,201 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2025-01-09 15:17:11,202 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:17:11,202 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:17:11,202 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:17:11,202 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:17:11,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:11" (1/1) ... [2025-01-09 15:17:11,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:11" (1/1) ... [2025-01-09 15:17:11,210 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:11" (1/1) ... [2025-01-09 15:17:11,221 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 15:17:11,221 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:11" (1/1) ... [2025-01-09 15:17:11,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:11" (1/1) ... [2025-01-09 15:17:11,230 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:11" (1/1) ... [2025-01-09 15:17:11,231 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:11" (1/1) ... [2025-01-09 15:17:11,236 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:11" (1/1) ... [2025-01-09 15:17:11,237 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:11" (1/1) ... [2025-01-09 15:17:11,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:11" (1/1) ... [2025-01-09 15:17:11,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:17:11,244 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:17:11,244 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:17:11,244 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:17:11,245 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:11" (1/1) ... [2025-01-09 15:17:11,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:17:11,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:17:11,281 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 15:17:11,289 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 15:17:11,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:17:11,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:17:11,306 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:17:11,306 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:17:11,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:17:11,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:17:11,373 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:17:11,375 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:17:11,961 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 15:17:11,961 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:17:11,971 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:17:11,971 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:17:11,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:17:11 BoogieIcfgContainer [2025-01-09 15:17:11,972 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:17:11,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:17:11,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:17:11,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:17:11,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:17:10" (1/3) ... [2025-01-09 15:17:11,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17afb843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:17:11, skipping insertion in model container [2025-01-09 15:17:11,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:11" (2/3) ... [2025-01-09 15:17:11,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17afb843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:17:11, skipping insertion in model container [2025-01-09 15:17:11,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:17:11" (3/3) ... [2025-01-09 15:17:11,978 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-91.i [2025-01-09 15:17:11,986 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:17:11,987 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-91.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:17:12,023 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:17:12,033 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;@534d1a30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:17:12,033 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:17:12,036 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:17:12,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:17:12,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:17:12,041 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:17:12,042 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:17:12,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:17:12,045 INFO L85 PathProgramCache]: Analyzing trace with hash -2141342555, now seen corresponding path program 1 times [2025-01-09 15:17:12,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:17:12,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656212311] [2025-01-09 15:17:12,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:17:12,052 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 15:17:12,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:17:12,055 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 15:17:12,056 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 15:17:12,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:17:12,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:17:12,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:17:12,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:17:12,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:17:12,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:17:12,262 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2025-01-09 15:17:12,263 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:17:12,263 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:17:12,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656212311] [2025-01-09 15:17:12,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656212311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:17:12,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:17:12,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:17:12,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436963653] [2025-01-09 15:17:12,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:17:12,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:17:12,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:17:12,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:17:12,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:17:12,285 INFO L87 Difference]: Start difference. First operand has 52 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:17:12,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:17:12,299 INFO L93 Difference]: Finished difference Result 98 states and 166 transitions. [2025-01-09 15:17:12,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:17:12,300 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 108 [2025-01-09 15:17:12,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:17:12,305 INFO L225 Difference]: With dead ends: 98 [2025-01-09 15:17:12,305 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 15:17:12,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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 15:17:12,310 INFO L435 NwaCegarLoop]: 72 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, 72 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 15:17:12,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:17:12,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 15:17:12,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 15:17:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:17:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 72 transitions. [2025-01-09 15:17:12,363 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 72 transitions. Word has length 108 [2025-01-09 15:17:12,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:17:12,363 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 72 transitions. [2025-01-09 15:17:12,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:17:12,363 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 72 transitions. [2025-01-09 15:17:12,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:17:12,365 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:17:12,365 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:17:12,375 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 15:17:12,570 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 15:17:12,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:17:12,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:17:12,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1715978261, now seen corresponding path program 1 times [2025-01-09 15:17:12,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:17:12,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100800195] [2025-01-09 15:17:12,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:17:12,574 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 15:17:12,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:17:12,576 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 15:17:12,578 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 15:17:12,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:17:12,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:17:12,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:17:12,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:17:12,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 15:17:12,758 INFO L279 TraceCheckSpWp]: Computing forward predicates...