./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_loopvsstraightlinecode_50-1loop_file-24.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_loopvsstraightlinecode_50-1loop_file-24.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 f8eec8e6962cf6cdbbc8bf030b667df75ae218fdfa7ef0f6b679cb7eca744d34 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:45:46,073 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:45:46,136 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:45:46,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:45:46,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:45:46,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:45:46,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:45:46,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:45:46,172 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:45:46,174 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:45:46,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:45:46,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:45:46,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:45:46,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:45:46,177 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:45:46,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:45:46,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:45:46,177 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:45:46,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:45:46,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:45:46,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:45:46,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:45:46,181 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:45:46,181 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:45:46,182 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:45:46,182 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:45:46,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:45:46,182 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:45:46,182 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:45:46,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:45:46,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:45:46,183 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:45:46,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:45:46,183 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:45:46,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:45:46,183 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:45:46,184 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:45:46,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:45:46,184 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:45:46,184 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:45:46,184 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:45:46,185 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:45:46,185 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 -> f8eec8e6962cf6cdbbc8bf030b667df75ae218fdfa7ef0f6b679cb7eca744d34 [2024-10-24 09:45:46,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:45:46,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:45:46,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:45:46,477 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:45:46,478 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:45:46,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-24.i [2024-10-24 09:45:47,797 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:45:47,997 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:45:47,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-24.i [2024-10-24 09:45:48,010 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e19acbe9/51fb08771073419f9f9afa00b07d028c/FLAG8c3b0d35c [2024-10-24 09:45:48,023 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e19acbe9/51fb08771073419f9f9afa00b07d028c [2024-10-24 09:45:48,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:45:48,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:45:48,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:45:48,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:45:48,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:45:48,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:45:48" (1/1) ... [2024-10-24 09:45:48,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@782482c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:48, skipping insertion in model container [2024-10-24 09:45:48,036 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:45:48" (1/1) ... [2024-10-24 09:45:48,063 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:45:48,230 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_loopvsstraightlinecode_50-1loop_file-24.i[915,928] [2024-10-24 09:45:48,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:45:48,274 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:45:48,283 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_loopvsstraightlinecode_50-1loop_file-24.i[915,928] [2024-10-24 09:45:48,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:45:48,326 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:45:48,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:48 WrapperNode [2024-10-24 09:45:48,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:45:48,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:45:48,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:45:48,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:45:48,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:48" (1/1) ... [2024-10-24 09:45:48,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:48" (1/1) ... [2024-10-24 09:45:48,372 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-10-24 09:45:48,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:45:48,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:45:48,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:45:48,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:45:48,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:48" (1/1) ... [2024-10-24 09:45:48,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:48" (1/1) ... [2024-10-24 09:45:48,397 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:48" (1/1) ... [2024-10-24 09:45:48,407 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 09:45:48,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:48" (1/1) ... [2024-10-24 09:45:48,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:48" (1/1) ... [2024-10-24 09:45:48,412 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:48" (1/1) ... [2024-10-24 09:45:48,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:48" (1/1) ... [2024-10-24 09:45:48,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:48" (1/1) ... [2024-10-24 09:45:48,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:48" (1/1) ... [2024-10-24 09:45:48,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:45:48,420 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:45:48,420 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:45:48,420 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:45:48,420 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:48" (1/1) ... [2024-10-24 09:45:48,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:45:48,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:45:48,462 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 09:45:48,464 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 09:45:48,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:45:48,503 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:45:48,503 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:45:48,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:45:48,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:45:48,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:45:48,563 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:45:48,564 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:45:48,874 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 09:45:48,875 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:45:48,899 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:45:48,900 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:45:48,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:45:48 BoogieIcfgContainer [2024-10-24 09:45:48,900 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:45:48,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:45:48,902 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:45:48,904 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:45:48,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:45:48" (1/3) ... [2024-10-24 09:45:48,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c9289c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:45:48, skipping insertion in model container [2024-10-24 09:45:48,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:48" (2/3) ... [2024-10-24 09:45:48,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c9289c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:45:48, skipping insertion in model container [2024-10-24 09:45:48,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:45:48" (3/3) ... [2024-10-24 09:45:48,906 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-24.i [2024-10-24 09:45:48,918 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:45:48,918 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:45:48,967 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:45:48,973 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;@14ee3cc1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:45:48,973 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:45:48,977 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 48 states have internal predecessors, (70), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 09:45:48,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 09:45:48,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:45:48,990 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:45:48,990 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:45:48,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:45:48,996 INFO L85 PathProgramCache]: Analyzing trace with hash 735717842, now seen corresponding path program 1 times [2024-10-24 09:45:49,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:45:49,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535033014] [2024-10-24 09:45:49,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:45:49,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:45:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:45:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 09:45:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 09:45:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:45:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 09:45:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:45:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 09:45:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:45:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:45:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 09:45:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 09:45:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 09:45:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 09:45:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 09:45:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 09:45:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:45:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 09:45:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 09:45:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 09:45:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 09:45:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,368 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 09:45:49,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:45:49,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535033014] [2024-10-24 09:45:49,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535033014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:45:49,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:45:49,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:45:49,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329430059] [2024-10-24 09:45:49,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:45:49,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:45:49,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:45:49,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:45:49,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:45:49,398 INFO L87 Difference]: Start difference. First operand has 70 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 48 states have internal predecessors, (70), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 09:45:49,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:45:49,440 INFO L93 Difference]: Finished difference Result 139 states and 239 transitions. [2024-10-24 09:45:49,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:45:49,442 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 127 [2024-10-24 09:45:49,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:45:49,448 INFO L225 Difference]: With dead ends: 139 [2024-10-24 09:45:49,450 INFO L226 Difference]: Without dead ends: 68 [2024-10-24 09:45:49,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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 09:45:49,458 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:45:49,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:45:49,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-24 09:45:49,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-24 09:45:49,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 46 states have internal predecessors, (65), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 09:45:49,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 105 transitions. [2024-10-24 09:45:49,507 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 105 transitions. Word has length 127 [2024-10-24 09:45:49,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:45:49,508 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 105 transitions. [2024-10-24 09:45:49,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 09:45:49,509 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 105 transitions. [2024-10-24 09:45:49,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 09:45:49,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:45:49,513 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:45:49,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:45:49,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:45:49,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:45:49,515 INFO L85 PathProgramCache]: Analyzing trace with hash -295972014, now seen corresponding path program 1 times [2024-10-24 09:45:49,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:45:49,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957398209] [2024-10-24 09:45:49,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:45:49,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:45:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:45:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 09:45:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 09:45:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:45:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 09:45:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:45:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 09:45:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:45:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:45:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 09:45:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 09:45:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 09:45:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 09:45:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:49,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 09:45:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 09:45:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:45:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 09:45:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 09:45:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 09:45:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 09:45:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,045 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 09:45:50,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:45:50,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957398209] [2024-10-24 09:45:50,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957398209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:45:50,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:45:50,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:45:50,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476317775] [2024-10-24 09:45:50,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:45:50,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:45:50,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:45:50,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:45:50,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:45:50,053 INFO L87 Difference]: Start difference. First operand 68 states and 105 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:45:50,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:45:50,300 INFO L93 Difference]: Finished difference Result 231 states and 358 transitions. [2024-10-24 09:45:50,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:45:50,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2024-10-24 09:45:50,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:45:50,304 INFO L225 Difference]: With dead ends: 231 [2024-10-24 09:45:50,306 INFO L226 Difference]: Without dead ends: 164 [2024-10-24 09:45:50,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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 09:45:50,308 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 110 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:45:50,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 311 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 09:45:50,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-24 09:45:50,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 133. [2024-10-24 09:45:50,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 90 states have internal predecessors, (127), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 09:45:50,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 207 transitions. [2024-10-24 09:45:50,353 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 207 transitions. Word has length 127 [2024-10-24 09:45:50,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:45:50,354 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 207 transitions. [2024-10-24 09:45:50,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:45:50,354 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 207 transitions. [2024-10-24 09:45:50,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 09:45:50,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:45:50,356 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:45:50,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:45:50,356 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:45:50,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:45:50,356 INFO L85 PathProgramCache]: Analyzing trace with hash 580892705, now seen corresponding path program 1 times [2024-10-24 09:45:50,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:45:50,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684973957] [2024-10-24 09:45:50,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:45:50,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:45:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:45:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 09:45:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 09:45:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:45:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 09:45:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:45:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 09:45:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:45:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:45:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 09:45:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 09:45:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 09:45:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 09:45:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 09:45:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 09:45:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:45:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 09:45:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 09:45:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 09:45:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 09:45:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:50,832 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-24 09:45:50,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:45:50,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684973957] [2024-10-24 09:45:50,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684973957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:45:50,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:45:50,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 09:45:50,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208704658] [2024-10-24 09:45:50,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:45:50,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 09:45:50,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:45:50,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 09:45:50,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 09:45:50,837 INFO L87 Difference]: Start difference. First operand 133 states and 207 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:45:51,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:45:51,205 INFO L93 Difference]: Finished difference Result 330 states and 495 transitions. [2024-10-24 09:45:51,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 09:45:51,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 128 [2024-10-24 09:45:51,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:45:51,209 INFO L225 Difference]: With dead ends: 330 [2024-10-24 09:45:51,211 INFO L226 Difference]: Without dead ends: 198 [2024-10-24 09:45:51,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-10-24 09:45:51,213 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 143 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:45:51,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 273 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 09:45:51,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-24 09:45:51,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 141. [2024-10-24 09:45:51,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 96 states have internal predecessors, (127), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 09:45:51,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions. [2024-10-24 09:45:51,255 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 207 transitions. Word has length 128 [2024-10-24 09:45:51,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:45:51,256 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 207 transitions. [2024-10-24 09:45:51,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:45:51,256 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 207 transitions. [2024-10-24 09:45:51,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 09:45:51,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:45:51,261 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:45:51,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 09:45:51,261 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:45:51,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:45:51,265 INFO L85 PathProgramCache]: Analyzing trace with hash 187865695, now seen corresponding path program 1 times [2024-10-24 09:45:51,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:45:51,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059680405] [2024-10-24 09:45:51,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:45:51,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:45:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:45:51,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:45:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:45:51,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:45:51,488 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:45:51,489 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:45:51,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 09:45:51,493 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 09:45:51,599 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:45:51,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:45:51 BoogieIcfgContainer [2024-10-24 09:45:51,602 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:45:51,603 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:45:51,603 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:45:51,603 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:45:51,604 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:45:48" (3/4) ... [2024-10-24 09:45:51,605 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:45:51,607 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:45:51,607 INFO L158 Benchmark]: Toolchain (without parser) took 3580.34ms. Allocated memory was 188.7MB in the beginning and 234.9MB in the end (delta: 46.1MB). Free memory was 107.0MB in the beginning and 79.6MB in the end (delta: 27.4MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. [2024-10-24 09:45:51,608 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 188.7MB. Free memory is still 152.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:45:51,608 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.31ms. Allocated memory is still 188.7MB. Free memory was 106.8MB in the beginning and 151.5MB in the end (delta: -44.7MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2024-10-24 09:45:51,608 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.68ms. Allocated memory is still 188.7MB. Free memory was 151.5MB in the beginning and 149.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 09:45:51,609 INFO L158 Benchmark]: Boogie Preprocessor took 46.09ms. Allocated memory is still 188.7MB. Free memory was 149.4MB in the beginning and 147.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 09:45:51,609 INFO L158 Benchmark]: RCFGBuilder took 480.60ms. Allocated memory is still 188.7MB. Free memory was 146.2MB in the beginning and 140.6MB in the end (delta: 5.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-24 09:45:51,609 INFO L158 Benchmark]: TraceAbstraction took 2700.83ms. Allocated memory was 188.7MB in the beginning and 234.9MB in the end (delta: 46.1MB). Free memory was 140.6MB in the beginning and 80.7MB in the end (delta: 59.9MB). Peak memory consumption was 107.1MB. Max. memory is 16.1GB. [2024-10-24 09:45:51,610 INFO L158 Benchmark]: Witness Printer took 3.88ms. Allocated memory is still 234.9MB. Free memory was 80.7MB in the beginning and 79.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:45:51,611 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.15ms. Allocated memory is still 188.7MB. Free memory is still 152.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.31ms. Allocated memory is still 188.7MB. Free memory was 106.8MB in the beginning and 151.5MB in the end (delta: -44.7MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.68ms. Allocated memory is still 188.7MB. Free memory was 151.5MB in the beginning and 149.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.09ms. Allocated memory is still 188.7MB. Free memory was 149.4MB in the beginning and 147.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 480.60ms. Allocated memory is still 188.7MB. Free memory was 146.2MB in the beginning and 140.6MB in the end (delta: 5.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2700.83ms. Allocated memory was 188.7MB in the beginning and 234.9MB in the end (delta: 46.1MB). Free memory was 140.6MB in the beginning and 80.7MB in the end (delta: 59.9MB). Peak memory consumption was 107.1MB. Max. memory is 16.1GB. * Witness Printer took 3.88ms. Allocated memory is still 234.9MB. Free memory was 80.7MB in the beginning and 79.6MB in the end (delta: 1.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 133, overapproximation of someBinaryArithmeticDOUBLEoperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 15.8; [L23] double var_1_4 = 10.5; [L24] double var_1_5 = 1.55; [L25] signed char var_1_8 = -10; [L26] signed char var_1_10 = -16; [L27] signed char var_1_11 = -4; [L28] signed char var_1_12 = -16; [L29] double var_1_13 = 128.55; [L30] double var_1_14 = 2.3; [L31] double var_1_15 = 4.8; [L32] unsigned long int var_1_16 = 0; [L33] signed long int var_1_17 = 5; [L34] signed long int var_1_18 = 256; [L35] unsigned long int var_1_19 = 50; [L36] unsigned long int var_1_20 = 1; [L37] signed short int var_1_21 = -50; [L38] unsigned char var_1_23 = 1; [L39] unsigned char var_1_24 = 0; [L40] signed char last_1_var_1_8 = -10; [L41] signed short int last_1_var_1_21 = -50; [L42] unsigned char last_1_var_1_23 = 1; [L137] isInitial = 1 [L138] FCALL initially() [L139] int k_loop; [L140] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_4=21/2, var_1_5=31/20, var_1_8=-10] [L140] COND TRUE k_loop < 1 [L141] CALL updateLastVariables() [L128] last_1_var_1_8 = var_1_8 [L129] last_1_var_1_21 = var_1_21 [L130] last_1_var_1_23 = var_1_23 [L141] RET updateLastVariables() [L142] CALL updateVariables() [L94] var_1_4 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_5=31/20, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_5=31/20, var_1_8=-10] [L95] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_5=31/20, var_1_8=-10] [L96] var_1_5 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L97] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L98] var_1_10 = __VERIFIER_nondet_char() [L99] CALL assume_abort_if_not(var_1_10 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L99] RET assume_abort_if_not(var_1_10 >= -63) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L100] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L100] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L101] var_1_11 = __VERIFIER_nondet_char() [L102] CALL assume_abort_if_not(var_1_11 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L102] RET assume_abort_if_not(var_1_11 >= -31) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L103] CALL assume_abort_if_not(var_1_11 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L103] RET assume_abort_if_not(var_1_11 <= 32) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L104] var_1_12 = __VERIFIER_nondet_char() [L105] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L105] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L106] CALL assume_abort_if_not(var_1_12 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L106] RET assume_abort_if_not(var_1_12 <= 31) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L107] var_1_14 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L108] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L109] var_1_15 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_15 >= 0.0F && 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_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L110] RET assume_abort_if_not((var_1_15 >= 0.0F && 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_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L111] var_1_17 = __VERIFIER_nondet_long() [L112] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L112] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L113] CALL assume_abort_if_not(var_1_17 <= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L113] RET assume_abort_if_not(var_1_17 <= 1073741824) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L114] var_1_18 = __VERIFIER_nondet_long() [L115] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L115] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L116] CALL assume_abort_if_not(var_1_18 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L116] RET assume_abort_if_not(var_1_18 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L117] var_1_19 = __VERIFIER_nondet_ulong() [L118] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L118] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L119] CALL assume_abort_if_not(var_1_19 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_19=664581125, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_19=664581125, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L119] RET assume_abort_if_not(var_1_19 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_19=664581125, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L120] var_1_20 = __VERIFIER_nondet_ulong() [L121] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_19=664581125, var_1_1=79/5, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_19=664581125, var_1_1=79/5, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L121] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_19=664581125, var_1_1=79/5, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L122] CALL assume_abort_if_not(var_1_20 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_19=664581125, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_19=664581125, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L122] RET assume_abort_if_not(var_1_20 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_19=664581125, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L123] var_1_24 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_19=664581125, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_19=664581125, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_8=-10] [L124] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_19=664581125, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_8=-10] [L125] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_19=664581125, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_19=664581125, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L125] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_19=664581125, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L142] RET updateVariables() [L143] CALL step() [L46] COND TRUE last_1_var_1_21 <= ((((last_1_var_1_21) < (last_1_var_1_8)) ? (last_1_var_1_21) : (last_1_var_1_8))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_19=664581125, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L47] COND TRUE \read(last_1_var_1_23) [L48] var_1_8 = (-16 + ((((var_1_10) < ((var_1_11 + var_1_12))) ? (var_1_10) : ((var_1_11 + var_1_12))))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_19=664581125, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-1] [L53] var_1_23 = var_1_24 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_19=664581125, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=-1] [L54] COND FALSE !(128u >= var_1_8) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_19=664581125, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=-1] [L61] COND FALSE !(\read(var_1_23)) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=0, var_1_17=664581125, var_1_18=664581125, var_1_19=664581125, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=-1] [L65] COND TRUE var_1_8 >= ((1329162249 - var_1_17) - var_1_18) [L66] var_1_16 = (((((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) < (var_1_19)) ? (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) : (var_1_19))) + var_1_20) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=664581126, var_1_17=664581125, var_1_18=664581125, var_1_19=664581125, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=-1] [L74] COND FALSE !(((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) <= (var_1_11 + var_1_8)) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=664581126, var_1_17=664581125, var_1_18=664581125, var_1_19=664581125, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=-1] [L83] unsigned char stepLocal_1 = var_1_23; [L84] signed char stepLocal_0 = var_1_8; VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, stepLocal_0=-1, stepLocal_1=0, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=664581126, var_1_17=664581125, var_1_18=664581125, var_1_19=664581125, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=-1] [L85] COND TRUE stepLocal_0 >= var_1_16 [L86] var_1_1 = (var_1_4 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, stepLocal_1=0, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=664581126, var_1_17=664581125, var_1_18=664581125, var_1_19=664581125, var_1_20=1, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=-1] [L143] RET step() [L144] CALL, EXPR property() [L133] EXPR (((((var_1_8 >= var_1_16) ? (var_1_1 == ((double) (var_1_4 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) : ((var_1_23 || var_1_23) ? (var_1_1 == ((double) 128.75)) : 1)) && ((last_1_var_1_21 <= ((((last_1_var_1_21) < (last_1_var_1_8)) ? (last_1_var_1_21) : (last_1_var_1_8)))) ? (last_1_var_1_23 ? (var_1_8 == ((signed char) (-16 + ((((var_1_10) < ((var_1_11 + var_1_12))) ? (var_1_10) : ((var_1_11 + var_1_12))))))) : 1) : (var_1_8 == ((signed char) var_1_12)))) && ((128u >= var_1_8) ? ((! var_1_23) ? (var_1_13 == ((double) ((var_1_14 - var_1_15) + 0.25))) : (var_1_13 == ((double) var_1_14))) : (var_1_23 ? (var_1_13 == ((double) var_1_5)) : 1))) && ((var_1_8 >= ((1329162249 - var_1_17) - var_1_18)) ? (var_1_16 == ((unsigned long int) (((((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) < (var_1_19)) ? (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) : (var_1_19))) + var_1_20))) : (var_1_23 ? (var_1_16 == ((unsigned long int) var_1_18)) : (var_1_16 == ((unsigned long int) var_1_19))))) && ((((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) <= (var_1_11 + var_1_8)) ? ((var_1_11 >= (var_1_18 & var_1_16)) ? (var_1_21 == ((signed short int) 8)) : ((var_1_19 < var_1_8) ? (var_1_21 == ((signed short int) 64)) : 1)) : 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=664581126, var_1_17=664581125, var_1_18=664581125, var_1_19=664581125, var_1_20=1, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=-1] [L133-L134] return ((((((var_1_8 >= var_1_16) ? (var_1_1 == ((double) (var_1_4 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) : ((var_1_23 || var_1_23) ? (var_1_1 == ((double) 128.75)) : 1)) && ((last_1_var_1_21 <= ((((last_1_var_1_21) < (last_1_var_1_8)) ? (last_1_var_1_21) : (last_1_var_1_8)))) ? (last_1_var_1_23 ? (var_1_8 == ((signed char) (-16 + ((((var_1_10) < ((var_1_11 + var_1_12))) ? (var_1_10) : ((var_1_11 + var_1_12))))))) : 1) : (var_1_8 == ((signed char) var_1_12)))) && ((128u >= var_1_8) ? ((! var_1_23) ? (var_1_13 == ((double) ((var_1_14 - var_1_15) + 0.25))) : (var_1_13 == ((double) var_1_14))) : (var_1_23 ? (var_1_13 == ((double) var_1_5)) : 1))) && ((var_1_8 >= ((1329162249 - var_1_17) - var_1_18)) ? (var_1_16 == ((unsigned long int) (((((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) < (var_1_19)) ? (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) : (var_1_19))) + var_1_20))) : (var_1_23 ? (var_1_16 == ((unsigned long int) var_1_18)) : (var_1_16 == ((unsigned long int) var_1_19))))) && ((((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) <= (var_1_11 + var_1_8)) ? ((var_1_11 >= (var_1_18 & var_1_16)) ? (var_1_21 == ((signed short int) 8)) : ((var_1_19 < var_1_8) ? (var_1_21 == ((signed short int) 64)) : 1)) : 1)) && (var_1_23 == ((unsigned char) var_1_24)) ; [L144] RET, EXPR property() [L144] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=664581126, var_1_17=664581125, var_1_18=664581125, var_1_19=664581125, var_1_20=1, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=-1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=31, var_1_12=31, var_1_13=2571/20, var_1_16=664581126, var_1_17=664581125, var_1_18=664581125, var_1_19=664581125, var_1_20=1, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 273 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 253 mSDsluCounter, 686 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 350 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 336 IncrementalHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 336 mSDtfsCounter, 336 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=3, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 88 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 510 NumberOfCodeBlocks, 510 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 379 ConstructedInterpolants, 0 QuantifiedInterpolants, 547 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2280/2280 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 09:45:51,643 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_loopvsstraightlinecode_50-1loop_file-24.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 f8eec8e6962cf6cdbbc8bf030b667df75ae218fdfa7ef0f6b679cb7eca744d34 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:45:53,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:45:53,688 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:45:53,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:45:53,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:45:53,720 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:45:53,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:45:53,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:45:53,724 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:45:53,724 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:45:53,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:45:53,724 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:45:53,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:45:53,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:45:53,726 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:45:53,727 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:45:53,727 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:45:53,727 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:45:53,729 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:45:53,729 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:45:53,729 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:45:53,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:45:53,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:45:53,730 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:45:53,732 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:45:53,733 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:45:53,733 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:45:53,733 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:45:53,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:45:53,733 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:45:53,734 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:45:53,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:45:53,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:45:53,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:45:53,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:45:53,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:45:53,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:45:53,735 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:45:53,735 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:45:53,735 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:45:53,735 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:45:53,736 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:45:53,736 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:45:53,736 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:45:53,737 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:45:53,737 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 -> f8eec8e6962cf6cdbbc8bf030b667df75ae218fdfa7ef0f6b679cb7eca744d34 [2024-10-24 09:45:54,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:45:54,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:45:54,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:45:54,032 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:45:54,032 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:45:54,034 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-24.i [2024-10-24 09:45:55,364 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:45:55,577 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:45:55,578 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-24.i [2024-10-24 09:45:55,584 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f29c4da6d/cac63f5fd2bb4f51aa4c39ba407453e7/FLAGa7568f8b2 [2024-10-24 09:45:55,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f29c4da6d/cac63f5fd2bb4f51aa4c39ba407453e7 [2024-10-24 09:45:55,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:45:55,933 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:45:55,935 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:45:55,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:45:55,944 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:45:55,944 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:45:55" (1/1) ... [2024-10-24 09:45:55,945 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31094a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:55, skipping insertion in model container [2024-10-24 09:45:55,945 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:45:55" (1/1) ... [2024-10-24 09:45:55,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:45:56,174 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_loopvsstraightlinecode_50-1loop_file-24.i[915,928] [2024-10-24 09:45:56,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:45:56,245 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:45:56,255 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_loopvsstraightlinecode_50-1loop_file-24.i[915,928] [2024-10-24 09:45:56,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:45:56,306 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:45:56,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:56 WrapperNode [2024-10-24 09:45:56,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:45:56,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:45:56,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:45:56,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:45:56,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:56" (1/1) ... [2024-10-24 09:45:56,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:56" (1/1) ... [2024-10-24 09:45:56,358 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2024-10-24 09:45:56,362 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:45:56,363 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:45:56,363 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:45:56,363 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:45:56,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:56" (1/1) ... [2024-10-24 09:45:56,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:56" (1/1) ... [2024-10-24 09:45:56,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:56" (1/1) ... [2024-10-24 09:45:56,391 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 09:45:56,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:56" (1/1) ... [2024-10-24 09:45:56,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:56" (1/1) ... [2024-10-24 09:45:56,406 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:56" (1/1) ... [2024-10-24 09:45:56,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:56" (1/1) ... [2024-10-24 09:45:56,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:56" (1/1) ... [2024-10-24 09:45:56,429 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:56" (1/1) ... [2024-10-24 09:45:56,439 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:45:56,440 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:45:56,440 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:45:56,441 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:45:56,441 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:56" (1/1) ... [2024-10-24 09:45:56,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:45:56,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:45:56,503 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 09:45:56,507 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 09:45:56,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:45:56,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:45:56,540 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:45:56,540 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:45:56,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:45:56,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:45:56,601 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:45:56,603 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:45:58,434 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-24 09:45:58,435 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:45:58,504 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:45:58,504 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:45:58,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:45:58 BoogieIcfgContainer [2024-10-24 09:45:58,505 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:45:58,506 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:45:58,506 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:45:58,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:45:58,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:45:55" (1/3) ... [2024-10-24 09:45:58,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20cd041b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:45:58, skipping insertion in model container [2024-10-24 09:45:58,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:56" (2/3) ... [2024-10-24 09:45:58,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20cd041b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:45:58, skipping insertion in model container [2024-10-24 09:45:58,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:45:58" (3/3) ... [2024-10-24 09:45:58,515 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-24.i [2024-10-24 09:45:58,529 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:45:58,529 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:45:58,587 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:45:58,593 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;@3c7c20cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:45:58,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:45:58,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 09:45:58,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 09:45:58,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:45:58,612 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:45:58,613 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:45:58,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:45:58,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1209318544, now seen corresponding path program 1 times [2024-10-24 09:45:58,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:45:58,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953643484] [2024-10-24 09:45:58,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:45:58,629 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 09:45:58,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:45:58,633 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 09:45:58,635 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 09:45:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:45:58,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 09:45:58,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:45:58,945 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-10-24 09:45:58,946 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:45:58,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:45:58,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953643484] [2024-10-24 09:45:58,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953643484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:45:58,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:45:58,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:45:58,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422138920] [2024-10-24 09:45:58,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:45:58,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:45:58,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:45:58,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:45:58,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:45:58,973 INFO L87 Difference]: Start difference. First operand has 59 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 09:46:00,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:46:00,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:46:00,612 INFO L93 Difference]: Finished difference Result 117 states and 205 transitions. [2024-10-24 09:46:00,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:46:00,614 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2024-10-24 09:46:00,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:46:00,628 INFO L225 Difference]: With dead ends: 117 [2024-10-24 09:46:00,628 INFO L226 Difference]: Without dead ends: 57 [2024-10-24 09:46:00,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 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 09:46:00,635 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 09:46:00,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 09:46:00,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-24 09:46:00,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-10-24 09:46:00,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 09:46:00,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 88 transitions. [2024-10-24 09:46:00,675 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 88 transitions. Word has length 125 [2024-10-24 09:46:00,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:46:00,676 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 88 transitions. [2024-10-24 09:46:00,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 09:46:00,679 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 88 transitions. [2024-10-24 09:46:00,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 09:46:00,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:46:00,689 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:46:00,706 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 09:46:00,889 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 09:46:00,890 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:46:00,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:46:00,891 INFO L85 PathProgramCache]: Analyzing trace with hash 2043235568, now seen corresponding path program 1 times [2024-10-24 09:46:00,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:46:00,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683321791] [2024-10-24 09:46:00,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:46:00,892 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 09:46:00,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:46:00,895 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 09:46:00,895 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 09:46:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:46:01,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 09:46:01,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:46:02,409 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 09:46:02,409 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:46:02,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:46:02,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683321791] [2024-10-24 09:46:02,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1683321791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:46:02,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:46:02,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:46:02,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116825267] [2024-10-24 09:46:02,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:46:02,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:46:02,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:46:02,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:46:02,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:46:02,411 INFO L87 Difference]: Start difference. First operand 57 states and 88 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:46:04,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:46:04,467 INFO L93 Difference]: Finished difference Result 186 states and 288 transitions. [2024-10-24 09:46:04,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:46:04,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2024-10-24 09:46:04,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:46:04,470 INFO L225 Difference]: With dead ends: 186 [2024-10-24 09:46:04,470 INFO L226 Difference]: Without dead ends: 130 [2024-10-24 09:46:04,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 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 09:46:04,471 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 70 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:46:04,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 251 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 09:46:04,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-24 09:46:04,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 110. [2024-10-24 09:46:04,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 67 states have internal predecessors, (90), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 09:46:04,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 170 transitions. [2024-10-24 09:46:04,496 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 170 transitions. Word has length 125 [2024-10-24 09:46:04,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:46:04,497 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 170 transitions. [2024-10-24 09:46:04,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:46:04,497 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 170 transitions. [2024-10-24 09:46:04,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 09:46:04,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:46:04,499 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:46:04,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 09:46:04,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:46:04,700 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:46:04,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:46:04,701 INFO L85 PathProgramCache]: Analyzing trace with hash -888709569, now seen corresponding path program 1 times [2024-10-24 09:46:04,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:46:04,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873718365] [2024-10-24 09:46:04,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:46:04,702 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 09:46:04,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:46:04,704 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:46:04,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 09:46:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:46:04,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 09:46:04,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:46:05,054 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-24 09:46:05,054 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:46:05,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:46:05,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873718365] [2024-10-24 09:46:05,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1873718365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:46:05,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:46:05,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 09:46:05,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562324725] [2024-10-24 09:46:05,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:46:05,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 09:46:05,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:46:05,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 09:46:05,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 09:46:05,056 INFO L87 Difference]: Start difference. First operand 110 states and 170 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:46:07,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:46:07,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:46:07,822 INFO L93 Difference]: Finished difference Result 284 states and 421 transitions. [2024-10-24 09:46:07,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 09:46:07,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2024-10-24 09:46:07,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:46:07,825 INFO L225 Difference]: With dead ends: 284 [2024-10-24 09:46:07,825 INFO L226 Difference]: Without dead ends: 175 [2024-10-24 09:46:07,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-10-24 09:46:07,827 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 109 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-24 09:46:07,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 223 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-24 09:46:07,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-24 09:46:07,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 118. [2024-10-24 09:46:07,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 09:46:07,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 171 transitions. [2024-10-24 09:46:07,855 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 171 transitions. Word has length 126 [2024-10-24 09:46:07,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:46:07,856 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 171 transitions. [2024-10-24 09:46:07,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:46:07,856 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 171 transitions. [2024-10-24 09:46:07,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 09:46:07,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:46:07,858 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:46:07,871 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 (4)] Ended with exit code 0 [2024-10-24 09:46:08,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:46:08,062 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:46:08,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:46:08,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1698056195, now seen corresponding path program 1 times [2024-10-24 09:46:08,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:46:08,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153525787] [2024-10-24 09:46:08,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:46:08,064 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 09:46:08,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:46:08,067 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:46:08,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 09:46:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:46:08,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 09:46:08,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:47:04,120 WARN L286 SmtUtils]: Spent 21.34s on a formula simplification that was a NOOP. DAG size: 116 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)