./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 493c4a8c013a7a4203725139ad68ff56674f93b6f02b61f7e89a20a5fce278ce --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:01:42,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:01:42,983 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:01:42,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:01:42,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:01:43,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:01:43,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:01:43,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:01:43,022 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:01:43,023 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:01:43,023 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:01:43,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:01:43,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:01:43,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:01:43,025 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:01:43,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:01:43,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:01:43,026 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:01:43,027 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:01:43,027 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:01:43,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:01:43,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:01:43,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:01:43,029 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:01:43,029 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:01:43,029 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:01:43,030 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:01:43,030 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:01:43,031 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:01:43,031 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:01:43,031 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:01:43,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:01:43,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:01:43,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:01:43,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:01:43,033 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:01:43,033 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:01:43,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:01:43,034 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:01:43,034 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:01:43,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:01:43,035 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:01:43,035 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 493c4a8c013a7a4203725139ad68ff56674f93b6f02b61f7e89a20a5fce278ce [2024-10-24 11:01:43,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:01:43,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:01:43,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:01:43,330 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:01:43,331 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:01:43,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i [2024-10-24 11:01:44,802 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:01:45,034 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:01:45,034 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i [2024-10-24 11:01:45,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/542383b97/9faeea0fbc354df0a5f1029dff5e5a3e/FLAG0aaa7ca08 [2024-10-24 11:01:45,058 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/542383b97/9faeea0fbc354df0a5f1029dff5e5a3e [2024-10-24 11:01:45,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:01:45,063 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:01:45,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:01:45,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:01:45,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:01:45,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:01:45" (1/1) ... [2024-10-24 11:01:45,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2501ceb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:45, skipping insertion in model container [2024-10-24 11:01:45,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:01:45" (1/1) ... [2024-10-24 11:01:45,101 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:01:45,266 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i[913,926] [2024-10-24 11:01:45,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:01:45,343 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:01:45,354 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i[913,926] [2024-10-24 11:01:45,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:01:45,392 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:01:45,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:45 WrapperNode [2024-10-24 11:01:45,393 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:01:45,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:01:45,394 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:01:45,394 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:01:45,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:45" (1/1) ... [2024-10-24 11:01:45,409 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:45" (1/1) ... [2024-10-24 11:01:45,492 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-10-24 11:01:45,492 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:01:45,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:01:45,493 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:01:45,493 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:01:45,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:45" (1/1) ... [2024-10-24 11:01:45,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:45" (1/1) ... [2024-10-24 11:01:45,524 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:45" (1/1) ... [2024-10-24 11:01:45,552 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]. [2024-10-24 11:01:45,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:45" (1/1) ... [2024-10-24 11:01:45,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:45" (1/1) ... [2024-10-24 11:01:45,564 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:45" (1/1) ... [2024-10-24 11:01:45,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:45" (1/1) ... [2024-10-24 11:01:45,574 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:45" (1/1) ... [2024-10-24 11:01:45,576 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:45" (1/1) ... [2024-10-24 11:01:45,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:01:45,585 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:01:45,585 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:01:45,585 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:01:45,586 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:45" (1/1) ... [2024-10-24 11:01:45,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:01:45,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:01:45,624 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:01:45,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:01:45,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:01:45,676 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:01:45,677 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:01:45,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:01:45,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:01:45,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:01:45,753 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:01:45,754 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:01:45,994 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 11:01:45,995 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:01:46,035 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:01:46,036 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:01:46,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:01:46 BoogieIcfgContainer [2024-10-24 11:01:46,036 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:01:46,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:01:46,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:01:46,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:01:46,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:01:45" (1/3) ... [2024-10-24 11:01:46,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f7c4f46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:01:46, skipping insertion in model container [2024-10-24 11:01:46,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:45" (2/3) ... [2024-10-24 11:01:46,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f7c4f46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:01:46, skipping insertion in model container [2024-10-24 11:01:46,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:01:46" (3/3) ... [2024-10-24 11:01:46,047 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-11.i [2024-10-24 11:01:46,063 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:01:46,064 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:01:46,123 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:01:46,129 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;@768ec482, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:01:46,130 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:01:46,133 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 11:01:46,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 11:01:46,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:01:46,145 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:01:46,145 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:01:46,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:01:46,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1788450943, now seen corresponding path program 1 times [2024-10-24 11:01:46,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:01:46,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019444181] [2024-10-24 11:01:46,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:01:46,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:01:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:46,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:01:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:46,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:01:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:46,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:01:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:46,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 11:01:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:46,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 11:01:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:46,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 11:01:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:46,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 11:01:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:46,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 11:01:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:46,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 11:01:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:46,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:01:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:46,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:01:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:46,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 11:01:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:46,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 11:01:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:46,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 11:01:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:46,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 11:01:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:46,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:01:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 11:01:46,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:01:46,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019444181] [2024-10-24 11:01:46,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019444181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:01:46,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:01:46,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:01:46,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263197942] [2024-10-24 11:01:46,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:01:46,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:01:46,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:01:46,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:01:46,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:01:46,592 INFO L87 Difference]: Start difference. First operand has 48 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 11:01:46,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:01:46,644 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2024-10-24 11:01:46,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:01:46,647 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 100 [2024-10-24 11:01:46,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:01:46,655 INFO L225 Difference]: With dead ends: 93 [2024-10-24 11:01:46,655 INFO L226 Difference]: Without dead ends: 46 [2024-10-24 11:01:46,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:01:46,664 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:01:46,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:01:46,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-24 11:01:46,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-24 11:01:46,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 11:01:46,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 69 transitions. [2024-10-24 11:01:46,717 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 69 transitions. Word has length 100 [2024-10-24 11:01:46,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:01:46,719 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 69 transitions. [2024-10-24 11:01:46,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 11:01:46,719 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2024-10-24 11:01:46,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 11:01:46,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:01:46,726 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:01:46,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:01:46,727 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:01:46,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:01:46,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1112841215, now seen corresponding path program 1 times [2024-10-24 11:01:46,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:01:46,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637921377] [2024-10-24 11:01:46,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:01:46,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:01:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:47,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:01:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:47,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:01:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:47,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:01:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:47,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 11:01:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:47,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 11:01:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:47,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 11:01:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:47,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 11:01:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:47,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 11:01:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:47,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 11:01:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:47,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:01:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:47,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:01:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:47,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 11:01:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:47,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 11:01:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:47,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 11:01:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:47,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 11:01:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:47,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:01:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:47,229 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 11:01:47,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:01:47,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637921377] [2024-10-24 11:01:47,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637921377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:01:47,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:01:47,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:01:47,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775375692] [2024-10-24 11:01:47,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:01:47,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:01:47,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:01:47,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:01:47,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:01:47,239 INFO L87 Difference]: Start difference. First operand 46 states and 69 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 11:01:47,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:01:47,299 INFO L93 Difference]: Finished difference Result 136 states and 205 transitions. [2024-10-24 11:01:47,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:01:47,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2024-10-24 11:01:47,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:01:47,305 INFO L225 Difference]: With dead ends: 136 [2024-10-24 11:01:47,306 INFO L226 Difference]: Without dead ends: 91 [2024-10-24 11:01:47,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:01:47,309 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 35 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:01:47,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 122 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:01:47,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-24 11:01:47,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2024-10-24 11:01:47,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 11:01:47,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 135 transitions. [2024-10-24 11:01:47,339 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 135 transitions. Word has length 100 [2024-10-24 11:01:47,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:01:47,342 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 135 transitions. [2024-10-24 11:01:47,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 11:01:47,342 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 135 transitions. [2024-10-24 11:01:47,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 11:01:47,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:01:47,344 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:01:47,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:01:47,347 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:01:47,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:01:47,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1112900797, now seen corresponding path program 1 times [2024-10-24 11:01:47,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:01:47,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035906192] [2024-10-24 11:01:47,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:01:47,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:01:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:01:47,464 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:01:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:01:47,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:01:47,573 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:01:47,574 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:01:47,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:01:47,580 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 11:01:47,654 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:01:47,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:01:47 BoogieIcfgContainer [2024-10-24 11:01:47,659 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:01:47,659 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:01:47,659 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:01:47,660 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:01:47,660 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:01:46" (3/4) ... [2024-10-24 11:01:47,663 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:01:47,665 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:01:47,668 INFO L158 Benchmark]: Toolchain (without parser) took 2602.51ms. Allocated memory is still 165.7MB. Free memory was 95.7MB in the beginning and 83.0MB in the end (delta: 12.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 11:01:47,669 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 165.7MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:01:47,669 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.90ms. Allocated memory is still 165.7MB. Free memory was 95.5MB in the beginning and 80.9MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 11:01:47,669 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.54ms. Allocated memory is still 165.7MB. Free memory was 80.9MB in the beginning and 135.3MB in the end (delta: -54.4MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2024-10-24 11:01:47,670 INFO L158 Benchmark]: Boogie Preprocessor took 87.51ms. Allocated memory is still 165.7MB. Free memory was 135.3MB in the beginning and 130.5MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:01:47,670 INFO L158 Benchmark]: RCFGBuilder took 451.89ms. Allocated memory is still 165.7MB. Free memory was 130.5MB in the beginning and 110.8MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 11:01:47,670 INFO L158 Benchmark]: TraceAbstraction took 1620.37ms. Allocated memory is still 165.7MB. Free memory was 110.1MB in the beginning and 84.1MB in the end (delta: 26.0MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2024-10-24 11:01:47,671 INFO L158 Benchmark]: Witness Printer took 6.03ms. Allocated memory is still 165.7MB. Free memory was 84.1MB in the beginning and 83.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:01:47,677 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.19ms. Allocated memory is still 165.7MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.90ms. Allocated memory is still 165.7MB. Free memory was 95.5MB in the beginning and 80.9MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.54ms. Allocated memory is still 165.7MB. Free memory was 80.9MB in the beginning and 135.3MB in the end (delta: -54.4MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.51ms. Allocated memory is still 165.7MB. Free memory was 135.3MB in the beginning and 130.5MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 451.89ms. Allocated memory is still 165.7MB. Free memory was 130.5MB in the beginning and 110.8MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1620.37ms. Allocated memory is still 165.7MB. Free memory was 110.1MB in the beginning and 84.1MB in the end (delta: 26.0MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * Witness Printer took 6.03ms. Allocated memory is still 165.7MB. Free memory was 84.1MB in the beginning and 83.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L23] double var_1_2 = 50.75; [L24] double var_1_3 = 7.675; [L25] signed char var_1_7 = 10; [L26] float var_1_8 = 32.5; [L27] float var_1_9 = 1000000.7; [L28] float var_1_10 = 2.4; [L29] unsigned char var_1_11 = 1; [L30] unsigned char var_1_12 = 1; [L31] unsigned char var_1_13 = 1; [L32] unsigned char var_1_14 = 5; [L33] unsigned char var_1_15 = 200; [L34] unsigned char var_1_16 = 10; [L35] unsigned char var_1_17 = 1; [L36] unsigned char last_1_var_1_11 = 1; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] CALL updateLastVariables() [L97] last_1_var_1_11 = var_1_11 [L107] RET updateLastVariables() [L108] CALL updateVariables() [L69] var_1_2 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_3=307/40, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_3=307/40, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L70] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_3=307/40, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L71] var_1_3 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L72] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L73] var_1_7 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2, var_1_9=10000007/10] [L74] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2, var_1_9=10000007/10] [L75] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2, var_1_9=10000007/10] [L75] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2, var_1_9=10000007/10] [L76] var_1_9 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L77] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L78] var_1_10 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L79] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L80] var_1_12 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L81] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L82] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L82] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L83] var_1_13 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L84] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L85] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L85] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L86] var_1_15 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L87] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L88] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L88] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L89] var_1_16 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L90] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L91] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=6, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=6, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L91] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=6, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L92] var_1_17 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=6, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=6, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L93] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=6, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L94] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=6, var_1_17=6, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=6, var_1_17=6, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L94] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=6, var_1_17=6, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L108] RET updateVariables() [L109] CALL step() [L40] COND FALSE !(var_1_3 >= var_1_2) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=6, var_1_17=6, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L49] COND FALSE !(var_1_8 <= var_1_8) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=6, var_1_17=6, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L52] unsigned char stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=6, var_1_17=6, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L53] COND FALSE !((var_1_2 - 5.25) < (var_1_8 * (var_1_8 * 199.4))) VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=6, var_1_17=6, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L62] COND FALSE !(! var_1_11) [L65] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=6, var_1_15=254, var_1_16=6, var_1_17=6, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L109] RET step() [L110] CALL, EXPR property() [L100-L101] return (((((var_1_2 - 5.25) < (var_1_8 * (var_1_8 * 199.4))) ? ((var_1_11 && var_1_11) ? ((var_1_8 < var_1_8) ? (var_1_1 == ((signed char) var_1_7)) : (var_1_1 == ((signed char) var_1_7))) : 1) : 1) && ((var_1_3 >= var_1_2) ? (last_1_var_1_11 ? ((! last_1_var_1_11) ? (var_1_8 == ((float) ((((var_1_9) > ((10.25f + var_1_10))) ? (var_1_9) : ((10.25f + var_1_10)))))) : (var_1_8 == ((float) var_1_9))) : 1) : 1)) && ((var_1_8 <= var_1_8) ? (var_1_11 == ((unsigned char) (var_1_12 || var_1_13))) : 1)) && ((! var_1_11) ? (var_1_14 == ((unsigned char) ((((((((var_1_15) < (((((var_1_16) > (5)) ? (var_1_16) : (5))))) ? (var_1_15) : (((((var_1_16) > (5)) ? (var_1_16) : (5))))))) < (var_1_17)) ? (((((var_1_15) < (((((var_1_16) > (5)) ? (var_1_16) : (5))))) ? (var_1_15) : (((((var_1_16) > (5)) ? (var_1_16) : (5))))))) : (var_1_17))))) : (var_1_14 == ((unsigned char) var_1_16))) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=6, var_1_15=254, var_1_16=6, var_1_17=6, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=6, var_1_15=254, var_1_16=6, var_1_17=6, var_1_1=-16, var_1_7=-127, var_1_8=65/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 188 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18 IncrementalHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 128 mSDtfsCounter, 18 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 262 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 960/960 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:01:47,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 493c4a8c013a7a4203725139ad68ff56674f93b6f02b61f7e89a20a5fce278ce --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:01:49,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:01:49,971 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:01:49,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:01:49,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:01:49,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:01:49,998 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:01:49,998 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:01:49,998 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:01:49,999 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:01:49,999 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:01:49,999 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:01:50,000 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:01:50,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:01:50,003 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:01:50,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:01:50,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:01:50,004 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:01:50,004 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:01:50,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:01:50,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:01:50,007 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:01:50,007 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:01:50,008 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:01:50,008 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:01:50,008 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:01:50,009 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:01:50,009 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:01:50,009 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:01:50,010 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:01:50,010 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:01:50,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:01:50,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:01:50,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:01:50,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:01:50,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:01:50,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:01:50,013 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:01:50,014 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:01:50,014 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:01:50,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:01:50,017 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:01:50,017 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:01:50,017 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:01:50,017 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:01:50,017 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 493c4a8c013a7a4203725139ad68ff56674f93b6f02b61f7e89a20a5fce278ce [2024-10-24 11:01:50,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:01:50,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:01:50,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:01:50,389 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:01:50,390 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:01:50,392 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i [2024-10-24 11:01:52,001 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:01:52,206 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:01:52,207 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i [2024-10-24 11:01:52,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e96c87d02/c168d3a5bef346bab94b8c929e6d1242/FLAG4ad4c11b8 [2024-10-24 11:01:52,228 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e96c87d02/c168d3a5bef346bab94b8c929e6d1242 [2024-10-24 11:01:52,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:01:52,231 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:01:52,232 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:01:52,232 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:01:52,237 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:01:52,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:01:52" (1/1) ... [2024-10-24 11:01:52,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@744b01b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:52, skipping insertion in model container [2024-10-24 11:01:52,238 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:01:52" (1/1) ... [2024-10-24 11:01:52,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:01:52,422 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i[913,926] [2024-10-24 11:01:52,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:01:52,494 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:01:52,506 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i[913,926] [2024-10-24 11:01:52,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:01:52,569 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:01:52,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:52 WrapperNode [2024-10-24 11:01:52,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:01:52,571 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:01:52,571 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:01:52,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:01:52,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:52" (1/1) ... [2024-10-24 11:01:52,596 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:52" (1/1) ... [2024-10-24 11:01:52,629 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2024-10-24 11:01:52,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:01:52,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:01:52,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:01:52,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:01:52,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:52" (1/1) ... [2024-10-24 11:01:52,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:52" (1/1) ... [2024-10-24 11:01:52,646 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:52" (1/1) ... [2024-10-24 11:01:52,676 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]. [2024-10-24 11:01:52,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:52" (1/1) ... [2024-10-24 11:01:52,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:52" (1/1) ... [2024-10-24 11:01:52,691 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:52" (1/1) ... [2024-10-24 11:01:52,694 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:52" (1/1) ... [2024-10-24 11:01:52,700 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:52" (1/1) ... [2024-10-24 11:01:52,702 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:52" (1/1) ... [2024-10-24 11:01:52,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:01:52,713 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:01:52,713 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:01:52,713 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:01:52,714 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:52" (1/1) ... [2024-10-24 11:01:52,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:01:52,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:01:52,749 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:01:52,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:01:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:01:52,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:01:52,800 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:01:52,800 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:01:52,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:01:52,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:01:52,889 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:01:52,892 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:02:04,228 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 11:02:04,229 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:02:04,262 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:02:04,262 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:02:04,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:02:04 BoogieIcfgContainer [2024-10-24 11:02:04,262 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:02:04,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:02:04,276 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:02:04,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:02:04,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:01:52" (1/3) ... [2024-10-24 11:02:04,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170ef49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:02:04, skipping insertion in model container [2024-10-24 11:02:04,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:01:52" (2/3) ... [2024-10-24 11:02:04,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170ef49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:02:04, skipping insertion in model container [2024-10-24 11:02:04,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:02:04" (3/3) ... [2024-10-24 11:02:04,287 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-11.i [2024-10-24 11:02:04,301 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:02:04,302 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:02:04,349 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:02:04,355 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;@3c0fb992, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:02:04,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:02:04,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 11:02:04,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 11:02:04,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:02:04,374 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:02:04,374 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:02:04,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:02:04,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1788450943, now seen corresponding path program 1 times [2024-10-24 11:02:04,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:02:04,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344919419] [2024-10-24 11:02:04,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:04,390 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 [2024-10-24 11:02:04,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:02:04,392 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:02:04,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 11:02:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:04,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:02:04,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:02:04,959 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-10-24 11:02:04,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:02:04,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:02:04,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344919419] [2024-10-24 11:02:04,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344919419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:02:04,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:02:04,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:02:04,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28417296] [2024-10-24 11:02:04,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:02:04,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:02:04,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:02:04,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:02:04,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:02:04,999 INFO L87 Difference]: Start difference. First operand has 48 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 11:02:09,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:02:09,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:02:09,206 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2024-10-24 11:02:09,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:02:09,264 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 100 [2024-10-24 11:02:09,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:02:09,270 INFO L225 Difference]: With dead ends: 93 [2024-10-24 11:02:09,271 INFO L226 Difference]: Without dead ends: 46 [2024-10-24 11:02:09,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:02:09,276 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:02:09,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-24 11:02:09,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-24 11:02:09,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-24 11:02:09,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 11:02:09,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2024-10-24 11:02:09,310 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 100 [2024-10-24 11:02:09,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:02:09,311 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2024-10-24 11:02:09,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 11:02:09,311 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2024-10-24 11:02:09,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 11:02:09,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:02:09,317 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:02:09,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 11:02:09,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:02:09,519 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:02:09,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:02:09,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1112841215, now seen corresponding path program 1 times [2024-10-24 11:02:09,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:02:09,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884680206] [2024-10-24 11:02:09,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:09,520 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 [2024-10-24 11:02:09,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:02:09,524 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:02:09,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 11:02:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:09,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 11:02:09,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:02:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 11:02:12,044 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:02:12,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:02:12,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884680206] [2024-10-24 11:02:12,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [884680206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:02:12,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:02:12,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:02:12,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939122818] [2024-10-24 11:02:12,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:02:12,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:02:12,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:02:12,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:02:12,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:02:12,052 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 11:02:16,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:02:20,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:02:24,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:02:28,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:02:32,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:02:36,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:02:40,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:02:40,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:02:40,868 INFO L93 Difference]: Finished difference Result 136 states and 202 transitions. [2024-10-24 11:02:40,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:02:40,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2024-10-24 11:02:40,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:02:40,872 INFO L225 Difference]: With dead ends: 136 [2024-10-24 11:02:40,872 INFO L226 Difference]: Without dead ends: 91 [2024-10-24 11:02:40,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:02:40,874 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 17 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:02:40,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 121 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 6 Unknown, 0 Unchecked, 28.8s Time] [2024-10-24 11:02:40,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-24 11:02:40,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2024-10-24 11:02:40,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 53 states have internal predecessors, (67), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 11:02:40,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 131 transitions. [2024-10-24 11:02:40,903 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 131 transitions. Word has length 100 [2024-10-24 11:02:40,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:02:40,905 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 131 transitions. [2024-10-24 11:02:40,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 11:02:40,906 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 131 transitions. [2024-10-24 11:02:40,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 11:02:40,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:02:40,907 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:02:40,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 11:02:41,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:02:41,108 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:02:41,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:02:41,109 INFO L85 PathProgramCache]: Analyzing trace with hash -662166147, now seen corresponding path program 1 times [2024-10-24 11:02:41,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:02:41,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801104048] [2024-10-24 11:02:41,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:41,110 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 [2024-10-24 11:02:41,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:02:41,113 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:02:41,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 11:02:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:41,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:02:41,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:02:42,742 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 255 proven. 21 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-24 11:02:42,743 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:02:44,125 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-24 11:02:44,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:02:44,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [801104048] [2024-10-24 11:02:44,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [801104048] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:02:44,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:02:44,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-10-24 11:02:44,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511847633] [2024-10-24 11:02:44,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:02:44,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:02:44,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:02:44,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:02:44,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:02:44,129 INFO L87 Difference]: Start difference. First operand 88 states and 131 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 11:02:49,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:02:53,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:02:57,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:02:57,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:02:57,816 INFO L93 Difference]: Finished difference Result 187 states and 271 transitions. [2024-10-24 11:02:57,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:02:57,899 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 100 [2024-10-24 11:02:57,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:02:57,901 INFO L225 Difference]: With dead ends: 187 [2024-10-24 11:02:57,901 INFO L226 Difference]: Without dead ends: 100 [2024-10-24 11:02:57,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:02:57,905 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 61 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 52 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:02:57,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 92 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 108 Invalid, 3 Unknown, 0 Unchecked, 13.2s Time] [2024-10-24 11:02:57,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-24 11:02:57,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2024-10-24 11:02:57,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 11:02:57,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2024-10-24 11:02:57,941 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 100 [2024-10-24 11:02:57,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:02:57,941 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2024-10-24 11:02:57,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 11:02:57,942 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2024-10-24 11:02:57,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 11:02:57,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:02:57,945 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:02:57,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 11:02:58,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:02:58,146 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:02:58,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:02:58,147 INFO L85 PathProgramCache]: Analyzing trace with hash -662106565, now seen corresponding path program 1 times [2024-10-24 11:02:58,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:02:58,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957614293] [2024-10-24 11:02:58,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:58,148 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 [2024-10-24 11:02:58,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:02:58,149 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:02:58,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 11:02:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:58,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:02:58,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:03:08,265 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 11:03:16,491 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)