./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_25-while_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_25-while_file-68.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 cc0f50b1e3335724e12d8f8ff753e8d68608bc02a42487f7cc093f8f08f9715b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:21:45,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:21:45,933 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:21:45,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:21:45,938 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:21:45,955 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:21:45,956 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:21:45,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:21:45,957 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:21:45,958 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:21:45,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:21:45,959 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:21:45,960 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:21:45,960 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:21:45,961 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:21:45,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:21:45,962 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:21:45,962 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:21:45,962 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:21:45,962 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:21:45,963 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:21:45,963 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:21:45,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:21:45,965 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:21:45,965 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:21:45,965 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:21:45,966 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:21:45,966 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:21:45,966 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:21:45,966 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:21:45,966 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:21:45,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:21:45,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:21:45,967 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:21:45,967 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:21:45,967 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:21:45,967 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:21:45,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:21:45,967 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:21:45,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:21:45,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:21:45,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:21:45,980 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 -> cc0f50b1e3335724e12d8f8ff753e8d68608bc02a42487f7cc093f8f08f9715b [2024-10-13 04:21:46,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:21:46,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:21:46,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:21:46,189 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:21:46,189 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:21:46,190 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-68.i [2024-10-13 04:21:47,444 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:21:47,600 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:21:47,601 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-68.i [2024-10-13 04:21:47,607 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e52589f8/eb8e0f11a9054a4193bb6443098bbe7b/FLAGbeb5db371 [2024-10-13 04:21:47,620 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e52589f8/eb8e0f11a9054a4193bb6443098bbe7b [2024-10-13 04:21:47,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:21:47,623 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:21:47,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:21:47,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:21:47,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:21:47,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:21:47" (1/1) ... [2024-10-13 04:21:47,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bffabb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:47, skipping insertion in model container [2024-10-13 04:21:47,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:21:47" (1/1) ... [2024-10-13 04:21:47,650 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:21:47,789 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_25-while_file-68.i[915,928] [2024-10-13 04:21:47,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:21:47,831 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:21:47,841 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_25-while_file-68.i[915,928] [2024-10-13 04:21:47,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:21:47,871 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:21:47,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:47 WrapperNode [2024-10-13 04:21:47,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:21:47,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:21:47,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:21:47,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:21:47,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:47" (1/1) ... [2024-10-13 04:21:47,883 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:47" (1/1) ... [2024-10-13 04:21:47,899 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-10-13 04:21:47,900 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:21:47,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:21:47,900 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:21:47,900 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:21:47,909 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:47" (1/1) ... [2024-10-13 04:21:47,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:47" (1/1) ... [2024-10-13 04:21:47,911 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:47" (1/1) ... [2024-10-13 04:21:47,921 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-13 04:21:47,921 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:47" (1/1) ... [2024-10-13 04:21:47,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:47" (1/1) ... [2024-10-13 04:21:47,925 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:47" (1/1) ... [2024-10-13 04:21:47,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:47" (1/1) ... [2024-10-13 04:21:47,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:47" (1/1) ... [2024-10-13 04:21:47,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:47" (1/1) ... [2024-10-13 04:21:47,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:21:47,932 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:21:47,932 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:21:47,932 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:21:47,932 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:47" (1/1) ... [2024-10-13 04:21:47,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:21:47,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:21:47,960 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-13 04:21:47,961 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-13 04:21:47,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:21:47,994 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:21:47,994 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:21:47,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:21:47,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:21:47,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:21:48,058 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:21:48,059 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:21:48,228 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 04:21:48,229 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:21:48,253 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:21:48,253 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:21:48,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:21:48 BoogieIcfgContainer [2024-10-13 04:21:48,254 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:21:48,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:21:48,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:21:48,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:21:48,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:21:47" (1/3) ... [2024-10-13 04:21:48,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a07b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:21:48, skipping insertion in model container [2024-10-13 04:21:48,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:47" (2/3) ... [2024-10-13 04:21:48,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a07b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:21:48, skipping insertion in model container [2024-10-13 04:21:48,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:21:48" (3/3) ... [2024-10-13 04:21:48,261 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-68.i [2024-10-13 04:21:48,273 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:21:48,273 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:21:48,322 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:21:48,327 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;@6e2d0a87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:21:48,327 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:21:48,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 04:21:48,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-13 04:21:48,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:21:48,339 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:21:48,339 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:21:48,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:21:48,343 INFO L85 PathProgramCache]: Analyzing trace with hash -506235963, now seen corresponding path program 1 times [2024-10-13 04:21:48,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:21:48,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709381738] [2024-10-13 04:21:48,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:21:48,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:21:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:48,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:21:48,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:48,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 04:21:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:48,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 04:21:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:48,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 04:21:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:48,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:21:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:48,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 04:21:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:48,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:21:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:48,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 04:21:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:48,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:21:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:48,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 04:21:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:48,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:21:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:48,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 04:21:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:48,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:21:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:48,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:21:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:48,644 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 04:21:48,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:21:48,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709381738] [2024-10-13 04:21:48,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709381738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:21:48,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:21:48,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:21:48,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924444659] [2024-10-13 04:21:48,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:21:48,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:21:48,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:21:48,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:21:48,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:21:48,676 INFO L87 Difference]: Start difference. First operand has 49 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 04:21:48,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:21:48,752 INFO L93 Difference]: Finished difference Result 95 states and 160 transitions. [2024-10-13 04:21:48,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:21:48,758 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 90 [2024-10-13 04:21:48,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:21:48,764 INFO L225 Difference]: With dead ends: 95 [2024-10-13 04:21:48,765 INFO L226 Difference]: Without dead ends: 47 [2024-10-13 04:21:48,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-13 04:21:48,771 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:21:48,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:21:48,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-13 04:21:48,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-13 04:21:48,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 04:21:48,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 69 transitions. [2024-10-13 04:21:48,803 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 69 transitions. Word has length 90 [2024-10-13 04:21:48,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:21:48,803 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 69 transitions. [2024-10-13 04:21:48,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 04:21:48,803 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 69 transitions. [2024-10-13 04:21:48,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-13 04:21:48,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:21:48,806 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:21:48,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:21:48,806 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:21:48,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:21:48,807 INFO L85 PathProgramCache]: Analyzing trace with hash 419561725, now seen corresponding path program 1 times [2024-10-13 04:21:48,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:21:48,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455578315] [2024-10-13 04:21:48,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:21:48,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:21:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:21:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 04:21:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 04:21:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 04:21:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:21:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 04:21:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:21:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 04:21:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:21:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 04:21:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:21:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 04:21:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:21:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:21:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,137 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 04:21:49,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:21:49,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455578315] [2024-10-13 04:21:49,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455578315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:21:49,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:21:49,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:21:49,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548488109] [2024-10-13 04:21:49,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:21:49,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:21:49,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:21:49,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:21:49,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:21:49,143 INFO L87 Difference]: Start difference. First operand 47 states and 69 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 04:21:49,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:21:49,233 INFO L93 Difference]: Finished difference Result 111 states and 162 transitions. [2024-10-13 04:21:49,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:21:49,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 90 [2024-10-13 04:21:49,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:21:49,237 INFO L225 Difference]: With dead ends: 111 [2024-10-13 04:21:49,237 INFO L226 Difference]: Without dead ends: 65 [2024-10-13 04:21:49,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-13 04:21:49,238 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 19 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:21:49,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 163 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:21:49,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-13 04:21:49,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2024-10-13 04:21:49,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 04:21:49,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2024-10-13 04:21:49,252 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 90 [2024-10-13 04:21:49,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:21:49,254 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2024-10-13 04:21:49,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 04:21:49,255 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2024-10-13 04:21:49,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-13 04:21:49,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:21:49,257 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:21:49,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:21:49,257 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:21:49,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:21:49,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1218636311, now seen corresponding path program 1 times [2024-10-13 04:21:49,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:21:49,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079823474] [2024-10-13 04:21:49,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:21:49,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:21:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:21:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 04:21:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 04:21:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 04:21:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:21:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 04:21:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:21:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 04:21:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:21:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 04:21:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:21:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 04:21:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:21:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:21:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,520 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-13 04:21:49,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:21:49,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079823474] [2024-10-13 04:21:49,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079823474] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:21:49,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091053366] [2024-10-13 04:21:49,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:21:49,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:21:49,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:21:49,525 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 04:21:49,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 04:21:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:49,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 04:21:49,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:21:49,943 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 165 proven. 27 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-13 04:21:49,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:21:50,159 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-13 04:21:50,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091053366] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 04:21:50,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 04:21:50,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2024-10-13 04:21:50,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096247227] [2024-10-13 04:21:50,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 04:21:50,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 04:21:50,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:21:50,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 04:21:50,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-10-13 04:21:50,162 INFO L87 Difference]: Start difference. First operand 56 states and 83 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 5 states have call successors, (42), 3 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) [2024-10-13 04:21:50,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:21:50,603 INFO L93 Difference]: Finished difference Result 219 states and 317 transitions. [2024-10-13 04:21:50,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 04:21:50,604 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 5 states have call successors, (42), 3 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) Word has length 91 [2024-10-13 04:21:50,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:21:50,607 INFO L225 Difference]: With dead ends: 219 [2024-10-13 04:21:50,609 INFO L226 Difference]: Without dead ends: 164 [2024-10-13 04:21:50,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=454, Unknown=0, NotChecked=0, Total=650 [2024-10-13 04:21:50,611 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 216 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 04:21:50,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 217 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 04:21:50,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-13 04:21:50,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 126. [2024-10-13 04:21:50,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 94 states have internal predecessors, (130), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 04:21:50,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 186 transitions. [2024-10-13 04:21:50,630 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 186 transitions. Word has length 91 [2024-10-13 04:21:50,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:21:50,630 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 186 transitions. [2024-10-13 04:21:50,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 5 states have call successors, (42), 3 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) [2024-10-13 04:21:50,631 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 186 transitions. [2024-10-13 04:21:50,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-13 04:21:50,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:21:50,632 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:21:50,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 04:21:50,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:21:50,833 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:21:50,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:21:50,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1767005822, now seen corresponding path program 1 times [2024-10-13 04:21:50,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:21:50,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229765959] [2024-10-13 04:21:50,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:21:50,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:21:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 04:21:50,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1796858895] [2024-10-13 04:21:50,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:21:50,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:21:50,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:21:50,858 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 04:21:50,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 04:21:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:50,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 04:21:50,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:21:51,276 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-10-13 04:21:51,276 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:21:51,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:21:51,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229765959] [2024-10-13 04:21:51,277 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 04:21:51,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796858895] [2024-10-13 04:21:51,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796858895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:21:51,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:21:51,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 04:21:51,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826999824] [2024-10-13 04:21:51,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:21:51,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 04:21:51,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:21:51,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 04:21:51,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:21:51,278 INFO L87 Difference]: Start difference. First operand 126 states and 186 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 04:21:51,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:21:51,425 INFO L93 Difference]: Finished difference Result 286 states and 420 transitions. [2024-10-13 04:21:51,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 04:21:51,426 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2024-10-13 04:21:51,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:21:51,428 INFO L225 Difference]: With dead ends: 286 [2024-10-13 04:21:51,428 INFO L226 Difference]: Without dead ends: 159 [2024-10-13 04:21:51,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-13 04:21:51,429 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 19 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:21:51,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 244 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:21:51,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-13 04:21:51,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-10-13 04:21:51,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 111 states have (on average 1.3333333333333333) internal successors, (148), 111 states have internal predecessors, (148), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 04:21:51,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 232 transitions. [2024-10-13 04:21:51,443 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 232 transitions. Word has length 92 [2024-10-13 04:21:51,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:21:51,444 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 232 transitions. [2024-10-13 04:21:51,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 04:21:51,444 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 232 transitions. [2024-10-13 04:21:51,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-13 04:21:51,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:21:51,445 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:21:51,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 04:21:51,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-13 04:21:51,646 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:21:51,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:21:51,646 INFO L85 PathProgramCache]: Analyzing trace with hash -578449537, now seen corresponding path program 1 times [2024-10-13 04:21:51,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:21:51,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744405849] [2024-10-13 04:21:51,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:21:51,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:21:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:52,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:21:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:52,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 04:21:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:52,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 04:21:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:52,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 04:21:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:52,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:21:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:52,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 04:21:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:52,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:21:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:52,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 04:21:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:52,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:21:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:52,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 04:21:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:52,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:21:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:52,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 04:21:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:52,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:21:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:52,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:21:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:52,208 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 04:21:52,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:21:52,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744405849] [2024-10-13 04:21:52,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744405849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:21:52,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:21:52,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 04:21:52,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848462578] [2024-10-13 04:21:52,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:21:52,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 04:21:52,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:21:52,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 04:21:52,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:21:52,210 INFO L87 Difference]: Start difference. First operand 159 states and 232 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 04:21:52,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:21:52,629 INFO L93 Difference]: Finished difference Result 344 states and 492 transitions. [2024-10-13 04:21:52,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 04:21:52,629 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-10-13 04:21:52,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:21:52,631 INFO L225 Difference]: With dead ends: 344 [2024-10-13 04:21:52,631 INFO L226 Difference]: Without dead ends: 219 [2024-10-13 04:21:52,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-13 04:21:52,633 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 140 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 04:21:52,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 318 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 04:21:52,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-13 04:21:52,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 198. [2024-10-13 04:21:52,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 141 states have (on average 1.2695035460992907) internal successors, (179), 143 states have internal predecessors, (179), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 47 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-13 04:21:52,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 277 transitions. [2024-10-13 04:21:52,670 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 277 transitions. Word has length 94 [2024-10-13 04:21:52,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:21:52,670 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 277 transitions. [2024-10-13 04:21:52,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 04:21:52,670 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 277 transitions. [2024-10-13 04:21:52,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 04:21:52,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:21:52,675 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:21:52,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 04:21:52,675 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:21:52,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:21:52,676 INFO L85 PathProgramCache]: Analyzing trace with hash -521052637, now seen corresponding path program 1 times [2024-10-13 04:21:52,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:21:52,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530085624] [2024-10-13 04:21:52,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:21:52,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:21:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 04:21:52,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [643544436] [2024-10-13 04:21:52,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:21:52,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:21:52,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:21:52,707 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 04:21:52,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 04:21:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:21:52,769 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 04:21:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:21:52,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 04:21:52,845 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 04:21:52,846 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:21:52,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 04:21:53,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:21:53,054 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-13 04:21:53,116 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:21:53,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:21:53 BoogieIcfgContainer [2024-10-13 04:21:53,118 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:21:53,119 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:21:53,119 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:21:53,119 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:21:53,119 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:21:48" (3/4) ... [2024-10-13 04:21:53,121 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 04:21:53,122 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:21:53,123 INFO L158 Benchmark]: Toolchain (without parser) took 5499.37ms. Allocated memory was 167.8MB in the beginning and 253.8MB in the end (delta: 86.0MB). Free memory was 110.8MB in the beginning and 185.1MB in the end (delta: -74.3MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-10-13 04:21:53,123 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 167.8MB. Free memory is still 134.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:21:53,123 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.64ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 95.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 04:21:53,123 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.33ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 94.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:21:53,123 INFO L158 Benchmark]: Boogie Preprocessor took 30.79ms. Allocated memory is still 167.8MB. Free memory was 94.0MB in the beginning and 91.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 04:21:53,124 INFO L158 Benchmark]: RCFGBuilder took 322.20ms. Allocated memory is still 167.8MB. Free memory was 91.5MB in the beginning and 73.6MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 04:21:53,124 INFO L158 Benchmark]: TraceAbstraction took 4862.53ms. Allocated memory was 167.8MB in the beginning and 253.8MB in the end (delta: 86.0MB). Free memory was 73.0MB in the beginning and 185.1MB in the end (delta: -112.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:21:53,124 INFO L158 Benchmark]: Witness Printer took 3.54ms. Allocated memory is still 253.8MB. Free memory is still 185.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:21:53,125 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 167.8MB. Free memory is still 134.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.64ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 95.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.33ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 94.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.79ms. Allocated memory is still 167.8MB. Free memory was 94.0MB in the beginning and 91.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 322.20ms. Allocated memory is still 167.8MB. Free memory was 91.5MB in the beginning and 73.6MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4862.53ms. Allocated memory was 167.8MB in the beginning and 253.8MB in the end (delta: 86.0MB). Free memory was 73.0MB in the beginning and 185.1MB in the end (delta: -112.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.54ms. Allocated memory is still 253.8MB. Free memory is still 185.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of shiftRight at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 32; [L23] float var_1_2 = 64.5; [L24] float var_1_3 = 16.8; [L25] signed long int var_1_8 = 10; [L26] signed long int var_1_9 = 25; [L27] double var_1_10 = 0.75; [L28] signed long int var_1_11 = 2; [L29] signed long int var_1_12 = 32; [L30] unsigned char var_1_13 = 0; [L31] unsigned char var_1_14 = 0; [L32] double var_1_15 = 50.2; [L33] signed long int last_1_var_1_9 = 25; [L34] double last_1_var_1_10 = 0.75; [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] CALL updateLastVariables() [L90] last_1_var_1_9 = var_1_9 [L91] last_1_var_1_10 = var_1_10 [L101] RET updateLastVariables() [L102] CALL updateVariables() [L66] var_1_2 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_3=84/5, var_1_8=10, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_3=84/5, var_1_8=10, var_1_9=25] [L67] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_3=84/5, var_1_8=10, var_1_9=25] [L68] var_1_3 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=10, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=10, var_1_9=25] [L69] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=10, var_1_9=25] [L70] var_1_8 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L71] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L72] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L72] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L73] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L73] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L74] var_1_11 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_11 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L75] RET assume_abort_if_not(var_1_11 >= -1) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L76] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L76] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L77] var_1_12 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L78] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L79] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L79] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L80] var_1_13 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L81] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L82] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L82] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L83] var_1_14 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L84] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L85] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L85] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L86] var_1_15 = __VERIFIER_nondet_double() [L87] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=32, var_1_8=27, var_1_9=25] [L87] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=32, var_1_8=27, var_1_9=25] [L102] RET updateVariables() [L103] CALL step() [L38] signed long int stepLocal_0 = last_1_var_1_9 + last_1_var_1_9; VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=32, var_1_8=27, var_1_9=25] [L39] COND FALSE !((var_1_2 - var_1_3) >= last_1_var_1_10) [L44] var_1_1 = last_1_var_1_9 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=25, var_1_8=27, var_1_9=25] [L46] signed long int stepLocal_2 = var_1_1; [L47] signed long int stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, stepLocal_1=25, stepLocal_2=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=25, var_1_8=27, var_1_9=25] [L48] EXPR var_1_8 >> last_1_var_1_9 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, stepLocal_1=25, stepLocal_2=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=25, var_1_8=27, var_1_9=25] [L48] COND FALSE !((var_1_8 >> last_1_var_1_9) > stepLocal_1) [L55] var_1_9 = last_1_var_1_9 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, stepLocal_2=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=25, var_1_8=27, var_1_9=25] [L57] COND TRUE ((((var_1_9) > (var_1_1)) ? (var_1_9) : (var_1_1))) == (var_1_9 * (var_1_11 - var_1_12)) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, stepLocal_2=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=25, var_1_8=27, var_1_9=25] [L58] COND TRUE var_1_13 || var_1_14 [L59] var_1_10 = var_1_15 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, stepLocal_2=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR (((var_1_2 - var_1_3) >= last_1_var_1_10) ? (((last_1_var_1_9 + last_1_var_1_9) >= (last_1_var_1_9 / var_1_8)) ? (var_1_1 == ((signed long int) last_1_var_1_9)) : 1) : (var_1_1 == ((signed long int) last_1_var_1_9))) && (((var_1_8 >> last_1_var_1_9) > var_1_1) ? (((var_1_1 >> 8) > var_1_1) ? (var_1_9 == ((signed long int) var_1_1)) : (var_1_9 == ((signed long int) last_1_var_1_9))) : (var_1_9 == ((signed long int) last_1_var_1_9))) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] [L94] EXPR var_1_8 >> last_1_var_1_9 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] [L94] EXPR (((var_1_2 - var_1_3) >= last_1_var_1_10) ? (((last_1_var_1_9 + last_1_var_1_9) >= (last_1_var_1_9 / var_1_8)) ? (var_1_1 == ((signed long int) last_1_var_1_9)) : 1) : (var_1_1 == ((signed long int) last_1_var_1_9))) && (((var_1_8 >> last_1_var_1_9) > var_1_1) ? (((var_1_1 >> 8) > var_1_1) ? (var_1_9 == ((signed long int) var_1_1)) : (var_1_9 == ((signed long int) last_1_var_1_9))) : (var_1_9 == ((signed long int) last_1_var_1_9))) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] [L94-L95] return ((((var_1_2 - var_1_3) >= last_1_var_1_10) ? (((last_1_var_1_9 + last_1_var_1_9) >= (last_1_var_1_9 / var_1_8)) ? (var_1_1 == ((signed long int) last_1_var_1_9)) : 1) : (var_1_1 == ((signed long int) last_1_var_1_9))) && (((var_1_8 >> last_1_var_1_9) > var_1_1) ? (((var_1_1 >> 8) > var_1_1) ? (var_1_9 == ((signed long int) var_1_1)) : (var_1_9 == ((signed long int) last_1_var_1_9))) : (var_1_9 == ((signed long int) last_1_var_1_9)))) && ((((((var_1_9) > (var_1_1)) ? (var_1_9) : (var_1_1))) == (var_1_9 * (var_1_11 - var_1_12))) ? ((var_1_13 || var_1_14) ? (var_1_10 == ((double) var_1_15)) : (var_1_10 == ((double) var_1_15))) : 1) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 410 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 394 mSDsluCounter, 1008 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 699 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 871 IncrementalHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 309 mSDtfsCounter, 871 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 436 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=5, InterpolantAutomatonStates: 37, 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, 5 MinimizatonAttempts, 68 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 830 NumberOfCodeBlocks, 830 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 632 ConstructedInterpolants, 0 QuantifiedInterpolants, 2482 SizeOfPredicates, 7 NumberOfNonLiveVariables, 426 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 2467/2548 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-13 04:21:53,153 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_25-while_file-68.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 cc0f50b1e3335724e12d8f8ff753e8d68608bc02a42487f7cc093f8f08f9715b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:21:55,052 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:21:55,119 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 04:21:55,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:21:55,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:21:55,147 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:21:55,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:21:55,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:21:55,151 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:21:55,152 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:21:55,152 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:21:55,152 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:21:55,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:21:55,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:21:55,154 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:21:55,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:21:55,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:21:55,155 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:21:55,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:21:55,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:21:55,158 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:21:55,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:21:55,159 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:21:55,159 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 04:21:55,159 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 04:21:55,159 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:21:55,159 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 04:21:55,160 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:21:55,160 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:21:55,160 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:21:55,160 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:21:55,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:21:55,160 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:21:55,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:21:55,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:21:55,161 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:21:55,161 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:21:55,161 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:21:55,161 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 04:21:55,161 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 04:21:55,161 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:21:55,163 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:21:55,163 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:21:55,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:21:55,163 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 04:21:55,163 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 -> cc0f50b1e3335724e12d8f8ff753e8d68608bc02a42487f7cc093f8f08f9715b [2024-10-13 04:21:55,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:21:55,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:21:55,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:21:55,440 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:21:55,440 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:21:55,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-68.i [2024-10-13 04:21:56,709 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:21:56,864 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:21:56,865 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-68.i [2024-10-13 04:21:56,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14d72ee41/47fbb5a1db6f4e1fa9e9fa119812cda4/FLAG7202b758b [2024-10-13 04:21:56,889 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14d72ee41/47fbb5a1db6f4e1fa9e9fa119812cda4 [2024-10-13 04:21:56,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:21:56,892 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:21:56,903 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:21:56,904 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:21:56,908 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:21:56,908 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:21:56" (1/1) ... [2024-10-13 04:21:56,909 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4336f79d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:56, skipping insertion in model container [2024-10-13 04:21:56,909 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:21:56" (1/1) ... [2024-10-13 04:21:56,931 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:21:57,060 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_25-while_file-68.i[915,928] [2024-10-13 04:21:57,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:21:57,099 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:21:57,109 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_25-while_file-68.i[915,928] [2024-10-13 04:21:57,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:21:57,148 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:21:57,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:57 WrapperNode [2024-10-13 04:21:57,149 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:21:57,150 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:21:57,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:21:57,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:21:57,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:57" (1/1) ... [2024-10-13 04:21:57,168 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:57" (1/1) ... [2024-10-13 04:21:57,190 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2024-10-13 04:21:57,193 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:21:57,194 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:21:57,194 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:21:57,194 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:21:57,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:57" (1/1) ... [2024-10-13 04:21:57,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:57" (1/1) ... [2024-10-13 04:21:57,208 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:57" (1/1) ... [2024-10-13 04:21:57,219 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-13 04:21:57,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:57" (1/1) ... [2024-10-13 04:21:57,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:57" (1/1) ... [2024-10-13 04:21:57,224 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:57" (1/1) ... [2024-10-13 04:21:57,228 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:57" (1/1) ... [2024-10-13 04:21:57,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:57" (1/1) ... [2024-10-13 04:21:57,230 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:57" (1/1) ... [2024-10-13 04:21:57,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:21:57,237 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:21:57,237 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:21:57,237 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:21:57,238 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:57" (1/1) ... [2024-10-13 04:21:57,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:21:57,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:21:57,264 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-13 04:21:57,274 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-13 04:21:57,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:21:57,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 04:21:57,310 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:21:57,310 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:21:57,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:21:57,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:21:57,367 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:21:57,369 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:21:58,355 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 04:21:58,355 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:21:58,404 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:21:58,406 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:21:58,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:21:58 BoogieIcfgContainer [2024-10-13 04:21:58,406 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:21:58,408 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:21:58,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:21:58,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:21:58,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:21:56" (1/3) ... [2024-10-13 04:21:58,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73758297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:21:58, skipping insertion in model container [2024-10-13 04:21:58,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:57" (2/3) ... [2024-10-13 04:21:58,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73758297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:21:58, skipping insertion in model container [2024-10-13 04:21:58,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:21:58" (3/3) ... [2024-10-13 04:21:58,416 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-68.i [2024-10-13 04:21:58,431 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:21:58,432 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:21:58,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:21:58,493 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;@2f97b11c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:21:58,495 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:21:58,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 04:21:58,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-13 04:21:58,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:21:58,508 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:21:58,508 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:21:58,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:21:58,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1779491274, now seen corresponding path program 1 times [2024-10-13 04:21:58,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:21:58,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505159263] [2024-10-13 04:21:58,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:21:58,527 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-13 04:21:58,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:21:58,528 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-13 04:21:58,529 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-13 04:21:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:58,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 04:21:58,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:21:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-10-13 04:21:58,786 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:21:58,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:21:58,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505159263] [2024-10-13 04:21:58,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505159263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:21:58,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:21:58,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:21:58,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938253347] [2024-10-13 04:21:58,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:21:58,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:21:58,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:21:58,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:21:58,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:21:58,818 INFO L87 Difference]: Start difference. First operand has 42 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 04:21:59,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:21:59,059 INFO L93 Difference]: Finished difference Result 81 states and 140 transitions. [2024-10-13 04:21:59,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:21:59,074 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 87 [2024-10-13 04:21:59,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:21:59,079 INFO L225 Difference]: With dead ends: 81 [2024-10-13 04:21:59,080 INFO L226 Difference]: Without dead ends: 40 [2024-10-13 04:21:59,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-13 04:21:59,085 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:21:59,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:21:59,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-13 04:21:59,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-13 04:21:59,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 04:21:59,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2024-10-13 04:21:59,118 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 87 [2024-10-13 04:21:59,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:21:59,119 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2024-10-13 04:21:59,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 04:21:59,120 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2024-10-13 04:21:59,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-13 04:21:59,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:21:59,124 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:21:59,132 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-13 04:21:59,324 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-13 04:21:59,325 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:21:59,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:21:59,325 INFO L85 PathProgramCache]: Analyzing trace with hash -109683714, now seen corresponding path program 1 times [2024-10-13 04:21:59,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:21:59,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444988862] [2024-10-13 04:21:59,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:21:59,327 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-13 04:21:59,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:21:59,329 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-13 04:21:59,331 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-13 04:21:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:59,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 04:21:59,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:22:09,727 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 04:22:09,729 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:22:09,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:22:09,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444988862] [2024-10-13 04:22:09,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444988862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:22:09,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:22:09,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 04:22:09,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554896890] [2024-10-13 04:22:09,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:22:09,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 04:22:09,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:22:09,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 04:22:09,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:22:09,731 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 04:22:31,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:22:31,755 INFO L93 Difference]: Finished difference Result 104 states and 148 transitions. [2024-10-13 04:22:31,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 04:22:31,770 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 87 [2024-10-13 04:22:31,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:22:31,772 INFO L225 Difference]: With dead ends: 104 [2024-10-13 04:22:31,772 INFO L226 Difference]: Without dead ends: 102 [2024-10-13 04:22:31,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-13 04:22:31,773 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 104 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:22:31,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 214 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 20.0s Time] [2024-10-13 04:22:31,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-13 04:22:31,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2024-10-13 04:22:31,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 52 states have internal predecessors, (69), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 04:22:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2024-10-13 04:22:31,795 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 87 [2024-10-13 04:22:31,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:22:31,796 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2024-10-13 04:22:31,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 04:22:31,798 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2024-10-13 04:22:31,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-13 04:22:31,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:22:31,799 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:22:31,810 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-13 04:22:32,000 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-13 04:22:32,000 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:22:32,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:22:32,001 INFO L85 PathProgramCache]: Analyzing trace with hash 885412043, now seen corresponding path program 1 times [2024-10-13 04:22:32,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:22:32,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137395988] [2024-10-13 04:22:32,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:22:32,002 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-13 04:22:32,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:22:32,004 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-13 04:22:32,005 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-13 04:22:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:22:32,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 04:22:32,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:22:52,629 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-13 04:22:52,629 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:22:52,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:22:52,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137395988] [2024-10-13 04:22:52,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2137395988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:22:52,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:22:52,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 04:22:52,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838273629] [2024-10-13 04:22:52,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:22:52,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 04:22:52,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:22:52,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 04:22:52,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-13 04:22:52,632 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 04:23:13,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:23:14,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:23:14,181 INFO L93 Difference]: Finished difference Result 108 states and 151 transitions. [2024-10-13 04:23:14,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 04:23:14,199 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 88 [2024-10-13 04:23:14,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:23:14,201 INFO L225 Difference]: With dead ends: 108 [2024-10-13 04:23:14,201 INFO L226 Difference]: Without dead ends: 106 [2024-10-13 04:23:14,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-10-13 04:23:14,203 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 109 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.9s IncrementalHoareTripleChecker+Time [2024-10-13 04:23:14,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 178 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 17.9s Time] [2024-10-13 04:23:14,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-13 04:23:14,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2024-10-13 04:23:14,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 56 states have internal predecessors, (74), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 04:23:14,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 130 transitions. [2024-10-13 04:23:14,219 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 130 transitions. Word has length 88 [2024-10-13 04:23:14,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:23:14,220 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 130 transitions. [2024-10-13 04:23:14,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 04:23:14,220 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 130 transitions. [2024-10-13 04:23:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-13 04:23:14,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:23:14,224 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:23:14,234 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-13 04:23:14,424 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-13 04:23:14,425 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:23:14,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:23:14,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1886774286, now seen corresponding path program 1 times [2024-10-13 04:23:14,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:23:14,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704557103] [2024-10-13 04:23:14,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:23:14,426 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-13 04:23:14,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:23:14,429 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-13 04:23:14,430 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-13 04:23:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:23:14,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 04:23:14,589 INFO L278 TraceCheckSpWp]: Computing forward predicates...