./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-79.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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-79.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 087e6cd2d99060c16318d94e67eed026c21e542402823046e52131085ccd5550 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:45:59,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:45:59,503 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:45:59,509 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:45:59,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:45:59,529 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:45:59,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:45:59,530 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:45:59,530 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:45:59,531 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:45:59,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:45:59,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:45:59,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:45:59,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:45:59,534 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:45:59,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:45:59,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:45:59,535 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:45:59,535 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:45:59,535 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:45:59,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:45:59,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:45:59,539 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:45:59,539 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:45:59,539 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:45:59,539 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:45:59,539 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:45:59,539 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:45:59,539 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:45:59,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:45:59,540 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:45:59,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:45:59,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:45:59,540 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:45:59,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:45:59,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:45:59,540 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:45:59,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:45:59,541 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:45:59,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:45:59,541 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:45:59,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:45:59,542 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 -> 087e6cd2d99060c16318d94e67eed026c21e542402823046e52131085ccd5550 [2024-11-08 23:45:59,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:45:59,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:45:59,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:45:59,767 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:45:59,767 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:45:59,768 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-79.i [2024-11-08 23:46:00,975 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:46:01,132 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:46:01,132 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-79.i [2024-11-08 23:46:01,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a10d64a3/e28f282b9c6a4008bff1db641be1b924/FLAG4a89bab4d [2024-11-08 23:46:01,154 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a10d64a3/e28f282b9c6a4008bff1db641be1b924 [2024-11-08 23:46:01,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:46:01,157 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:46:01,158 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:46:01,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:46:01,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:46:01,163 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:46:01" (1/1) ... [2024-11-08 23:46:01,164 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fa0c3d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:01, skipping insertion in model container [2024-11-08 23:46:01,164 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:46:01" (1/1) ... [2024-11-08 23:46:01,187 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:46:01,330 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-79.i[915,928] [2024-11-08 23:46:01,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:46:01,367 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:46:01,378 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-79.i[915,928] [2024-11-08 23:46:01,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:46:01,436 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:46:01,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:01 WrapperNode [2024-11-08 23:46:01,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:46:01,439 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:46:01,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:46:01,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:46:01,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:01" (1/1) ... [2024-11-08 23:46:01,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:01" (1/1) ... [2024-11-08 23:46:01,523 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2024-11-08 23:46:01,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:46:01,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:46:01,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:46:01,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:46:01,538 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:01" (1/1) ... [2024-11-08 23:46:01,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:01" (1/1) ... [2024-11-08 23:46:01,540 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:01" (1/1) ... [2024-11-08 23:46:01,549 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-08 23:46:01,550 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:01" (1/1) ... [2024-11-08 23:46:01,550 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:01" (1/1) ... [2024-11-08 23:46:01,554 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:01" (1/1) ... [2024-11-08 23:46:01,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:01" (1/1) ... [2024-11-08 23:46:01,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:01" (1/1) ... [2024-11-08 23:46:01,567 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:01" (1/1) ... [2024-11-08 23:46:01,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:46:01,572 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:46:01,572 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:46:01,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:46:01,573 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:01" (1/1) ... [2024-11-08 23:46:01,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:46:01,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:46:01,615 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-08 23:46:01,620 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-08 23:46:01,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:46:01,655 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:46:01,655 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:46:01,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:46:01,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:46:01,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:46:01,721 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:46:01,724 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:46:01,903 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-08 23:46:01,903 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:46:01,918 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:46:01,918 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:46:01,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:46:01 BoogieIcfgContainer [2024-11-08 23:46:01,919 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:46:01,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:46:01,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:46:01,924 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:46:01,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:46:01" (1/3) ... [2024-11-08 23:46:01,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f776f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:46:01, skipping insertion in model container [2024-11-08 23:46:01,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:01" (2/3) ... [2024-11-08 23:46:01,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f776f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:46:01, skipping insertion in model container [2024-11-08 23:46:01,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:46:01" (3/3) ... [2024-11-08 23:46:01,927 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-79.i [2024-11-08 23:46:01,942 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:46:01,943 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:46:02,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:46:02,013 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;@4005bbf6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:46:02,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:46:02,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-08 23:46:02,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 23:46:02,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:46:02,024 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:46:02,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:46:02,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:46:02,028 INFO L85 PathProgramCache]: Analyzing trace with hash 948192100, now seen corresponding path program 1 times [2024-11-08 23:46:02,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:46:02,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722535609] [2024-11-08 23:46:02,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:46:02,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:46:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:46:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:46:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:46:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:46:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:46:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:46:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:46:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:46:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:46:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:46:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:46:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:46:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 23:46:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 23:46:02,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:46:02,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722535609] [2024-11-08 23:46:02,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722535609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:46:02,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:46:02,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:46:02,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878137814] [2024-11-08 23:46:02,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:46:02,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:46:02,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:46:02,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:46:02,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:46:02,316 INFO L87 Difference]: Start difference. First operand has 48 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 23:46:02,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:46:02,338 INFO L93 Difference]: Finished difference Result 93 states and 148 transitions. [2024-11-08 23:46:02,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:46:02,340 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86 [2024-11-08 23:46:02,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:46:02,345 INFO L225 Difference]: With dead ends: 93 [2024-11-08 23:46:02,346 INFO L226 Difference]: Without dead ends: 44 [2024-11-08 23:46:02,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 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-08 23:46:02,353 INFO L432 NwaCegarLoop]: 66 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, 66 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-08 23:46:02,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:46:02,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-08 23:46:02,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-08 23:46:02,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-08 23:46:02,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2024-11-08 23:46:02,391 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 86 [2024-11-08 23:46:02,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:46:02,393 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2024-11-08 23:46:02,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 23:46:02,394 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2024-11-08 23:46:02,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 23:46:02,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:46:02,397 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:46:02,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:46:02,398 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:46:02,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:46:02,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1317883886, now seen corresponding path program 1 times [2024-11-08 23:46:02,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:46:02,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353188203] [2024-11-08 23:46:02,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:46:02,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:46:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:46:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:46:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:46:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:46:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:46:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:46:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:46:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:46:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:46:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:46:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:46:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:46:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 23:46:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,654 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 23:46:02,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:46:02,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353188203] [2024-11-08 23:46:02,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353188203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:46:02,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:46:02,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:46:02,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680081356] [2024-11-08 23:46:02,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:46:02,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:46:02,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:46:02,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:46:02,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:46:02,660 INFO L87 Difference]: Start difference. First operand 44 states and 62 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 23:46:02,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:46:02,698 INFO L93 Difference]: Finished difference Result 97 states and 136 transitions. [2024-11-08 23:46:02,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:46:02,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 86 [2024-11-08 23:46:02,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:46:02,701 INFO L225 Difference]: With dead ends: 97 [2024-11-08 23:46:02,703 INFO L226 Difference]: Without dead ends: 56 [2024-11-08 23:46:02,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:46:02,704 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 16 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:46:02,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 108 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:46:02,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-08 23:46:02,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2024-11-08 23:46:02,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-08 23:46:02,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2024-11-08 23:46:02,715 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 86 [2024-11-08 23:46:02,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:46:02,716 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2024-11-08 23:46:02,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 23:46:02,716 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2024-11-08 23:46:02,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 23:46:02,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:46:02,720 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:46:02,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:46:02,720 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:46:02,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:46:02,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1964134501, now seen corresponding path program 1 times [2024-11-08 23:46:02,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:46:02,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920343269] [2024-11-08 23:46:02,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:46:02,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:46:02,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:46:02,798 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:46:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:46:02,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:46:02,865 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:46:02,867 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:46:02,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:46:02,870 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 23:46:02,927 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:46:02,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:46:02 BoogieIcfgContainer [2024-11-08 23:46:02,930 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:46:02,931 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:46:02,931 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:46:02,931 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:46:02,931 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:46:01" (3/4) ... [2024-11-08 23:46:02,933 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:46:02,934 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:46:02,936 INFO L158 Benchmark]: Toolchain (without parser) took 1778.12ms. Allocated memory is still 180.4MB. Free memory was 112.5MB in the beginning and 57.1MB in the end (delta: 55.3MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB. [2024-11-08 23:46:02,939 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 71.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:46:02,939 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.40ms. Allocated memory is still 180.4MB. Free memory was 112.3MB in the beginning and 152.2MB in the end (delta: -39.9MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2024-11-08 23:46:02,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.21ms. Allocated memory is still 180.4MB. Free memory was 152.2MB in the beginning and 150.1MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:46:02,940 INFO L158 Benchmark]: Boogie Preprocessor took 46.87ms. Allocated memory is still 180.4MB. Free memory was 150.1MB in the beginning and 148.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:46:02,941 INFO L158 Benchmark]: RCFGBuilder took 346.87ms. Allocated memory is still 180.4MB. Free memory was 148.1MB in the beginning and 132.6MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:46:02,941 INFO L158 Benchmark]: TraceAbstraction took 1009.54ms. Allocated memory is still 180.4MB. Free memory was 132.0MB in the beginning and 57.9MB in the end (delta: 74.1MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2024-11-08 23:46:02,941 INFO L158 Benchmark]: Witness Printer took 4.44ms. Allocated memory is still 180.4MB. Free memory was 57.9MB in the beginning and 57.1MB in the end (delta: 722.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:46:02,945 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.14ms. Allocated memory is still 109.1MB. Free memory is still 71.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.40ms. Allocated memory is still 180.4MB. Free memory was 112.3MB in the beginning and 152.2MB in the end (delta: -39.9MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.21ms. Allocated memory is still 180.4MB. Free memory was 152.2MB in the beginning and 150.1MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.87ms. Allocated memory is still 180.4MB. Free memory was 150.1MB in the beginning and 148.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 346.87ms. Allocated memory is still 180.4MB. Free memory was 148.1MB in the beginning and 132.6MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1009.54ms. Allocated memory is still 180.4MB. Free memory was 132.0MB in the beginning and 57.9MB in the end (delta: 74.1MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Witness Printer took 4.44ms. Allocated memory is still 180.4MB. Free memory was 57.9MB in the beginning and 57.1MB in the end (delta: 722.3kB). 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 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L23] unsigned char var_1_2 = 1; [L24] signed char var_1_3 = 0; [L25] signed char var_1_4 = 64; [L26] signed char var_1_5 = 64; [L27] unsigned short int var_1_6 = 25; [L28] float var_1_7 = 256.4; [L29] double var_1_10 = 9999999999.515; [L30] float var_1_11 = 8.5; [L31] float var_1_12 = 2.5; [L32] double var_1_13 = 15.8; [L33] double var_1_14 = 25.8; VAL [isInitial=0, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L94] isInitial = 1 [L95] FCALL initially() [L96] int k_loop; [L97] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L97] COND TRUE k_loop < 1 [L98] FCALL updateLastVariables() [L99] CALL updateVariables() [L64] var_1_2 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L65] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L66] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L66] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L67] var_1_3 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L68] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L69] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L69] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L70] var_1_4 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_4 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L71] RET assume_abort_if_not(var_1_4 >= -1) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L72] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L72] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L73] var_1_5 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25, var_1_7=1282/5] [L74] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25, var_1_7=1282/5] [L75] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25, var_1_7=1282/5] [L75] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25, var_1_7=1282/5] [L76] var_1_7 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L77] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L78] var_1_11 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L79] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L80] var_1_12 = __VERIFIER_nondet_float() [L81] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L81] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L82] var_1_13 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L83] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L84] var_1_14 = __VERIFIER_nondet_double() [L85] CALL assume_abort_if_not((var_1_14 >= 0.0F && 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_10=1999999999903/200, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L85] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L99] RET updateVariables() [L100] CALL step() [L37] COND FALSE !(! var_1_2) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L44] COND FALSE !(var_1_7 < (var_1_11 - var_1_12)) [L51] var_1_10 = var_1_14 VAL [isInitial=1, var_1_10=10000000004, var_1_14=10000000004, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L53] COND TRUE \read(var_1_2) VAL [isInitial=1, var_1_10=10000000004, var_1_14=10000000004, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=25] [L54] COND TRUE (var_1_7 - ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) <= var_1_10 [L55] var_1_6 = ((((256) < 0 ) ? -(256) : (256))) VAL [isInitial=1, var_1_10=10000000004, var_1_14=10000000004, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=256] [L100] RET step() [L101] CALL, EXPR property() [L90-L91] return (((! var_1_2) ? ((! var_1_2) ? (var_1_1 == ((signed char) (var_1_3 + -32))) : (var_1_1 == ((signed char) (var_1_4 - var_1_5)))) : 1) && (var_1_2 ? (((var_1_7 - ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) <= var_1_10) ? (var_1_6 == ((unsigned short int) ((((256) < 0 ) ? -(256) : (256))))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) 16)))) && ((var_1_7 < (var_1_11 - var_1_12)) ? (((var_1_7 / 7.2) <= var_1_11) ? (var_1_10 == ((double) (var_1_13 - var_1_14))) : (var_1_10 == ((double) var_1_13))) : (var_1_10 == ((double) var_1_14))) ; VAL [\result=0, isInitial=1, var_1_10=10000000004, var_1_14=10000000004, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=256] [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=10000000004, var_1_14=10000000004, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=256] [L19] reach_error() VAL [isInitial=1, var_1_10=10000000004, var_1_14=10000000004, var_1_1=-16, var_1_2=1, var_1_3=-63, var_1_4=126, var_1_5=126, var_1_6=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 174 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 126 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 624/624 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-08 23:46:02,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-79.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 087e6cd2d99060c16318d94e67eed026c21e542402823046e52131085ccd5550 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:46:04,726 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:46:04,794 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:46:04,801 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:46:04,801 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:46:04,825 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:46:04,827 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:46:04,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:46:04,828 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:46:04,829 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:46:04,829 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:46:04,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:46:04,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:46:04,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:46:04,830 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:46:04,830 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:46:04,831 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:46:04,831 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:46:04,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:46:04,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:46:04,832 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:46:04,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:46:04,832 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:46:04,832 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:46:04,833 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:46:04,833 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:46:04,833 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:46:04,833 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:46:04,833 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:46:04,834 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:46:04,834 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:46:04,834 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:46:04,834 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:46:04,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:46:04,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:46:04,835 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:46:04,835 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:46:04,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:46:04,836 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:46:04,836 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:46:04,836 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:46:04,839 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:46:04,839 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:46:04,839 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:46:04,839 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 -> 087e6cd2d99060c16318d94e67eed026c21e542402823046e52131085ccd5550 [2024-11-08 23:46:05,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:46:05,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:46:05,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:46:05,113 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:46:05,113 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:46:05,114 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-79.i [2024-11-08 23:46:06,402 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:46:06,585 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:46:06,586 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-79.i [2024-11-08 23:46:06,592 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de135a03a/a0ff28d55b63493fb74baadf7887a92a/FLAG1e808c34a [2024-11-08 23:46:06,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de135a03a/a0ff28d55b63493fb74baadf7887a92a [2024-11-08 23:46:06,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:46:06,607 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:46:06,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:46:06,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:46:06,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:46:06,612 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:46:06" (1/1) ... [2024-11-08 23:46:06,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65096dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:06, skipping insertion in model container [2024-11-08 23:46:06,613 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:46:06" (1/1) ... [2024-11-08 23:46:06,631 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:46:06,791 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-79.i[915,928] [2024-11-08 23:46:06,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:46:06,854 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:46:06,866 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-79.i[915,928] [2024-11-08 23:46:06,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:46:06,907 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:46:06,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:06 WrapperNode [2024-11-08 23:46:06,908 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:46:06,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:46:06,909 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:46:06,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:46:06,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:06" (1/1) ... [2024-11-08 23:46:06,928 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:06" (1/1) ... [2024-11-08 23:46:06,954 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2024-11-08 23:46:06,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:46:06,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:46:06,957 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:46:06,957 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:46:06,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:06" (1/1) ... [2024-11-08 23:46:06,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:06" (1/1) ... [2024-11-08 23:46:06,969 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:06" (1/1) ... [2024-11-08 23:46:06,985 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-08 23:46:06,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:06" (1/1) ... [2024-11-08 23:46:06,986 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:06" (1/1) ... [2024-11-08 23:46:06,995 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:06" (1/1) ... [2024-11-08 23:46:06,998 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:06" (1/1) ... [2024-11-08 23:46:07,001 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:06" (1/1) ... [2024-11-08 23:46:07,001 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:06" (1/1) ... [2024-11-08 23:46:07,008 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:46:07,009 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:46:07,010 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:46:07,010 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:46:07,010 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:06" (1/1) ... [2024-11-08 23:46:07,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:46:07,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:46:07,038 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-08 23:46:07,041 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-08 23:46:07,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:46:07,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:46:07,077 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:46:07,077 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:46:07,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:46:07,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:46:07,156 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:46:07,159 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:46:20,638 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-08 23:46:20,640 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:46:20,652 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:46:20,652 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:46:20,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:46:20 BoogieIcfgContainer [2024-11-08 23:46:20,652 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:46:20,654 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:46:20,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:46:20,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:46:20,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:46:06" (1/3) ... [2024-11-08 23:46:20,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7351afc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:46:20, skipping insertion in model container [2024-11-08 23:46:20,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:06" (2/3) ... [2024-11-08 23:46:20,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7351afc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:46:20, skipping insertion in model container [2024-11-08 23:46:20,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:46:20" (3/3) ... [2024-11-08 23:46:20,659 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-79.i [2024-11-08 23:46:20,671 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:46:20,672 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:46:20,712 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:46:20,718 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;@2b70d9c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:46:20,719 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:46:20,723 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-08 23:46:20,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 23:46:20,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:46:20,731 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:46:20,732 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:46:20,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:46:20,737 INFO L85 PathProgramCache]: Analyzing trace with hash 948192100, now seen corresponding path program 1 times [2024-11-08 23:46:20,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:46:20,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878109547] [2024-11-08 23:46:20,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:46:20,750 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-08 23:46:20,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:46:20,753 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-08 23:46:20,754 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-08 23:46:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:21,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:46:21,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:46:21,617 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-11-08 23:46:21,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:46:21,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:46:21,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878109547] [2024-11-08 23:46:21,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878109547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:46:21,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:46:21,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:46:21,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715983497] [2024-11-08 23:46:21,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:46:21,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:46:21,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:46:21,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:46:21,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:46:21,644 INFO L87 Difference]: Start difference. First operand has 48 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 23:46:21,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:46:21,660 INFO L93 Difference]: Finished difference Result 93 states and 148 transitions. [2024-11-08 23:46:21,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:46:21,663 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86 [2024-11-08 23:46:21,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:46:21,667 INFO L225 Difference]: With dead ends: 93 [2024-11-08 23:46:21,668 INFO L226 Difference]: Without dead ends: 44 [2024-11-08 23:46:21,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 85 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-08 23:46:21,672 INFO L432 NwaCegarLoop]: 66 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, 66 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-08 23:46:21,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:46:21,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-08 23:46:21,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-08 23:46:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-08 23:46:21,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2024-11-08 23:46:21,707 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 86 [2024-11-08 23:46:21,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:46:21,708 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2024-11-08 23:46:21,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 23:46:21,708 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2024-11-08 23:46:21,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 23:46:21,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:46:21,713 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:46:21,738 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-08 23:46:21,913 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-08 23:46:21,914 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:46:21,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:46:21,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1317883886, now seen corresponding path program 1 times [2024-11-08 23:46:21,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:46:21,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079025834] [2024-11-08 23:46:21,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:46:21,916 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-08 23:46:21,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:46:21,918 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-08 23:46:21,919 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-08 23:46:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:22,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 23:46:22,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:46:22,934 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 23:46:22,935 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:46:22,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:46:22,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079025834] [2024-11-08 23:46:22,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079025834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:46:22,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:46:22,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:46:22,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975712946] [2024-11-08 23:46:22,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:46:22,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:46:22,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:46:22,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:46:22,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:46:22,938 INFO L87 Difference]: Start difference. First operand 44 states and 62 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 23:46:27,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:46:31,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:46:31,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:46:31,428 INFO L93 Difference]: Finished difference Result 97 states and 136 transitions. [2024-11-08 23:46:31,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:46:31,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 86 [2024-11-08 23:46:31,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:46:31,551 INFO L225 Difference]: With dead ends: 97 [2024-11-08 23:46:31,551 INFO L226 Difference]: Without dead ends: 56 [2024-11-08 23:46:31,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:46:31,552 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 16 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-08 23:46:31,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 108 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2024-11-08 23:46:31,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-08 23:46:31,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2024-11-08 23:46:31,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-08 23:46:31,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2024-11-08 23:46:31,559 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 86 [2024-11-08 23:46:31,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:46:31,560 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2024-11-08 23:46:31,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 23:46:31,560 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2024-11-08 23:46:31,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 23:46:31,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:46:31,562 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:46:31,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 23:46:31,762 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-08 23:46:31,763 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:46:31,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:46:31,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1964134501, now seen corresponding path program 1 times [2024-11-08 23:46:31,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:46:31,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497019463] [2024-11-08 23:46:31,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:46:31,764 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-08 23:46:31,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:46:31,766 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-08 23:46:31,767 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-08 23:46:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:32,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 23:46:32,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:47:09,325 WARN L286 SmtUtils]: Spent 9.36s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 23:47:30,962 WARN L286 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 23:47:39,401 WARN L286 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)