./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-91.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-91.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 50cbd928f19c8de7d0fc761d4d92468ffab28bbc323c734fbd3b038f244d4544 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:24:28,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:24:28,921 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:24:28,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:24:28,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:24:28,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:24:28,940 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:24:28,940 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:24:28,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:24:28,940 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:24:28,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:24:28,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:24:28,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:24:28,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:24:28,945 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:24:28,945 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:24:28,945 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:24:28,946 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:24:28,946 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:24:28,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:24:28,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:24:28,951 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:24:28,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:24:28,952 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:24:28,952 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:24:28,952 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:24:28,952 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:24:28,952 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:24:28,953 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:24:28,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:24:28,953 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:24:28,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:24:28,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:24:28,954 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:24:28,954 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:24:28,954 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:24:28,954 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:24:28,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:24:28,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:24:28,955 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:24:28,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:24:28,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:24:28,958 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 -> 50cbd928f19c8de7d0fc761d4d92468ffab28bbc323c734fbd3b038f244d4544 [2024-10-13 04:24:29,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:24:29,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:24:29,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:24:29,201 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:24:29,201 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:24:29,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-91.i [2024-10-13 04:24:30,477 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:24:30,641 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:24:30,642 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-91.i [2024-10-13 04:24:30,650 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/233fe9fa1/b284544db97c468da6f11cd9679af9e6/FLAG22dc775eb [2024-10-13 04:24:30,665 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/233fe9fa1/b284544db97c468da6f11cd9679af9e6 [2024-10-13 04:24:30,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:24:30,668 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:24:30,670 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:24:30,671 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:24:30,675 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:24:30,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:24:30" (1/1) ... [2024-10-13 04:24:30,677 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16fce0dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:30, skipping insertion in model container [2024-10-13 04:24:30,678 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:24:30" (1/1) ... [2024-10-13 04:24:30,697 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:24:30,821 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-91.i[915,928] [2024-10-13 04:24:30,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:24:30,875 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:24:30,886 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-91.i[915,928] [2024-10-13 04:24:30,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:24:30,923 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:24:30,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:30 WrapperNode [2024-10-13 04:24:30,924 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:24:30,925 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:24:30,926 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:24:30,926 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:24:30,931 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:24:30" (1/1) ... [2024-10-13 04:24:30,943 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:24:30" (1/1) ... [2024-10-13 04:24:30,980 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-10-13 04:24:30,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:24:30,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:24:30,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:24:30,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:24:30,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:30" (1/1) ... [2024-10-13 04:24:30,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:30" (1/1) ... [2024-10-13 04:24:30,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:30" (1/1) ... [2024-10-13 04:24:31,015 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:24:31,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:30" (1/1) ... [2024-10-13 04:24:31,016 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:30" (1/1) ... [2024-10-13 04:24:31,022 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:30" (1/1) ... [2024-10-13 04:24:31,030 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:30" (1/1) ... [2024-10-13 04:24:31,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:30" (1/1) ... [2024-10-13 04:24:31,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:30" (1/1) ... [2024-10-13 04:24:31,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:24:31,039 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:24:31,039 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:24:31,039 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:24:31,040 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:30" (1/1) ... [2024-10-13 04:24:31,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:24:31,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:24:31,071 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:24:31,074 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:24:31,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:24:31,115 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:24:31,116 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:24:31,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:24:31,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:24:31,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:24:31,183 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:24:31,185 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:24:31,432 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 04:24:31,433 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:24:31,464 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:24:31,464 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:24:31,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:24:31 BoogieIcfgContainer [2024-10-13 04:24:31,465 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:24:31,468 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:24:31,468 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:24:31,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:24:31,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:24:30" (1/3) ... [2024-10-13 04:24:31,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db6e1ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:24:31, skipping insertion in model container [2024-10-13 04:24:31,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:30" (2/3) ... [2024-10-13 04:24:31,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db6e1ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:24:31, skipping insertion in model container [2024-10-13 04:24:31,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:24:31" (3/3) ... [2024-10-13 04:24:31,475 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-91.i [2024-10-13 04:24:31,488 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:24:31,489 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:24:31,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:24:31,554 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;@6e3fbadf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:24:31,556 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:24:31,560 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 states have internal predecessors, (53), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 04:24:31,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-13 04:24:31,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:24:31,574 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:31,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:24:31,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:24:31,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1959645074, now seen corresponding path program 1 times [2024-10-13 04:24:31,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:24:31,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053146969] [2024-10-13 04:24:31,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:24:31,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:24:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:31,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:24:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:31,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:24:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:31,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:24:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:31,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:24:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:31,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:24:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:31,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:24:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:31,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:24:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:31,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:24:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:31,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:24:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:31,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 04:24:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:31,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:24:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:31,843 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 04:24:31,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:24:31,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053146969] [2024-10-13 04:24:31,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053146969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:24:31,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:24:31,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:24:31,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318152552] [2024-10-13 04:24:31,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:24:31,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:24:31,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:24:31,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:24:31,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:24:31,872 INFO L87 Difference]: Start difference. First operand has 49 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 states have internal predecessors, (53), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 04:24:31,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:24:31,903 INFO L93 Difference]: Finished difference Result 95 states and 159 transitions. [2024-10-13 04:24:31,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:24:31,906 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 71 [2024-10-13 04:24:31,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:24:31,911 INFO L225 Difference]: With dead ends: 95 [2024-10-13 04:24:31,912 INFO L226 Difference]: Without dead ends: 47 [2024-10-13 04:24:31,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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:24:31,917 INFO L432 NwaCegarLoop]: 67 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, 67 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:24:31,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:24:31,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-13 04:24:31,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-13 04:24:31,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 04:24:31,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 70 transitions. [2024-10-13 04:24:31,958 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 70 transitions. Word has length 71 [2024-10-13 04:24:31,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:24:31,959 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 70 transitions. [2024-10-13 04:24:31,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 04:24:31,960 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 70 transitions. [2024-10-13 04:24:31,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-13 04:24:31,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:24:31,963 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:31,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:24:31,963 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:24:31,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:24:31,964 INFO L85 PathProgramCache]: Analyzing trace with hash -366224976, now seen corresponding path program 1 times [2024-10-13 04:24:31,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:24:31,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180679282] [2024-10-13 04:24:31,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:24:31,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:24:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:32,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:24:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:32,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:24:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:32,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:24:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:32,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:24:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:32,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:24:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:32,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:24:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:32,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:24:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:32,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:24:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:32,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:24:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:32,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 04:24:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:32,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:24:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:32,743 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 04:24:32,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:24:32,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180679282] [2024-10-13 04:24:32,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180679282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:24:32,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:24:32,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 04:24:32,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377200144] [2024-10-13 04:24:32,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:24:32,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 04:24:32,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:24:32,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 04:24:32,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:24:32,748 INFO L87 Difference]: Start difference. First operand 47 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 04:24:37,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 04:24:41,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 04:24:41,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:24:41,805 INFO L93 Difference]: Finished difference Result 148 states and 216 transitions. [2024-10-13 04:24:41,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 04:24:41,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 71 [2024-10-13 04:24:41,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:24:41,807 INFO L225 Difference]: With dead ends: 148 [2024-10-13 04:24:41,807 INFO L226 Difference]: Without dead ends: 102 [2024-10-13 04:24:41,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 04:24:41,810 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 87 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:24:41,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 262 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 2 Unknown, 0 Unchecked, 9.0s Time] [2024-10-13 04:24:41,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-13 04:24:41,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 50. [2024-10-13 04:24:41,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 37 states have internal predecessors, (52), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 04:24:41,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2024-10-13 04:24:41,818 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 71 [2024-10-13 04:24:41,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:24:41,819 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 74 transitions. [2024-10-13 04:24:41,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 04:24:41,819 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2024-10-13 04:24:41,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-13 04:24:41,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:24:41,821 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:41,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:24:41,821 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:24:41,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:24:41,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1408782386, now seen corresponding path program 1 times [2024-10-13 04:24:41,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:24:41,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001811037] [2024-10-13 04:24:41,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:24:41,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:24:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 04:24:41,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1046042422] [2024-10-13 04:24:41,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:24:41,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:24:41,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:24:41,863 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:24:41,865 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:24:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:24:41,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 04:24:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:24:42,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 04:24:42,037 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 04:24:42,038 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:24:42,050 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:24:42,240 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:24:42,243 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 04:24:42,296 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:24:42,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:24:42 BoogieIcfgContainer [2024-10-13 04:24:42,298 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:24:42,298 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:24:42,299 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:24:42,299 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:24:42,299 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:24:31" (3/4) ... [2024-10-13 04:24:42,300 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 04:24:42,301 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:24:42,302 INFO L158 Benchmark]: Toolchain (without parser) took 11633.90ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 97.2MB in the beginning and 154.8MB in the end (delta: -57.6MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2024-10-13 04:24:42,302 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 153.1MB. Free memory was 111.8MB in the beginning and 111.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:24:42,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.87ms. Allocated memory is still 153.1MB. Free memory was 97.2MB in the beginning and 83.7MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 04:24:42,304 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.97ms. Allocated memory is still 153.1MB. Free memory was 83.3MB in the beginning and 81.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:24:42,305 INFO L158 Benchmark]: Boogie Preprocessor took 57.17ms. Allocated memory is still 153.1MB. Free memory was 81.2MB in the beginning and 78.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:24:42,305 INFO L158 Benchmark]: RCFGBuilder took 425.72ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 78.4MB in the beginning and 189.4MB in the end (delta: -111.0MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-10-13 04:24:42,305 INFO L158 Benchmark]: TraceAbstraction took 10830.24ms. Allocated memory is still 222.3MB. Free memory was 189.4MB in the beginning and 155.8MB in the end (delta: 33.6MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2024-10-13 04:24:42,305 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 222.3MB. Free memory was 155.8MB in the beginning and 154.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:24:42,306 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.12ms. Allocated memory is still 153.1MB. Free memory was 111.8MB in the beginning and 111.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.87ms. Allocated memory is still 153.1MB. Free memory was 97.2MB in the beginning and 83.7MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.97ms. Allocated memory is still 153.1MB. Free memory was 83.3MB in the beginning and 81.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.17ms. Allocated memory is still 153.1MB. Free memory was 81.2MB in the beginning and 78.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 425.72ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 78.4MB in the beginning and 189.4MB in the end (delta: -111.0MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10830.24ms. Allocated memory is still 222.3MB. Free memory was 189.4MB in the beginning and 155.8MB in the end (delta: 33.6MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. * Witness Printer took 2.97ms. Allocated memory is still 222.3MB. Free memory was 155.8MB in the beginning and 154.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 100000000; [L23] signed short int var_1_5 = 1; [L24] signed short int var_1_8 = -128; [L25] signed short int var_1_9 = 1; [L26] float var_1_10 = 25.8; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 1; [L29] float var_1_13 = 16.45; [L30] unsigned long int var_1_14 = 200; [L31] unsigned short int var_1_15 = 32; [L32] unsigned short int var_1_16 = 256; [L90] isInitial = 1 [L91] FCALL initially() [L92] COND TRUE 1 [L93] FCALL updateLastVariables() [L94] CALL updateVariables() [L65] var_1_8 = __VERIFIER_nondet_short() [L66] CALL assume_abort_if_not(var_1_8 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=1] [L66] RET assume_abort_if_not(var_1_8 >= -32767) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=1] [L67] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=1] [L67] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=1] [L68] var_1_9 = __VERIFIER_nondet_short() [L69] CALL assume_abort_if_not(var_1_9 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L69] RET assume_abort_if_not(var_1_9 >= -32767) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L70] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L70] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L71] var_1_11 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L72] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=129/5, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L73] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L73] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L74] var_1_12 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L75] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L76] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L77] var_1_13 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L78] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L79] var_1_16 = __VERIFIER_nondet_ushort() [L80] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L80] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_16=-65530, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_16=-65530, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L81] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_16=-65530, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L94] RET updateVariables() [L95] CALL step() [L36] var_1_15 = var_1_16 [L37] var_1_14 = var_1_15 VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=6, var_1_15=-65530, var_1_16=-65530, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L38] COND FALSE !(\read(var_1_11)) [L49] var_1_10 = var_1_13 VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=6, var_1_15=-65530, var_1_16=-65530, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L51] COND FALSE !(var_1_10 >= 50.4f) VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=6, var_1_15=-65530, var_1_16=-65530, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L54] COND FALSE !(var_1_15 == (var_1_14 * var_1_15)) [L61] var_1_5 = var_1_8 VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=6, var_1_15=-65530, var_1_16=-65530, var_1_1=100000000, var_1_5=0, var_1_8=0, var_1_9=0] [L95] RET step() [L96] CALL, EXPR property() [L86] EXPR (((var_1_10 >= 50.4f) ? (var_1_1 == ((unsigned long int) ((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))))) : 1) && ((var_1_15 == (var_1_14 * var_1_15)) ? ((var_1_10 >= (var_1_10 + var_1_10)) ? (var_1_5 == ((signed short int) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_5 == ((signed short int) var_1_8))) : (var_1_5 == ((signed short int) var_1_8)))) && (var_1_11 ? (var_1_12 ? (((var_1_15 & var_1_14) == var_1_15) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_13))) : (var_1_10 == ((float) var_1_13))) : (var_1_10 == ((float) var_1_13))) VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=6, var_1_15=-65530, var_1_16=-65530, var_1_1=100000000, var_1_5=0, var_1_8=0, var_1_9=0] [L86-L87] return (((((var_1_10 >= 50.4f) ? (var_1_1 == ((unsigned long int) ((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))))) : 1) && ((var_1_15 == (var_1_14 * var_1_15)) ? ((var_1_10 >= (var_1_10 + var_1_10)) ? (var_1_5 == ((signed short int) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_5 == ((signed short int) var_1_8))) : (var_1_5 == ((signed short int) var_1_8)))) && (var_1_11 ? (var_1_12 ? (((var_1_15 & var_1_14) == var_1_15) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_13))) : (var_1_10 == ((float) var_1_13))) : (var_1_10 == ((float) var_1_13)))) && (var_1_14 == ((unsigned long int) var_1_15))) && (var_1_15 == ((unsigned short int) var_1_16)) ; [L96] RET, EXPR property() [L96] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=6, var_1_15=-65530, var_1_16=-65530, var_1_1=100000000, var_1_5=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=6, var_1_15=-65530, var_1_16=-65530, var_1_1=100000000, var_1_5=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 9.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 329 SdHoareTripleChecker+Invalid, 8.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 164 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 98 IncrementalHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 165 mSDtfsCounter, 98 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 52 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 169 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 440/440 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:24:42,334 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-91.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 50cbd928f19c8de7d0fc761d4d92468ffab28bbc323c734fbd3b038f244d4544 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:24:44,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:24:44,510 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 04:24:44,516 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:24:44,517 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:24:44,543 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:24:44,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:24:44,547 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:24:44,548 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:24:44,549 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:24:44,549 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:24:44,550 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:24:44,550 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:24:44,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:24:44,552 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:24:44,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:24:44,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:24:44,553 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:24:44,553 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:24:44,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:24:44,554 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:24:44,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:24:44,555 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:24:44,555 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 04:24:44,556 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 04:24:44,556 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:24:44,556 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 04:24:44,556 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:24:44,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:24:44,557 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:24:44,557 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:24:44,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:24:44,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:24:44,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:24:44,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:24:44,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:24:44,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:24:44,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:24:44,559 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 04:24:44,560 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 04:24:44,560 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:24:44,560 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:24:44,560 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:24:44,560 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:24:44,560 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 04:24:44,561 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 -> 50cbd928f19c8de7d0fc761d4d92468ffab28bbc323c734fbd3b038f244d4544 [2024-10-13 04:24:44,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:24:44,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:24:44,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:24:44,835 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:24:44,836 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:24:44,837 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-91.i [2024-10-13 04:24:46,124 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:24:46,298 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:24:46,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-91.i [2024-10-13 04:24:46,306 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6effa6d42/508b9ac0c7194d04a35c77b2db4962a6/FLAGf8aa5b34c [2024-10-13 04:24:46,697 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6effa6d42/508b9ac0c7194d04a35c77b2db4962a6 [2024-10-13 04:24:46,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:24:46,700 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:24:46,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:24:46,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:24:46,707 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:24:46,708 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:24:46" (1/1) ... [2024-10-13 04:24:46,709 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@246247b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:46, skipping insertion in model container [2024-10-13 04:24:46,709 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:24:46" (1/1) ... [2024-10-13 04:24:46,731 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:24:46,889 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-91.i[915,928] [2024-10-13 04:24:46,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:24:46,958 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:24:46,973 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-91.i[915,928] [2024-10-13 04:24:46,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:24:47,023 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:24:47,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:47 WrapperNode [2024-10-13 04:24:47,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:24:47,025 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:24:47,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:24:47,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:24:47,033 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:24:47" (1/1) ... [2024-10-13 04:24:47,046 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:24:47" (1/1) ... [2024-10-13 04:24:47,068 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2024-10-13 04:24:47,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:24:47,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:24:47,071 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:24:47,072 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:24:47,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:47" (1/1) ... [2024-10-13 04:24:47,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:47" (1/1) ... [2024-10-13 04:24:47,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:47" (1/1) ... [2024-10-13 04:24:47,103 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:24:47,103 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:47" (1/1) ... [2024-10-13 04:24:47,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:47" (1/1) ... [2024-10-13 04:24:47,113 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:47" (1/1) ... [2024-10-13 04:24:47,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:47" (1/1) ... [2024-10-13 04:24:47,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:47" (1/1) ... [2024-10-13 04:24:47,122 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:47" (1/1) ... [2024-10-13 04:24:47,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:24:47,127 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:24:47,127 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:24:47,127 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:24:47,128 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:47" (1/1) ... [2024-10-13 04:24:47,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:24:47,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:24:47,154 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:24:47,156 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:24:47,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:24:47,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 04:24:47,186 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:24:47,187 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:24:47,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:24:47,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:24:47,250 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:24:47,252 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:24:47,513 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-13 04:24:47,514 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:24:47,554 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:24:47,560 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:24:47,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:24:47 BoogieIcfgContainer [2024-10-13 04:24:47,561 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:24:47,562 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:24:47,562 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:24:47,565 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:24:47,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:24:46" (1/3) ... [2024-10-13 04:24:47,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d86f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:24:47, skipping insertion in model container [2024-10-13 04:24:47,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:24:47" (2/3) ... [2024-10-13 04:24:47,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d86f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:24:47, skipping insertion in model container [2024-10-13 04:24:47,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:24:47" (3/3) ... [2024-10-13 04:24:47,567 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-91.i [2024-10-13 04:24:47,580 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:24:47,581 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:24:47,642 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:24:47,650 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;@5af01cba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:24:47,650 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:24:47,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 04:24:47,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-13 04:24:47,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:24:47,665 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:47,666 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:24:47,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:24:47,674 INFO L85 PathProgramCache]: Analyzing trace with hash -393669120, now seen corresponding path program 1 times [2024-10-13 04:24:47,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:24:47,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759042715] [2024-10-13 04:24:47,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:24:47,691 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:24:47,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:24:47,694 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:24:47,696 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:24:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:24:47,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 04:24:47,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:24:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-13 04:24:50,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:25:13,701 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 04:25:13,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:25:13,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759042715] [2024-10-13 04:25:13,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759042715] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 04:25:13,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 04:25:13,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2024-10-13 04:25:13,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910324213] [2024-10-13 04:25:13,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:25:13,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 04:25:13,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:25:13,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 04:25:13,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-10-13 04:25:13,727 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 04:25:20,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:25:20,875 INFO L93 Difference]: Finished difference Result 106 states and 181 transitions. [2024-10-13 04:25:20,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 04:25:20,880 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 69 [2024-10-13 04:25:20,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:25:20,885 INFO L225 Difference]: With dead ends: 106 [2024-10-13 04:25:20,886 INFO L226 Difference]: Without dead ends: 71 [2024-10-13 04:25:20,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-13 04:25:20,894 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 78 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-13 04:25:20,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 176 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-13 04:25:20,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-13 04:25:20,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2024-10-13 04:25:20,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 42 states have internal predecessors, (50), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 04:25:20,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 90 transitions. [2024-10-13 04:25:20,937 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 90 transitions. Word has length 69 [2024-10-13 04:25:20,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:25:20,937 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 90 transitions. [2024-10-13 04:25:20,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 04:25:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2024-10-13 04:25:20,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-13 04:25:20,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:25:20,940 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:20,947 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:25:21,140 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:25:21,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:25:21,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:25:21,142 INFO L85 PathProgramCache]: Analyzing trace with hash -391822078, now seen corresponding path program 1 times [2024-10-13 04:25:21,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:25:21,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050638419] [2024-10-13 04:25:21,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:25:21,143 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:25:21,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:25:21,146 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:25:21,147 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:25:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:25:21,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 04:25:21,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:25:23,831 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-13 04:25:23,831 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:25:35,137 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-13 04:25:35,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:25:35,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050638419] [2024-10-13 04:25:35,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050638419] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 04:25:35,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 04:25:35,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-10-13 04:25:35,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66194064] [2024-10-13 04:25:35,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 04:25:35,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 04:25:35,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:25:35,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 04:25:35,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-13 04:25:35,141 INFO L87 Difference]: Start difference. First operand 66 states and 90 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 4 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2024-10-13 04:25:49,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:25:49,748 INFO L93 Difference]: Finished difference Result 209 states and 279 transitions. [2024-10-13 04:25:49,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-13 04:25:49,751 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 4 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 69 [2024-10-13 04:25:49,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:25:49,754 INFO L225 Difference]: With dead ends: 209 [2024-10-13 04:25:49,754 INFO L226 Difference]: Without dead ends: 144 [2024-10-13 04:25:49,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=349, Invalid=841, Unknown=0, NotChecked=0, Total=1190 [2024-10-13 04:25:49,756 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 131 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-10-13 04:25:49,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 221 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2024-10-13 04:25:49,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-13 04:25:49,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 46. [2024-10-13 04:25:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 04:25:49,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2024-10-13 04:25:49,769 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 69 [2024-10-13 04:25:49,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:25:49,770 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2024-10-13 04:25:49,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 4 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2024-10-13 04:25:49,770 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2024-10-13 04:25:49,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 04:25:49,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:25:49,771 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:49,779 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:25:49,973 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:25:49,974 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:25:49,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:25:49,974 INFO L85 PathProgramCache]: Analyzing trace with hash 672060435, now seen corresponding path program 1 times [2024-10-13 04:25:49,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:25:49,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666920789] [2024-10-13 04:25:49,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:25:49,975 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:25:49,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:25:49,976 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:25:49,977 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:25:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:25:50,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 04:25:50,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:25:52,411 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-13 04:25:52,411 INFO L311 TraceCheckSpWp]: Computing backward predicates...