./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-40.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-40.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 4489e800ee4794c55791b1f834830bc313f49297425e5ef7d1ffd16c6d31677a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:05:25,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:05:25,843 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:05:25,848 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:05:25,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:05:25,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:05:25,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:05:25,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:05:25,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:05:25,877 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:05:25,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:05:25,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:05:25,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:05:25,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:05:25,880 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:05:25,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:05:25,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:05:25,881 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:05:25,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:05:25,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:05:25,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:05:25,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:05:25,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:05:25,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:05:25,885 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:05:25,885 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:05:25,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:05:25,885 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:05:25,885 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:05:25,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:05:25,886 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:05:25,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:05:25,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:05:25,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:05:25,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:05:25,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:05:25,898 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:05:25,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:05:25,899 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:05:25,899 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:05:25,899 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:05:25,899 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:05:25,900 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 -> 4489e800ee4794c55791b1f834830bc313f49297425e5ef7d1ffd16c6d31677a [2024-10-24 11:05:26,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:05:26,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:05:26,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:05:26,156 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:05:26,156 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:05:26,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-40.i [2024-10-24 11:05:27,344 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:05:27,501 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:05:27,502 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-40.i [2024-10-24 11:05:27,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9cd43893/0fa749d6fbda46eba592346898a1eee9/FLAG984314e1e [2024-10-24 11:05:27,521 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9cd43893/0fa749d6fbda46eba592346898a1eee9 [2024-10-24 11:05:27,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:05:27,524 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:05:27,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:05:27,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:05:27,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:05:27,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:05:27" (1/1) ... [2024-10-24 11:05:27,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77bae214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:27, skipping insertion in model container [2024-10-24 11:05:27,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:05:27" (1/1) ... [2024-10-24 11:05:27,552 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:05:27,671 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-40.i[913,926] [2024-10-24 11:05:27,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:05:27,712 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:05:27,721 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-40.i[913,926] [2024-10-24 11:05:27,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:05:27,786 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:05:27,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:27 WrapperNode [2024-10-24 11:05:27,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:05:27,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:05:27,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:05:27,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:05:27,793 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:05:27" (1/1) ... [2024-10-24 11:05:27,799 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:05:27" (1/1) ... [2024-10-24 11:05:27,843 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-10-24 11:05:27,844 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:05:27,845 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:05:27,848 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:05:27,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:05:27,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:27" (1/1) ... [2024-10-24 11:05:27,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:27" (1/1) ... [2024-10-24 11:05:27,863 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:27" (1/1) ... [2024-10-24 11:05:27,881 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:05:27,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:27" (1/1) ... [2024-10-24 11:05:27,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:27" (1/1) ... [2024-10-24 11:05:27,890 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:27" (1/1) ... [2024-10-24 11:05:27,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:27" (1/1) ... [2024-10-24 11:05:27,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:27" (1/1) ... [2024-10-24 11:05:27,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:27" (1/1) ... [2024-10-24 11:05:27,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:05:27,902 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:05:27,902 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:05:27,902 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:05:27,903 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:27" (1/1) ... [2024-10-24 11:05:27,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:05:27,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:05:27,937 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:05:27,942 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:05:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:05:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:05:27,980 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:05:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:05:27,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:05:27,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:05:28,069 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:05:28,070 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:05:28,324 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 11:05:28,325 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:05:28,358 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:05:28,358 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:05:28,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:05:28 BoogieIcfgContainer [2024-10-24 11:05:28,359 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:05:28,361 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:05:28,361 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:05:28,365 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:05:28,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:05:27" (1/3) ... [2024-10-24 11:05:28,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f9af17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:05:28, skipping insertion in model container [2024-10-24 11:05:28,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:27" (2/3) ... [2024-10-24 11:05:28,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f9af17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:05:28, skipping insertion in model container [2024-10-24 11:05:28,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:05:28" (3/3) ... [2024-10-24 11:05:28,370 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-40.i [2024-10-24 11:05:28,383 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:05:28,383 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:05:28,433 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:05:28,438 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;@5076b7f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:05:28,438 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:05:28,441 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:05:28,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 11:05:28,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:05:28,449 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:28,449 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:05:28,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:05:28,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1426505850, now seen corresponding path program 1 times [2024-10-24 11:05:28,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:05:28,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178210761] [2024-10-24 11:05:28,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:05:28,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:05:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:28,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:05:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:28,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:05:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:28,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:05:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:28,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:05:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:28,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:05:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:28,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:05:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:28,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 11:05:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:28,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:05:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:28,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 11:05:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:28,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:05:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:28,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:05:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:28,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 11:05:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:28,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 11:05:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:28,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 11:05:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:28,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 11:05:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:28,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 11:05:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:28,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:05:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:28,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:05:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:28,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 11:05:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:28,740 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:05:28,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:05:28,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178210761] [2024-10-24 11:05:28,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178210761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:05:28,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:05:28,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:05:28,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452377285] [2024-10-24 11:05:28,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:05:28,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:05:28,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:05:28,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:05:28,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:05:28,770 INFO L87 Difference]: Start difference. First operand has 58 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:05:28,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:05:28,804 INFO L93 Difference]: Finished difference Result 113 states and 199 transitions. [2024-10-24 11:05:28,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:05:28,806 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 117 [2024-10-24 11:05:28,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:05:28,811 INFO L225 Difference]: With dead ends: 113 [2024-10-24 11:05:28,812 INFO L226 Difference]: Without dead ends: 56 [2024-10-24 11:05:28,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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:05:28,819 INFO L432 NwaCegarLoop]: 83 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, 83 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:05:28,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:05:28,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-24 11:05:28,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-24 11:05:28,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:05:28,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 86 transitions. [2024-10-24 11:05:28,858 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 86 transitions. Word has length 117 [2024-10-24 11:05:28,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:05:28,858 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 86 transitions. [2024-10-24 11:05:28,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:05:28,859 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 86 transitions. [2024-10-24 11:05:28,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 11:05:28,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:05:28,862 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:28,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:05:28,862 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:05:28,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:05:28,862 INFO L85 PathProgramCache]: Analyzing trace with hash -281618176, now seen corresponding path program 1 times [2024-10-24 11:05:28,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:05:28,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297668436] [2024-10-24 11:05:28,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:05:28,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:05:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:05:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:05:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:05:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:05:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:05:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:05:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 11:05:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:05:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 11:05:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:05:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:05:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 11:05:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 11:05:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 11:05:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 11:05:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 11:05:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:05:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:05:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 11:05:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,226 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:05:29,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:05:29,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297668436] [2024-10-24 11:05:29,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297668436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:05:29,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:05:29,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:05:29,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494607346] [2024-10-24 11:05:29,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:05:29,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:05:29,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:05:29,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:05:29,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:05:29,233 INFO L87 Difference]: Start difference. First operand 56 states and 86 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:05:29,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:05:29,291 INFO L93 Difference]: Finished difference Result 128 states and 195 transitions. [2024-10-24 11:05:29,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:05:29,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 117 [2024-10-24 11:05:29,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:05:29,294 INFO L225 Difference]: With dead ends: 128 [2024-10-24 11:05:29,294 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 11:05:29,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:05:29,296 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 19 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:05:29,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 247 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:05:29,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 11:05:29,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2024-10-24 11:05:29,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 42 states have internal predecessors, (59), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:05:29,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 97 transitions. [2024-10-24 11:05:29,312 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 97 transitions. Word has length 117 [2024-10-24 11:05:29,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:05:29,314 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 97 transitions. [2024-10-24 11:05:29,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:05:29,315 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 97 transitions. [2024-10-24 11:05:29,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 11:05:29,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:05:29,317 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:29,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:05:29,318 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:05:29,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:05:29,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1339869101, now seen corresponding path program 1 times [2024-10-24 11:05:29,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:05:29,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116873944] [2024-10-24 11:05:29,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:05:29,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:05:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:05:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:05:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:05:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:05:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:05:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:05:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 11:05:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:05:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 11:05:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:05:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:05:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 11:05:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 11:05:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 11:05:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 11:05:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 11:05:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:05:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:05:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 11:05:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:29,549 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:05:29,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:05:29,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116873944] [2024-10-24 11:05:29,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116873944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:05:29,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:05:29,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:05:29,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437483288] [2024-10-24 11:05:29,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:05:29,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:05:29,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:05:29,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:05:29,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:05:29,555 INFO L87 Difference]: Start difference. First operand 63 states and 97 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:05:29,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:05:29,649 INFO L93 Difference]: Finished difference Result 176 states and 265 transitions. [2024-10-24 11:05:29,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:05:29,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 118 [2024-10-24 11:05:29,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:05:29,654 INFO L225 Difference]: With dead ends: 176 [2024-10-24 11:05:29,655 INFO L226 Difference]: Without dead ends: 114 [2024-10-24 11:05:29,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:05:29,656 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 50 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:05:29,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 300 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:05:29,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-24 11:05:29,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 87. [2024-10-24 11:05:29,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 64 states have internal predecessors, (88), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:05:29,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 130 transitions. [2024-10-24 11:05:29,667 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 130 transitions. Word has length 118 [2024-10-24 11:05:29,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:05:29,667 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 130 transitions. [2024-10-24 11:05:29,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:05:29,667 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 130 transitions. [2024-10-24 11:05:29,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 11:05:29,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:05:29,669 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:29,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:05:29,669 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:05:29,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:05:29,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1598034539, now seen corresponding path program 1 times [2024-10-24 11:05:29,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:05:29,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829595945] [2024-10-24 11:05:29,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:05:29,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:05:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:05:29,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1621906474] [2024-10-24 11:05:29,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:05:29,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:05:29,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:05:29,744 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:05:29,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:05:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:05:29,941 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:05:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:05:30,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:05:30,038 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:05:30,039 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:05:30,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:05:30,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:05:30,244 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 11:05:30,320 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:05:30,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:05:30 BoogieIcfgContainer [2024-10-24 11:05:30,323 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:05:30,323 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:05:30,323 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:05:30,323 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:05:30,324 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:05:28" (3/4) ... [2024-10-24 11:05:30,325 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:05:30,326 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:05:30,326 INFO L158 Benchmark]: Toolchain (without parser) took 2801.99ms. Allocated memory was 178.3MB in the beginning and 232.8MB in the end (delta: 54.5MB). Free memory was 101.3MB in the beginning and 179.0MB in the end (delta: -77.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:05:30,326 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 178.3MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:05:30,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.25ms. Allocated memory is still 178.3MB. Free memory was 101.1MB in the beginning and 147.5MB in the end (delta: -46.4MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2024-10-24 11:05:30,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.74ms. Allocated memory is still 178.3MB. Free memory was 147.5MB in the beginning and 147.6MB in the end (delta: -78.8kB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2024-10-24 11:05:30,327 INFO L158 Benchmark]: Boogie Preprocessor took 56.63ms. Allocated memory is still 178.3MB. Free memory was 147.6MB in the beginning and 145.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:05:30,327 INFO L158 Benchmark]: RCFGBuilder took 457.25ms. Allocated memory is still 178.3MB. Free memory was 145.5MB in the beginning and 130.7MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 11:05:30,327 INFO L158 Benchmark]: TraceAbstraction took 1962.14ms. Allocated memory was 178.3MB in the beginning and 232.8MB in the end (delta: 54.5MB). Free memory was 130.7MB in the beginning and 179.0MB in the end (delta: -48.3MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2024-10-24 11:05:30,327 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 232.8MB. Free memory is still 179.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:05:30,329 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.13ms. Allocated memory is still 178.3MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.25ms. Allocated memory is still 178.3MB. Free memory was 101.1MB in the beginning and 147.5MB in the end (delta: -46.4MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.74ms. Allocated memory is still 178.3MB. Free memory was 147.5MB in the beginning and 147.6MB in the end (delta: -78.8kB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.63ms. Allocated memory is still 178.3MB. Free memory was 147.6MB in the beginning and 145.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 457.25ms. Allocated memory is still 178.3MB. Free memory was 145.5MB in the beginning and 130.7MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1962.14ms. Allocated memory was 178.3MB in the beginning and 232.8MB in the end (delta: 54.5MB). Free memory was 130.7MB in the beginning and 179.0MB in the end (delta: -48.3MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 232.8MB. Free memory is still 179.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryArithmeticDOUBLEoperation at line 63. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_7 = 64; [L26] signed long int var_1_8 = -2; [L27] signed long int var_1_9 = -10; [L28] unsigned char var_1_11 = 128; [L29] unsigned char var_1_12 = 1; [L30] double var_1_13 = 8.4; [L31] double var_1_15 = 49.75; [L32] signed char var_1_16 = -2; [L33] signed char var_1_17 = 25; [L34] signed char var_1_18 = -5; [L35] float var_1_19 = 7.5; [L36] signed short int var_1_20 = 1; [L37] signed short int var_1_21 = -256; [L38] double last_1_var_1_13 = 8.4; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] CALL updateLastVariables() [L97] last_1_var_1_13 = var_1_13 [L107] RET updateLastVariables() [L108] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L70] var_1_3 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L72] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L72] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L73] var_1_8 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L74] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L75] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L75] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L76] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L76] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L77] var_1_9 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L78] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L79] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L79] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L80] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L80] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L81] var_1_11 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_11 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L82] RET assume_abort_if_not(var_1_11 >= 127) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L83] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L83] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L84] var_1_12 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L85] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L86] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L86] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L87] var_1_15 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L88] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L89] var_1_17 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_17 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L90] RET assume_abort_if_not(var_1_17 >= -127) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L91] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L91] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L92] var_1_18 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-1, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-1, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L93] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-1, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L94] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-1, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-1, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L94] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-1, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L108] RET updateVariables() [L109] CALL step() [L42] COND TRUE \read(var_1_3) [L43] var_1_16 = ((((var_1_17) > ((-2 + var_1_18))) ? (var_1_17) : ((-2 + var_1_18)))) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L45] var_1_19 = var_1_15 [L46] var_1_20 = var_1_16 [L47] var_1_21 = var_1_18 VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=-1, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L48] COND TRUE \read(var_1_2) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=-1, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L49] COND FALSE !(var_1_3 && (var_1_19 <= (- 63.9f))) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=-1, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L57] EXPR var_1_21 | var_1_16 VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=-1, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L57] COND TRUE ((var_1_16 / var_1_8) / var_1_9) >= (var_1_21 | var_1_16) [L58] var_1_7 = (var_1_11 - var_1_12) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=-1, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-1, var_1_9=2] [L62] COND TRUE var_1_19 != ((((last_1_var_1_13) < (var_1_19)) ? (last_1_var_1_13) : (var_1_19))) [L63] var_1_13 = (var_1_15 + (127.4 - 8.25)) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=-1, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-1, var_1_9=2] [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR (var_1_2 ? ((var_1_3 && (var_1_19 <= (- 63.9f))) ? ((var_1_19 >= var_1_19) ? (var_1_3 ? (var_1_1 == ((signed long int) var_1_21)) : 1) : 1) : 1) : 1) && ((((var_1_16 / var_1_8) / var_1_9) >= (var_1_21 | var_1_16)) ? (var_1_7 == ((unsigned char) (var_1_11 - var_1_12))) : (var_1_7 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=-1, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-1, var_1_9=2] [L100-L101] return ((((((var_1_2 ? ((var_1_3 && (var_1_19 <= (- 63.9f))) ? ((var_1_19 >= var_1_19) ? (var_1_3 ? (var_1_1 == ((signed long int) var_1_21)) : 1) : 1) : 1) : 1) && ((((var_1_16 / var_1_8) / var_1_9) >= (var_1_21 | var_1_16)) ? (var_1_7 == ((unsigned char) (var_1_11 - var_1_12))) : (var_1_7 == ((unsigned char) var_1_12)))) && ((var_1_19 != ((((last_1_var_1_13) < (var_1_19)) ? (last_1_var_1_13) : (var_1_19)))) ? (var_1_13 == ((double) (var_1_15 + (127.4 - 8.25)))) : 1)) && (var_1_3 ? (var_1_16 == ((signed char) ((((var_1_17) > ((-2 + var_1_18))) ? (var_1_17) : ((-2 + var_1_18)))))) : 1)) && (var_1_19 == ((float) var_1_15))) && (var_1_20 == ((signed short int) var_1_16))) && (var_1_21 == ((signed short int) var_1_18)) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=-1, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-1, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=-1, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-1, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69 mSDsluCounter, 630 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 359 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 68 IncrementalHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 271 mSDtfsCounter, 68 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=3, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 37 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 588 NumberOfCodeBlocks, 588 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 349 ConstructedInterpolants, 0 QuantifiedInterpolants, 428 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2052/2052 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:05:30,358 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-40.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 4489e800ee4794c55791b1f834830bc313f49297425e5ef7d1ffd16c6d31677a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:05:32,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:05:32,201 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:05:32,205 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:05:32,207 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:05:32,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:05:32,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:05:32,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:05:32,236 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:05:32,239 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:05:32,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:05:32,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:05:32,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:05:32,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:05:32,240 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:05:32,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:05:32,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:05:32,240 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:05:32,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:05:32,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:05:32,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:05:32,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:05:32,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:05:32,242 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:05:32,243 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:05:32,243 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:05:32,243 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:05:32,243 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:05:32,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:05:32,244 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:05:32,244 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:05:32,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:05:32,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:05:32,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:05:32,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:05:32,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:05:32,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:05:32,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:05:32,245 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:05:32,246 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:05:32,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:05:32,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:05:32,247 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:05:32,247 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:05:32,248 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:05:32,248 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 -> 4489e800ee4794c55791b1f834830bc313f49297425e5ef7d1ffd16c6d31677a [2024-10-24 11:05:32,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:05:32,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:05:32,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:05:32,500 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:05:32,500 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:05:32,502 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-40.i [2024-10-24 11:05:33,763 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:05:33,943 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:05:33,944 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-40.i [2024-10-24 11:05:33,955 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97afda9e9/2e14c7b437e2439db4e2c98ad51c7a4f/FLAGb4a845cd0 [2024-10-24 11:05:34,318 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97afda9e9/2e14c7b437e2439db4e2c98ad51c7a4f [2024-10-24 11:05:34,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:05:34,322 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:05:34,322 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:05:34,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:05:34,327 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:05:34,328 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:05:34" (1/1) ... [2024-10-24 11:05:34,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ce7e7e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:34, skipping insertion in model container [2024-10-24 11:05:34,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:05:34" (1/1) ... [2024-10-24 11:05:34,345 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:05:34,484 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-40.i[913,926] [2024-10-24 11:05:34,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:05:34,544 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:05:34,556 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-40.i[913,926] [2024-10-24 11:05:34,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:05:34,599 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:05:34,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:34 WrapperNode [2024-10-24 11:05:34,600 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:05:34,601 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:05:34,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:05:34,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:05:34,606 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:05:34" (1/1) ... [2024-10-24 11:05:34,620 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:05:34" (1/1) ... [2024-10-24 11:05:34,672 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-10-24 11:05:34,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:05:34,673 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:05:34,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:05:34,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:05:34,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:34" (1/1) ... [2024-10-24 11:05:34,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:34" (1/1) ... [2024-10-24 11:05:34,709 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:34" (1/1) ... [2024-10-24 11:05:34,730 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:05:34,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:34" (1/1) ... [2024-10-24 11:05:34,731 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:34" (1/1) ... [2024-10-24 11:05:34,741 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:34" (1/1) ... [2024-10-24 11:05:34,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:34" (1/1) ... [2024-10-24 11:05:34,749 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:34" (1/1) ... [2024-10-24 11:05:34,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:34" (1/1) ... [2024-10-24 11:05:34,755 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:05:34,760 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:05:34,760 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:05:34,760 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:05:34,761 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:34" (1/1) ... [2024-10-24 11:05:34,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:05:34,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:05:34,792 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:05:34,795 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:05:34,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:05:34,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:05:34,833 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:05:34,834 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:05:34,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:05:34,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:05:34,911 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:05:34,913 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:05:36,934 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 11:05:36,934 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:05:36,964 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:05:36,965 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:05:36,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:05:36 BoogieIcfgContainer [2024-10-24 11:05:36,966 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:05:36,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:05:36,969 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:05:36,972 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:05:36,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:05:34" (1/3) ... [2024-10-24 11:05:36,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3389f3ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:05:36, skipping insertion in model container [2024-10-24 11:05:36,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:34" (2/3) ... [2024-10-24 11:05:36,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3389f3ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:05:36, skipping insertion in model container [2024-10-24 11:05:36,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:05:36" (3/3) ... [2024-10-24 11:05:36,975 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-40.i [2024-10-24 11:05:36,988 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:05:36,989 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:05:37,048 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:05:37,054 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;@24640a58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:05:37,055 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:05:37,059 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:05:37,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 11:05:37,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:05:37,072 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:37,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:05:37,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:05:37,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1941806240, now seen corresponding path program 1 times [2024-10-24 11:05:37,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:05:37,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [602724631] [2024-10-24 11:05:37,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:05:37,090 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:05:37,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:05:37,094 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:05:37,095 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:05:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:37,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:05:37,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:05:37,442 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-10-24 11:05:37,442 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:05:37,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:05:37,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [602724631] [2024-10-24 11:05:37,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [602724631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:05:37,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:05:37,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:05:37,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26012288] [2024-10-24 11:05:37,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:05:37,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:05:37,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:05:37,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:05:37,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:05:37,464 INFO L87 Difference]: Start difference. First operand has 49 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:05:39,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:05:39,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:05:39,514 INFO L93 Difference]: Finished difference Result 95 states and 171 transitions. [2024-10-24 11:05:39,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:05:39,544 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 114 [2024-10-24 11:05:39,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:05:39,549 INFO L225 Difference]: With dead ends: 95 [2024-10-24 11:05:39,549 INFO L226 Difference]: Without dead ends: 47 [2024-10-24 11:05:39,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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:05:39,553 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:05:39,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 11:05:39,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-24 11:05:39,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-24 11:05:39,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:05:39,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 72 transitions. [2024-10-24 11:05:39,591 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 72 transitions. Word has length 114 [2024-10-24 11:05:39,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:05:39,591 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 72 transitions. [2024-10-24 11:05:39,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:05:39,591 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 72 transitions. [2024-10-24 11:05:39,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 11:05:39,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:05:39,594 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:39,607 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:05:39,795 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:05:39,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:05:39,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:05:39,796 INFO L85 PathProgramCache]: Analyzing trace with hash 696158362, now seen corresponding path program 1 times [2024-10-24 11:05:39,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:05:39,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687375455] [2024-10-24 11:05:39,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:05:39,801 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:05:39,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:05:39,803 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:05:39,804 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:05:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:40,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 11:05:40,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:06:38,936 WARN L286 SmtUtils]: Spent 13.99s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)