./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-55.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-55.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 4d6f9f8754fd5e74a79795681184ddd0bb5014968bab7230012cd8a3c9285d31 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:26:20,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:26:20,358 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:26:20,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:26:20,367 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:26:20,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:26:20,406 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:26:20,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:26:20,407 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:26:20,408 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:26:20,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:26:20,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:26:20,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:26:20,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:26:20,412 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:26:20,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:26:20,413 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:26:20,413 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:26:20,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:26:20,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:26:20,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:26:20,417 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:26:20,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:26:20,417 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:26:20,417 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:26:20,418 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:26:20,418 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:26:20,418 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:26:20,418 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:26:20,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:26:20,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:26:20,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:26:20,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:26:20,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:26:20,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:26:20,421 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:26:20,422 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:26:20,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:26:20,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:26:20,423 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:26:20,423 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:26:20,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:26:20,423 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 -> 4d6f9f8754fd5e74a79795681184ddd0bb5014968bab7230012cd8a3c9285d31 [2024-11-10 07:26:20,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:26:20,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:26:20,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:26:20,711 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:26:20,711 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:26:20,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-55.i [2024-11-10 07:26:22,140 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:26:22,329 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:26:22,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-55.i [2024-11-10 07:26:22,337 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a4faaad8/6aa72f0984fb4c3b81d60945749a9165/FLAGd82b7354c [2024-11-10 07:26:22,699 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a4faaad8/6aa72f0984fb4c3b81d60945749a9165 [2024-11-10 07:26:22,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:26:22,702 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:26:22,705 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:26:22,705 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:26:22,711 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:26:22,711 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:26:22" (1/1) ... [2024-11-10 07:26:22,712 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5518cd31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:22, skipping insertion in model container [2024-11-10 07:26:22,712 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:26:22" (1/1) ... [2024-11-10 07:26:22,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:26:22,948 WARN L250 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-1loop_file-55.i[915,928] [2024-11-10 07:26:23,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:26:23,020 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:26:23,029 WARN L250 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-1loop_file-55.i[915,928] [2024-11-10 07:26:23,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:26:23,065 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:26:23,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:23 WrapperNode [2024-11-10 07:26:23,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:26:23,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:26:23,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:26:23,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:26:23,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:23" (1/1) ... [2024-11-10 07:26:23,084 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:23" (1/1) ... [2024-11-10 07:26:23,126 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2024-11-10 07:26:23,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:26:23,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:26:23,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:26:23,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:26:23,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:23" (1/1) ... [2024-11-10 07:26:23,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:23" (1/1) ... [2024-11-10 07:26:23,143 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:23" (1/1) ... [2024-11-10 07:26:23,154 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-11-10 07:26:23,155 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:23" (1/1) ... [2024-11-10 07:26:23,155 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:23" (1/1) ... [2024-11-10 07:26:23,162 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:23" (1/1) ... [2024-11-10 07:26:23,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:23" (1/1) ... [2024-11-10 07:26:23,164 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:23" (1/1) ... [2024-11-10 07:26:23,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:23" (1/1) ... [2024-11-10 07:26:23,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:26:23,172 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:26:23,174 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:26:23,174 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:26:23,175 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:23" (1/1) ... [2024-11-10 07:26:23,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:26:23,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:26:23,213 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-11-10 07:26:23,220 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-11-10 07:26:23,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:26:23,265 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:26:23,265 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:26:23,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:26:23,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:26:23,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:26:23,344 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:26:23,347 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:26:23,663 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-10 07:26:23,663 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:26:23,682 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:26:23,684 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:26:23,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:26:23 BoogieIcfgContainer [2024-11-10 07:26:23,685 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:26:23,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:26:23,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:26:23,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:26:23,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:26:22" (1/3) ... [2024-11-10 07:26:23,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f504aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:26:23, skipping insertion in model container [2024-11-10 07:26:23,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:23" (2/3) ... [2024-11-10 07:26:23,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f504aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:26:23, skipping insertion in model container [2024-11-10 07:26:23,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:26:23" (3/3) ... [2024-11-10 07:26:23,696 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-55.i [2024-11-10 07:26:23,711 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:26:23,711 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:26:23,767 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:26:23,775 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;@43262b45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:26:23,775 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:26:23,780 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 07:26:23,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 07:26:23,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:26:23,796 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 07:26:23,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:26:23,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:26:23,802 INFO L85 PathProgramCache]: Analyzing trace with hash 789332696, now seen corresponding path program 1 times [2024-11-10 07:26:23,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:26:23,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902977877] [2024-11-10 07:26:23,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:26:23,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:26:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:26:24,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:26:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:26:24,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:26:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:26:24,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:26:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:26:24,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:26:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:26:24,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:26:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:26:24,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:26:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:26:24,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:26:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:26:24,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:26:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:26:24,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:26:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:26:24,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:26:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:26:24,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:26:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:26:24,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 07:26:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:26:24,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:26:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:26:24,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 07:26:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:26:24,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:26:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:26:24,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:26:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:26:24,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:26:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:26:24,189 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 07:26:24,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:26:24,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902977877] [2024-11-10 07:26:24,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902977877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:26:24,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:26:24,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:26:24,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865906260] [2024-11-10 07:26:24,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:26:24,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:26:24,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:26:24,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:26:24,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:26:24,227 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 07:26:24,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:26:24,260 INFO L93 Difference]: Finished difference Result 104 states and 169 transitions. [2024-11-10 07:26:24,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:26:24,264 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 108 [2024-11-10 07:26:24,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:26:24,271 INFO L225 Difference]: With dead ends: 104 [2024-11-10 07:26:24,272 INFO L226 Difference]: Without dead ends: 49 [2024-11-10 07:26:24,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-11-10 07:26:24,281 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:26:24,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:26:24,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-10 07:26:24,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-10 07:26:24,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 07:26:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2024-11-10 07:26:24,349 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 108 [2024-11-10 07:26:24,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:26:24,350 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2024-11-10 07:26:24,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 07:26:24,350 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2024-11-10 07:26:24,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 07:26:24,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:26:24,354 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 07:26:24,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:26:24,354 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:26:24,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:26:24,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1878322167, now seen corresponding path program 1 times [2024-11-10 07:26:24,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:26:24,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879848000] [2024-11-10 07:26:24,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:26:24,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:26:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:26:24,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1772737916] [2024-11-10 07:26:24,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:26:24,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:26:24,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:26:24,540 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-11-10 07:26:24,544 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-11-10 07:26:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:26:24,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:26:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:26:24,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:26:24,910 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:26:24,911 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:26:24,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 07:26:25,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:26:25,121 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 07:26:25,207 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:26:25,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:26:25 BoogieIcfgContainer [2024-11-10 07:26:25,213 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:26:25,214 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:26:25,214 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:26:25,214 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:26:25,215 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:26:23" (3/4) ... [2024-11-10 07:26:25,217 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:26:25,219 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:26:25,222 INFO L158 Benchmark]: Toolchain (without parser) took 2517.17ms. Allocated memory was 176.2MB in the beginning and 245.4MB in the end (delta: 69.2MB). Free memory was 118.9MB in the beginning and 184.7MB in the end (delta: -65.8MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-11-10 07:26:25,222 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:26:25,223 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.44ms. Allocated memory is still 176.2MB. Free memory was 118.5MB in the beginning and 104.2MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 07:26:25,223 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.71ms. Allocated memory is still 176.2MB. Free memory was 104.2MB in the beginning and 102.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 07:26:25,224 INFO L158 Benchmark]: Boogie Preprocessor took 43.62ms. Allocated memory is still 176.2MB. Free memory was 102.1MB in the beginning and 99.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 07:26:25,227 INFO L158 Benchmark]: IcfgBuilder took 513.27ms. Allocated memory is still 176.2MB. Free memory was 99.6MB in the beginning and 83.2MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 07:26:25,228 INFO L158 Benchmark]: TraceAbstraction took 1525.70ms. Allocated memory was 176.2MB in the beginning and 245.4MB in the end (delta: 69.2MB). Free memory was 82.4MB in the beginning and 184.7MB in the end (delta: -102.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:26:25,228 INFO L158 Benchmark]: Witness Printer took 5.11ms. Allocated memory is still 245.4MB. Free memory is still 184.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:26:25,230 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.18ms. Allocated memory is still 176.2MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.44ms. Allocated memory is still 176.2MB. Free memory was 118.5MB in the beginning and 104.2MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.71ms. Allocated memory is still 176.2MB. Free memory was 104.2MB in the beginning and 102.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.62ms. Allocated memory is still 176.2MB. Free memory was 102.1MB in the beginning and 99.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 513.27ms. Allocated memory is still 176.2MB. Free memory was 99.6MB in the beginning and 83.2MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1525.70ms. Allocated memory was 176.2MB in the beginning and 245.4MB in the end (delta: 69.2MB). Free memory was 82.4MB in the beginning and 184.7MB in the end (delta: -102.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.11ms. Allocated memory is still 245.4MB. Free memory is still 184.7MB. 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 98, overapproximation of someBinaryArithmeticFLOAToperation at line 39. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned short int var_1_6 = 16; [L26] signed char var_1_7 = 25; [L27] unsigned short int var_1_8 = 5; [L28] unsigned short int var_1_9 = 1; [L29] signed char var_1_12 = 1; [L30] float var_1_13 = 127.75; [L31] float var_1_14 = 0.0; [L32] float var_1_15 = 255.7; [L33] float var_1_16 = 7.6; [L34] unsigned long int var_1_17 = 64; [L35] signed long int var_1_18 = 0; VAL [isInitial=0, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L102] isInitial = 1 [L103] FCALL initially() [L104] int k_loop; [L105] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L105] COND TRUE k_loop < 1 [L106] FCALL updateLastVariables() [L107] CALL updateVariables() [L68] var_1_2 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L69] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L70] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L70] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L71] var_1_5 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L72] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L73] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L74] var_1_6 = __VERIFIER_nondet_ushort() [L75] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_7=25, var_1_8=5, var_1_9=1] [L75] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_7=25, var_1_8=5, var_1_9=1] [L76] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=5, var_1_9=1] [L76] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=5, var_1_9=1] [L77] var_1_8 = __VERIFIER_nondet_ushort() [L78] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_9=1] [L78] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_8 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_9=1] [L79] RET assume_abort_if_not(var_1_8 <= 65535) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_9=1] [L80] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531, var_1_9=1] [L80] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531, var_1_9=1] [L81] var_1_9 = __VERIFIER_nondet_ushort() [L82] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531] [L82] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531] [L83] CALL assume_abort_if_not(var_1_9 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531] [L83] RET assume_abort_if_not(var_1_9 <= 65535) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531] [L84] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531, var_1_9=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531, var_1_9=-65535] [L84] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531, var_1_9=-65535] [L85] var_1_12 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531, var_1_9=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531, var_1_9=-65535] [L86] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531, var_1_9=-65535] [L87] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531, var_1_9=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531, var_1_9=-65535] [L87] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531, var_1_9=-65535] [L88] var_1_14 = __VERIFIER_nondet_float() [L89] CALL assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531, var_1_9=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531, var_1_9=-65535] [L89] RET assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531, var_1_9=-65535] [L90] var_1_15 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531, var_1_9=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531, var_1_9=-65535] [L91] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531, var_1_9=-65535] [L92] var_1_16 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531, var_1_9=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531, var_1_9=-65535] [L93] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531, var_1_9=-65535] [L107] RET updateVariables() [L108] CALL step() [L39] var_1_13 = ((var_1_14 - var_1_15) - var_1_16) [L40] var_1_17 = var_1_6 [L41] var_1_18 = var_1_9 [L42] unsigned short int stepLocal_3 = var_1_9; [L43] unsigned long int stepLocal_2 = var_1_17; VAL [isInitial=1, stepLocal_2=4, stepLocal_3=-65535, var_1_12=-127, var_1_17=4, var_1_18=1, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=25, var_1_8=-65531, var_1_9=-65535] [L44] COND FALSE !(stepLocal_2 <= ((var_1_17 / var_1_8) / var_1_9)) [L51] var_1_7 = var_1_12 VAL [isInitial=1, stepLocal_3=-65535, var_1_12=-127, var_1_17=4, var_1_18=1, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=-127, var_1_8=-65531, var_1_9=-65535] [L53] signed char stepLocal_1 = var_1_7; [L54] unsigned char stepLocal_0 = var_1_7 >= var_1_7; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=-127, stepLocal_3=-65535, var_1_12=-127, var_1_17=4, var_1_18=1, var_1_1=10, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=-127, var_1_8=-65531, var_1_9=-65535] [L55] COND FALSE !(\read(var_1_2)) [L64] var_1_1 = var_1_6 VAL [isInitial=1, stepLocal_0=1, stepLocal_1=-127, stepLocal_3=-65535, var_1_12=-127, var_1_17=4, var_1_18=1, var_1_1=4, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=-127, var_1_8=-65531, var_1_9=-65535] [L108] RET step() [L109] CALL, EXPR property() [L98-L99] return ((((var_1_2 ? (((var_1_7 >= var_1_7) && var_1_5) ? ((var_1_7 >= var_1_7) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) var_1_6))) : 1) : (var_1_1 == ((unsigned short int) var_1_6))) && ((var_1_17 <= ((var_1_17 / var_1_8) / var_1_9)) ? ((var_1_9 == (var_1_18 * (~ var_1_18))) ? (var_1_7 == ((signed char) var_1_12)) : (var_1_7 == ((signed char) var_1_12))) : (var_1_7 == ((signed char) var_1_12)))) && (var_1_13 == ((float) ((var_1_14 - var_1_15) - var_1_16)))) && (var_1_17 == ((unsigned long int) var_1_6))) && (var_1_18 == ((signed long int) var_1_9)) ; VAL [\result=0, isInitial=1, var_1_12=-127, var_1_17=4, var_1_18=1, var_1_1=4, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=-127, var_1_8=-65531, var_1_9=-65535] [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=-127, var_1_17=4, var_1_18=1, var_1_1=4, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=-127, var_1_8=-65531, var_1_9=-65535] [L19] reach_error() VAL [isInitial=1, var_1_12=-127, var_1_17=4, var_1_18=1, var_1_1=4, var_1_2=0, var_1_5=-255, var_1_6=4, var_1_7=-127, var_1_8=-65531, var_1_9=-65535] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 2, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 74 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 324 NumberOfCodeBlocks, 324 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 544/544 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-11-10 07:26:25,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-55.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 4d6f9f8754fd5e74a79795681184ddd0bb5014968bab7230012cd8a3c9285d31 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:26:27,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:26:27,492 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:26:27,497 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:26:27,498 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:26:27,527 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:26:27,528 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:26:27,528 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:26:27,529 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:26:27,531 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:26:27,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:26:27,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:26:27,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:26:27,533 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:26:27,533 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:26:27,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:26:27,534 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:26:27,535 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:26:27,535 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:26:27,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:26:27,536 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:26:27,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:26:27,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:26:27,538 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:26:27,539 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:26:27,539 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:26:27,539 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:26:27,540 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:26:27,540 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:26:27,540 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:26:27,540 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:26:27,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:26:27,541 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:26:27,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:26:27,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:26:27,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:26:27,543 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:26:27,544 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:26:27,544 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:26:27,545 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:26:27,545 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:26:27,546 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:26:27,547 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:26:27,547 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:26:27,547 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 -> 4d6f9f8754fd5e74a79795681184ddd0bb5014968bab7230012cd8a3c9285d31 [2024-11-10 07:26:27,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:26:27,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:26:27,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:26:27,926 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:26:27,927 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:26:27,928 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-55.i [2024-11-10 07:26:29,393 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:26:29,613 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:26:29,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-55.i [2024-11-10 07:26:29,623 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca4a439e2/33673fd56e4b40dc98495e4e2f2681fe/FLAG463baa943 [2024-11-10 07:26:29,639 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca4a439e2/33673fd56e4b40dc98495e4e2f2681fe [2024-11-10 07:26:29,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:26:29,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:26:29,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:26:29,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:26:29,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:26:29,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:26:29" (1/1) ... [2024-11-10 07:26:29,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74a5e7f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:29, skipping insertion in model container [2024-11-10 07:26:29,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:26:29" (1/1) ... [2024-11-10 07:26:29,683 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:26:29,885 WARN L250 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-1loop_file-55.i[915,928] [2024-11-10 07:26:29,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:26:29,968 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:26:29,981 WARN L250 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-1loop_file-55.i[915,928] [2024-11-10 07:26:30,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:26:30,036 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:26:30,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:30 WrapperNode [2024-11-10 07:26:30,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:26:30,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:26:30,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:26:30,039 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:26:30,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:30" (1/1) ... [2024-11-10 07:26:30,058 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:30" (1/1) ... [2024-11-10 07:26:30,088 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-11-10 07:26:30,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:26:30,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:26:30,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:26:30,091 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:26:30,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:30" (1/1) ... [2024-11-10 07:26:30,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:30" (1/1) ... [2024-11-10 07:26:30,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:30" (1/1) ... [2024-11-10 07:26:30,131 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-11-10 07:26:30,135 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:30" (1/1) ... [2024-11-10 07:26:30,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:30" (1/1) ... [2024-11-10 07:26:30,147 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:30" (1/1) ... [2024-11-10 07:26:30,148 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:30" (1/1) ... [2024-11-10 07:26:30,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:30" (1/1) ... [2024-11-10 07:26:30,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:30" (1/1) ... [2024-11-10 07:26:30,160 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:26:30,162 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:26:30,163 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:26:30,163 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:26:30,164 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:30" (1/1) ... [2024-11-10 07:26:30,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:26:30,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:26:30,198 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-11-10 07:26:30,202 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-11-10 07:26:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:26:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:26:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:26:30,252 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:26:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:26:30,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:26:30,343 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:26:30,347 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:26:30,806 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-10 07:26:30,807 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:26:30,823 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:26:30,823 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:26:30,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:26:30 BoogieIcfgContainer [2024-11-10 07:26:30,828 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:26:30,830 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:26:30,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:26:30,832 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:26:30,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:26:29" (1/3) ... [2024-11-10 07:26:30,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23283ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:26:30, skipping insertion in model container [2024-11-10 07:26:30,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:30" (2/3) ... [2024-11-10 07:26:30,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23283ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:26:30, skipping insertion in model container [2024-11-10 07:26:30,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:26:30" (3/3) ... [2024-11-10 07:26:30,835 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-55.i [2024-11-10 07:26:30,851 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:26:30,852 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:26:30,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:26:30,926 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;@3be77285, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:26:30,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:26:30,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 07:26:30,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 07:26:30,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:26:30,947 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 07:26:30,948 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:26:30,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:26:30,955 INFO L85 PathProgramCache]: Analyzing trace with hash 789332696, now seen corresponding path program 1 times [2024-11-10 07:26:30,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:26:30,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688051437] [2024-11-10 07:26:30,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:26:30,970 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-11-10 07:26:30,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:26:30,974 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-11-10 07:26:30,975 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-11-10 07:26:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:26:31,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 07:26:31,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:26:31,352 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-10 07:26:31,353 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:26:31,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:26:31,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688051437] [2024-11-10 07:26:31,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688051437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:26:31,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:26:31,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:26:31,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136025535] [2024-11-10 07:26:31,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:26:31,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:26:31,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:26:31,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:26:31,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:26:31,390 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 07:26:31,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:26:31,425 INFO L93 Difference]: Finished difference Result 104 states and 169 transitions. [2024-11-10 07:26:31,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:26:31,427 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 108 [2024-11-10 07:26:31,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:26:31,434 INFO L225 Difference]: With dead ends: 104 [2024-11-10 07:26:31,435 INFO L226 Difference]: Without dead ends: 49 [2024-11-10 07:26:31,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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-11-10 07:26:31,444 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:26:31,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:26:31,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-10 07:26:31,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-10 07:26:31,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 07:26:31,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2024-11-10 07:26:31,493 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 108 [2024-11-10 07:26:31,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:26:31,495 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2024-11-10 07:26:31,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 07:26:31,495 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2024-11-10 07:26:31,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 07:26:31,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:26:31,498 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 07:26:31,512 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-11-10 07:26:31,699 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-11-10 07:26:31,699 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:26:31,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:26:31,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1878322167, now seen corresponding path program 1 times [2024-11-10 07:26:31,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:26:31,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1755516583] [2024-11-10 07:26:31,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:26:31,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:26:31,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:26:31,703 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-11-10 07:26:31,706 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-11-10 07:26:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:26:32,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 07:26:32,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:27:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-10 07:27:05,783 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:27:05,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:27:05,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1755516583] [2024-11-10 07:27:05,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1755516583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:27:05,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:27:05,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 07:27:05,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437617644] [2024-11-10 07:27:05,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:27:05,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 07:27:05,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:27:05,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 07:27:05,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-10 07:27:05,787 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 3 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-10 07:27:24,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:27:49,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:27:49,060 INFO L93 Difference]: Finished difference Result 104 states and 135 transitions. [2024-11-10 07:27:49,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 07:27:49,061 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 3 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 108 [2024-11-10 07:27:49,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:27:49,063 INFO L225 Difference]: With dead ends: 104 [2024-11-10 07:27:49,063 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 07:27:49,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 42.5s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2024-11-10 07:27:49,065 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 73 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:27:49,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 327 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 16.0s Time] [2024-11-10 07:27:49,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 07:27:49,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 90. [2024-11-10 07:27:49,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 54 states have internal predecessors, (59), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-10 07:27:49,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 121 transitions. [2024-11-10 07:27:49,099 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 121 transitions. Word has length 108 [2024-11-10 07:27:49,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:27:49,100 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 121 transitions. [2024-11-10 07:27:49,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 3 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-10 07:27:49,100 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 121 transitions. [2024-11-10 07:27:49,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-10 07:27:49,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:27:49,102 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 07:27:49,118 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 (3)] Ended with exit code 0 [2024-11-10 07:27:49,302 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-11-10 07:27:49,303 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:27:49,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:27:49,303 INFO L85 PathProgramCache]: Analyzing trace with hash -897627059, now seen corresponding path program 1 times [2024-11-10 07:27:49,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:27:49,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [237228178] [2024-11-10 07:27:49,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:27:49,304 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-11-10 07:27:49,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:27:49,308 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-11-10 07:27:49,309 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-11-10 07:27:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:27:49,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 07:27:49,582 INFO L278 TraceCheckSpWp]: Computing forward predicates...