./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1300.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1300.c -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 70dcbfd71e657ebb73c2a6863351c66fa81e26e34ca397217ae05e2d3c176a8d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 17:22:39,597 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 17:22:39,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 17:22:39,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 17:22:39,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 17:22:39,671 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 17:22:39,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 17:22:39,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 17:22:39,672 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 17:22:39,672 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 17:22:39,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 17:22:39,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 17:22:39,673 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 17:22:39,673 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 17:22:39,673 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 17:22:39,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 17:22:39,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 17:22:39,674 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 17:22:39,676 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 17:22:39,676 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 17:22:39,676 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 17:22:39,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 17:22:39,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 17:22:39,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 17:22:39,680 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 17:22:39,680 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 17:22:39,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 17:22:39,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 17:22:39,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 17:22:39,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 17:22:39,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 17:22:39,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 17:22:39,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 17:22:39,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 17:22:39,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 17:22:39,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 17:22:39,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 17:22:39,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 17:22:39,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 17:22:39,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 17:22:39,682 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 17:22:39,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 17:22:39,683 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 -> 70dcbfd71e657ebb73c2a6863351c66fa81e26e34ca397217ae05e2d3c176a8d [2024-10-12 17:22:39,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 17:22:39,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 17:22:39,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 17:22:39,884 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 17:22:39,884 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 17:22:39,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1300.c [2024-10-12 17:22:41,089 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 17:22:41,228 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 17:22:41,229 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1300.c [2024-10-12 17:22:41,234 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2458a883/691947d6ffcf495999763da562671563/FLAGcf91018d0 [2024-10-12 17:22:41,644 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2458a883/691947d6ffcf495999763da562671563 [2024-10-12 17:22:41,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 17:22:41,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 17:22:41,650 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 17:22:41,650 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 17:22:41,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 17:22:41,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 05:22:41" (1/1) ... [2024-10-12 17:22:41,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6de180ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:41, skipping insertion in model container [2024-10-12 17:22:41,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 05:22:41" (1/1) ... [2024-10-12 17:22:41,673 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 17:22:41,851 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1300.c[1563,1576] [2024-10-12 17:22:41,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 17:22:41,860 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 17:22:41,874 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1300.c[1563,1576] [2024-10-12 17:22:41,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 17:22:41,885 INFO L204 MainTranslator]: Completed translation [2024-10-12 17:22:41,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:41 WrapperNode [2024-10-12 17:22:41,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 17:22:41,887 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 17:22:41,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 17:22:41,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 17:22:41,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:41" (1/1) ... [2024-10-12 17:22:41,897 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:41" (1/1) ... [2024-10-12 17:22:41,911 INFO L138 Inliner]: procedures = 18, calls = 19, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 104 [2024-10-12 17:22:41,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 17:22:41,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 17:22:41,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 17:22:41,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 17:22:41,921 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:41" (1/1) ... [2024-10-12 17:22:41,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:41" (1/1) ... [2024-10-12 17:22:41,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:41" (1/1) ... [2024-10-12 17:22:41,943 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-10-12 17:22:41,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:41" (1/1) ... [2024-10-12 17:22:41,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:41" (1/1) ... [2024-10-12 17:22:41,953 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:41" (1/1) ... [2024-10-12 17:22:41,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:41" (1/1) ... [2024-10-12 17:22:41,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:41" (1/1) ... [2024-10-12 17:22:41,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:41" (1/1) ... [2024-10-12 17:22:41,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 17:22:41,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 17:22:41,967 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 17:22:41,967 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 17:22:41,967 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:41" (1/1) ... [2024-10-12 17:22:41,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 17:22:41,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 17:22:41,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 17:22:42,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 17:22:42,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 17:22:42,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 17:22:42,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 17:22:42,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 17:22:42,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 17:22:42,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-12 17:22:42,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-12 17:22:42,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-12 17:22:42,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 17:22:42,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 17:22:42,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 17:22:42,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 17:22:42,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 17:22:42,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 17:22:42,107 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 17:22:42,109 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 17:22:42,291 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-12 17:22:42,291 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 17:22:42,329 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 17:22:42,329 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-12 17:22:42,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:22:42 BoogieIcfgContainer [2024-10-12 17:22:42,329 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 17:22:42,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 17:22:42,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 17:22:42,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 17:22:42,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 05:22:41" (1/3) ... [2024-10-12 17:22:42,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c6aa70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 05:22:42, skipping insertion in model container [2024-10-12 17:22:42,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:41" (2/3) ... [2024-10-12 17:22:42,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c6aa70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 05:22:42, skipping insertion in model container [2024-10-12 17:22:42,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:22:42" (3/3) ... [2024-10-12 17:22:42,338 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1300.c [2024-10-12 17:22:42,350 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 17:22:42,351 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 17:22:42,402 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 17:22:42,407 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;@5e47480a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 17:22:42,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 17:22:42,411 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 17:22:42,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-12 17:22:42,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:22:42,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:22:42,417 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:22:42,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:22:42,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1372143852, now seen corresponding path program 1 times [2024-10-12 17:22:42,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 17:22:42,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698863395] [2024-10-12 17:22:42,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:22:42,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 17:22:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:22:42,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:22:42,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 17:22:42,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698863395] [2024-10-12 17:22:42,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698863395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:22:42,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:22:42,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 17:22:42,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115495716] [2024-10-12 17:22:42,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:22:42,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 17:22:42,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 17:22:42,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 17:22:42,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 17:22:42,572 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 17:22:42,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:22:42,602 INFO L93 Difference]: Finished difference Result 51 states and 75 transitions. [2024-10-12 17:22:42,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 17:22:42,605 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-12 17:22:42,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:22:42,611 INFO L225 Difference]: With dead ends: 51 [2024-10-12 17:22:42,611 INFO L226 Difference]: Without dead ends: 23 [2024-10-12 17:22:42,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 17:22:42,616 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:22:42,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:22:42,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-12 17:22:42,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-12 17:22:42,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 17:22:42,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2024-10-12 17:22:42,642 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 14 [2024-10-12 17:22:42,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:22:42,643 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2024-10-12 17:22:42,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 17:22:42,643 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2024-10-12 17:22:42,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-12 17:22:42,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:22:42,644 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:22:42,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 17:22:42,644 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:22:42,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:22:42,645 INFO L85 PathProgramCache]: Analyzing trace with hash 934646358, now seen corresponding path program 1 times [2024-10-12 17:22:42,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 17:22:42,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688118197] [2024-10-12 17:22:42,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:22:42,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 17:22:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:22:43,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:22:43,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 17:22:43,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688118197] [2024-10-12 17:22:43,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688118197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:22:43,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:22:43,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 17:22:43,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269830896] [2024-10-12 17:22:43,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:22:43,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 17:22:43,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 17:22:43,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 17:22:43,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 17:22:43,081 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 17:22:43,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:22:43,127 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-10-12 17:22:43,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 17:22:43,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-12 17:22:43,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:22:43,129 INFO L225 Difference]: With dead ends: 36 [2024-10-12 17:22:43,130 INFO L226 Difference]: Without dead ends: 27 [2024-10-12 17:22:43,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 17:22:43,131 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:22:43,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 52 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:22:43,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-12 17:22:43,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-10-12 17:22:43,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 17:22:43,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-10-12 17:22:43,138 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 16 [2024-10-12 17:22:43,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:22:43,138 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-10-12 17:22:43,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 17:22:43,139 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-10-12 17:22:43,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 17:22:43,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:22:43,139 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:22:43,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 17:22:43,140 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:22:43,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:22:43,144 INFO L85 PathProgramCache]: Analyzing trace with hash -40170455, now seen corresponding path program 1 times [2024-10-12 17:22:43,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 17:22:43,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848106758] [2024-10-12 17:22:43,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:22:43,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 17:22:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:22:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:22:43,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 17:22:43,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848106758] [2024-10-12 17:22:43,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848106758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:22:43,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:22:43,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 17:22:43,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568808072] [2024-10-12 17:22:43,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:22:43,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 17:22:43,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 17:22:43,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 17:22:43,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 17:22:43,374 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 17:22:43,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:22:43,416 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-10-12 17:22:43,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 17:22:43,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-12 17:22:43,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:22:43,417 INFO L225 Difference]: With dead ends: 36 [2024-10-12 17:22:43,417 INFO L226 Difference]: Without dead ends: 26 [2024-10-12 17:22:43,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 17:22:43,418 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:22:43,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 68 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:22:43,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-12 17:22:43,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2024-10-12 17:22:43,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 17:22:43,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-10-12 17:22:43,421 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 17 [2024-10-12 17:22:43,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:22:43,421 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-10-12 17:22:43,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 17:22:43,421 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-10-12 17:22:43,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-12 17:22:43,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:22:43,422 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:22:43,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 17:22:43,422 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:22:43,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:22:43,422 INFO L85 PathProgramCache]: Analyzing trace with hash 744787609, now seen corresponding path program 1 times [2024-10-12 17:22:43,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 17:22:43,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216334387] [2024-10-12 17:22:43,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:22:43,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 17:22:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 17:22:43,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 17:22:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 17:22:43,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 17:22:43,504 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 17:22:43,505 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 17:22:43,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 17:22:43,508 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-12 17:22:43,526 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 17:22:43,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 05:22:43 BoogieIcfgContainer [2024-10-12 17:22:43,532 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 17:22:43,532 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 17:22:43,532 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 17:22:43,532 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 17:22:43,533 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:22:42" (3/4) ... [2024-10-12 17:22:43,534 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 17:22:43,535 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 17:22:43,536 INFO L158 Benchmark]: Toolchain (without parser) took 1888.23ms. Allocated memory is still 146.8MB. Free memory was 78.4MB in the beginning and 102.6MB in the end (delta: -24.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 17:22:43,536 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 96.5MB. Free memory was 56.2MB in the beginning and 56.1MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 17:22:43,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.34ms. Allocated memory is still 146.8MB. Free memory was 78.2MB in the beginning and 110.0MB in the end (delta: -31.9MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. [2024-10-12 17:22:43,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.57ms. Allocated memory is still 146.8MB. Free memory was 110.0MB in the beginning and 108.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 17:22:43,536 INFO L158 Benchmark]: Boogie Preprocessor took 54.48ms. Allocated memory is still 146.8MB. Free memory was 108.0MB in the beginning and 105.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 17:22:43,537 INFO L158 Benchmark]: RCFGBuilder took 362.83ms. Allocated memory is still 146.8MB. Free memory was 105.5MB in the beginning and 87.7MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-12 17:22:43,537 INFO L158 Benchmark]: TraceAbstraction took 1199.79ms. Allocated memory is still 146.8MB. Free memory was 86.6MB in the beginning and 102.6MB in the end (delta: -16.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 17:22:43,537 INFO L158 Benchmark]: Witness Printer took 3.06ms. Allocated memory is still 146.8MB. Free memory is still 102.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 17:22:43,541 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 96.5MB. Free memory was 56.2MB in the beginning and 56.1MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.34ms. Allocated memory is still 146.8MB. Free memory was 78.2MB in the beginning and 110.0MB in the end (delta: -31.9MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.57ms. Allocated memory is still 146.8MB. Free memory was 110.0MB in the beginning and 108.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.48ms. Allocated memory is still 146.8MB. Free memory was 108.0MB in the beginning and 105.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 362.83ms. Allocated memory is still 146.8MB. Free memory was 105.5MB in the beginning and 87.7MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1199.79ms. Allocated memory is still 146.8MB. Free memory was 86.6MB in the beginning and 102.6MB in the end (delta: -16.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.06ms. Allocated memory is still 146.8MB. Free memory is still 102.6MB. 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: 61]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of bitwiseOr at line 29, overapproximation of to_real at line 57. Possible FailurePath: [L52] double x = __VERIFIER_nondet_double(); [L55] CALL, EXPR isinf_double(x) [L19] __int32_t hx, lx; VAL [x=2147483659] [L21] ieee_double_shape_type ew_u; [L22] ew_u.value = (x) [L23] EXPR ew_u.parts.msw [L23] (hx) = ew_u.parts.msw [L24] EXPR ew_u.parts.lsw [L24] (lx) = ew_u.parts.lsw [L26] hx &= 0x7fffffff VAL [hx=0, lx=0, x=2147483659] [L27] EXPR lx | (-lx) VAL [hx=0, x=2147483659] [L27] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L28] hx = 0x7ff00000 - hx VAL [hx=2146435072, x=2147483659] [L29] EXPR hx | (-hx) VAL [x=2147483659] [L29] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); [L55] RET, EXPR isinf_double(x) [L55] !isinf_double(x) && !isnan_double(x) [L55] CALL, EXPR isnan_double(x) [L33] return x != x; [L55] RET, EXPR isnan_double(x) [L55] !isinf_double(x) && !isnan_double(x) VAL [x=2147483659] [L55] COND TRUE !isinf_double(x) && !isnan_double(x) [L57] CALL, EXPR isfinite_double(x) [L36] __int32_t hx; VAL [x=2147483659] [L38] ieee_double_shape_type gh_u; [L39] gh_u.value = (x) [L40] EXPR gh_u.parts.msw [L40] (hx) = gh_u.parts.msw [L42] return (int)((__uint32_t)((hx & 0x7fffffff) - 0x7ff00000) >> 31); [L57] RET, EXPR isfinite_double(x) [L57] double res = isfinite_double(x); [L60] COND TRUE res == 0.0 [L61] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 148 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 73 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, InterpolantAutomatonStates: 10, 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, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 65 NumberOfCodeBlocks, 65 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 83 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-12 17:22:43,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1300.c -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 70dcbfd71e657ebb73c2a6863351c66fa81e26e34ca397217ae05e2d3c176a8d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 17:22:45,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 17:22:45,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-12 17:22:45,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 17:22:45,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 17:22:45,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 17:22:45,377 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 17:22:45,377 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 17:22:45,378 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 17:22:45,379 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 17:22:45,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 17:22:45,379 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 17:22:45,380 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 17:22:45,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 17:22:45,380 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 17:22:45,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 17:22:45,382 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 17:22:45,382 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 17:22:45,382 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 17:22:45,385 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 17:22:45,385 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 17:22:45,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 17:22:45,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 17:22:45,390 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 17:22:45,390 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 17:22:45,390 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 17:22:45,390 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 17:22:45,390 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 17:22:45,390 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 17:22:45,390 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 17:22:45,391 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 17:22:45,391 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 17:22:45,391 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 17:22:45,391 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 17:22:45,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 17:22:45,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 17:22:45,392 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 17:22:45,392 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 17:22:45,392 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 17:22:45,392 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 17:22:45,392 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 17:22:45,393 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 17:22:45,393 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 17:22:45,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 17:22:45,393 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 17:22:45,393 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 -> 70dcbfd71e657ebb73c2a6863351c66fa81e26e34ca397217ae05e2d3c176a8d [2024-10-12 17:22:45,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 17:22:45,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 17:22:45,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 17:22:45,666 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 17:22:45,666 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 17:22:45,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1300.c [2024-10-12 17:22:46,901 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 17:22:47,065 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 17:22:47,065 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1300.c [2024-10-12 17:22:47,071 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f01733d8/3185e6635de243dc859330aefd40ef2a/FLAG75ecae532 [2024-10-12 17:22:47,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f01733d8/3185e6635de243dc859330aefd40ef2a [2024-10-12 17:22:47,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 17:22:47,485 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 17:22:47,492 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 17:22:47,492 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 17:22:47,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 17:22:47,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 05:22:47" (1/1) ... [2024-10-12 17:22:47,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3244e906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:47, skipping insertion in model container [2024-10-12 17:22:47,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 05:22:47" (1/1) ... [2024-10-12 17:22:47,511 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 17:22:47,660 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1300.c[1563,1576] [2024-10-12 17:22:47,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 17:22:47,682 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 17:22:47,702 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1300.c[1563,1576] [2024-10-12 17:22:47,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 17:22:47,726 INFO L204 MainTranslator]: Completed translation [2024-10-12 17:22:47,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:47 WrapperNode [2024-10-12 17:22:47,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 17:22:47,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 17:22:47,728 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 17:22:47,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 17:22:47,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:47" (1/1) ... [2024-10-12 17:22:47,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:47" (1/1) ... [2024-10-12 17:22:47,762 INFO L138 Inliner]: procedures = 21, calls = 19, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 77 [2024-10-12 17:22:47,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 17:22:47,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 17:22:47,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 17:22:47,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 17:22:47,773 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:47" (1/1) ... [2024-10-12 17:22:47,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:47" (1/1) ... [2024-10-12 17:22:47,776 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:47" (1/1) ... [2024-10-12 17:22:47,786 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-10-12 17:22:47,786 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:47" (1/1) ... [2024-10-12 17:22:47,786 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:47" (1/1) ... [2024-10-12 17:22:47,795 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:47" (1/1) ... [2024-10-12 17:22:47,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:47" (1/1) ... [2024-10-12 17:22:47,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:47" (1/1) ... [2024-10-12 17:22:47,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:47" (1/1) ... [2024-10-12 17:22:47,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 17:22:47,812 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 17:22:47,812 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 17:22:47,812 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 17:22:47,812 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:47" (1/1) ... [2024-10-12 17:22:47,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 17:22:47,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 17:22:47,842 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 17:22:47,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 17:22:47,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 17:22:47,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-12 17:22:47,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-12 17:22:47,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-12 17:22:47,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 17:22:47,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-12 17:22:47,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-12 17:22:47,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 17:22:47,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-12 17:22:47,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-12 17:22:47,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-12 17:22:47,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 17:22:47,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 17:22:47,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 17:22:47,956 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 17:22:47,957 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 17:22:48,156 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-12 17:22:48,157 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 17:22:48,192 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 17:22:48,192 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-12 17:22:48,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:22:48 BoogieIcfgContainer [2024-10-12 17:22:48,193 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 17:22:48,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 17:22:48,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 17:22:48,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 17:22:48,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 05:22:47" (1/3) ... [2024-10-12 17:22:48,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@627bd4fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 05:22:48, skipping insertion in model container [2024-10-12 17:22:48,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:47" (2/3) ... [2024-10-12 17:22:48,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@627bd4fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 05:22:48, skipping insertion in model container [2024-10-12 17:22:48,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:22:48" (3/3) ... [2024-10-12 17:22:48,201 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1300.c [2024-10-12 17:22:48,214 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 17:22:48,214 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 17:22:48,260 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 17:22:48,266 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;@bead3ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 17:22:48,267 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 17:22:48,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 17:22:48,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-12 17:22:48,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:22:48,274 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:22:48,274 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:22:48,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:22:48,279 INFO L85 PathProgramCache]: Analyzing trace with hash 736884262, now seen corresponding path program 1 times [2024-10-12 17:22:48,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:22:48,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242831030] [2024-10-12 17:22:48,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:22:48,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 17:22:48,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:22:48,295 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 17:22:48,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-12 17:22:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:22:48,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-12 17:22:48,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:22:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:22:48,394 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:22:48,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:22:48,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242831030] [2024-10-12 17:22:48,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242831030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:22:48,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:22:48,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 17:22:48,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276358644] [2024-10-12 17:22:48,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:22:48,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 17:22:48,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:22:48,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 17:22:48,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 17:22:48,419 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 17:22:48,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:22:48,462 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. [2024-10-12 17:22:48,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 17:22:48,465 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-12 17:22:48,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:22:48,470 INFO L225 Difference]: With dead ends: 29 [2024-10-12 17:22:48,470 INFO L226 Difference]: Without dead ends: 12 [2024-10-12 17:22:48,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 17:22:48,474 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:22:48,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:22:48,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-12 17:22:48,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-12 17:22:48,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 17:22:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-10-12 17:22:48,493 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2024-10-12 17:22:48,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:22:48,493 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-10-12 17:22:48,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 17:22:48,494 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-10-12 17:22:48,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-12 17:22:48,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:22:48,494 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:22:48,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-12 17:22:48,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 17:22:48,695 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:22:48,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:22:48,696 INFO L85 PathProgramCache]: Analyzing trace with hash -995819208, now seen corresponding path program 1 times [2024-10-12 17:22:48,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:22:48,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531382787] [2024-10-12 17:22:48,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:22:48,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 17:22:48,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:22:48,698 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 17:22:48,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-12 17:22:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:22:48,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 17:22:48,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:22:48,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:22:48,772 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:22:48,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:22:48,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531382787] [2024-10-12 17:22:48,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531382787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:22:48,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:22:48,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 17:22:48,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066008798] [2024-10-12 17:22:48,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:22:48,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 17:22:48,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:22:48,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 17:22:48,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 17:22:48,775 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 17:22:48,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:22:48,811 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2024-10-12 17:22:48,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 17:22:48,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-12 17:22:48,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:22:48,814 INFO L225 Difference]: With dead ends: 19 [2024-10-12 17:22:48,814 INFO L226 Difference]: Without dead ends: 12 [2024-10-12 17:22:48,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-10-12 17:22:48,815 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:22:48,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:22:48,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-12 17:22:48,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-12 17:22:48,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 17:22:48,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 11 transitions. [2024-10-12 17:22:48,820 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 11 transitions. Word has length 11 [2024-10-12 17:22:48,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:22:48,821 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 11 transitions. [2024-10-12 17:22:48,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 17:22:48,821 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2024-10-12 17:22:48,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-12 17:22:48,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:22:48,822 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:22:48,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-12 17:22:49,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 17:22:49,026 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:22:49,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:22:49,026 INFO L85 PathProgramCache]: Analyzing trace with hash -885465126, now seen corresponding path program 1 times [2024-10-12 17:22:49,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:22:49,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821164273] [2024-10-12 17:22:49,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:22:49,027 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 17:22:49,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:22:49,030 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 17:22:49,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-12 17:22:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:22:49,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-12 17:22:49,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:22:51,624 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)))) (and (fp.eq .cse0 .cse0) (= (_ bv0 32) (bvadd (_ bv1 32) (bvneg (bvlshr (let ((.cse1 (bvadd (_ bv2146435072 32) (bvneg (bvor (bvlshr (let ((.cse2 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|))) (bvor (bvneg .cse2) .cse2)) (_ bv31 32)) (bvand ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) (_ bv2147483647 32))))))) (bvor .cse1 (bvneg .cse1))) (_ bv31 32))))) (= |c_ULTIMATE.start_isfinite_double_~hx~1#1| ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|)) (= .cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)))))) is different from true [2024-10-12 17:22:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:22:52,120 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:22:52,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:22:52,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821164273] [2024-10-12 17:22:52,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821164273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:22:52,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:22:52,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 17:22:52,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549721948] [2024-10-12 17:22:52,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:22:52,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 17:22:52,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:22:52,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 17:22:52,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=44, Unknown=1, NotChecked=12, Total=72 [2024-10-12 17:22:52,123 INFO L87 Difference]: Start difference. First operand 12 states and 11 transitions. Second operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 17:22:55,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:22:55,023 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2024-10-12 17:22:55,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 17:22:55,025 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-12 17:22:55,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:22:55,026 INFO L225 Difference]: With dead ends: 12 [2024-10-12 17:22:55,026 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 17:22:55,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=22, Invalid=70, Unknown=2, NotChecked=16, Total=110 [2024-10-12 17:22:55,027 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 17:22:55,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 11 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 7 Unchecked, 0.3s Time] [2024-10-12 17:22:55,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 17:22:55,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 17:22:55,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 17:22:55,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 17:22:55,028 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2024-10-12 17:22:55,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:22:55,028 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 17:22:55,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 17:22:55,028 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 17:22:55,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 17:22:55,031 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 17:22:55,036 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 (4)] Forceful destruction successful, exit code 0 [2024-10-12 17:22:55,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 17:22:55,235 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-12 17:22:55,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 17:22:55,255 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 17:22:55,261 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-12 17:22:55,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 05:22:55 BoogieIcfgContainer [2024-10-12 17:22:55,265 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 17:22:55,266 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 17:22:55,266 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 17:22:55,266 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 17:22:55,266 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:22:48" (3/4) ... [2024-10-12 17:22:55,268 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 17:22:55,274 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-10-12 17:22:55,275 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-12 17:22:55,275 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 17:22:55,275 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 17:22:55,406 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 17:22:55,406 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 17:22:55,407 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 17:22:55,407 INFO L158 Benchmark]: Toolchain (without parser) took 7922.11ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 45.7MB in the beginning and 67.9MB in the end (delta: -22.2MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2024-10-12 17:22:55,407 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 52.4MB. Free memory is still 35.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 17:22:55,408 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.63ms. Allocated memory is still 75.5MB. Free memory was 45.5MB in the beginning and 54.1MB in the end (delta: -8.6MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2024-10-12 17:22:55,408 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.53ms. Allocated memory is still 75.5MB. Free memory was 53.7MB in the beginning and 52.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 17:22:55,408 INFO L158 Benchmark]: Boogie Preprocessor took 46.37ms. Allocated memory is still 75.5MB. Free memory was 52.1MB in the beginning and 50.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 17:22:55,408 INFO L158 Benchmark]: RCFGBuilder took 381.45ms. Allocated memory is still 75.5MB. Free memory was 49.6MB in the beginning and 34.6MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-12 17:22:55,409 INFO L158 Benchmark]: TraceAbstraction took 7070.73ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 33.9MB in the beginning and 38.6MB in the end (delta: -4.7MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-10-12 17:22:55,409 INFO L158 Benchmark]: Witness Printer took 140.83ms. Allocated memory is still 92.3MB. Free memory was 38.6MB in the beginning and 67.9MB in the end (delta: -29.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 17:22:55,410 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 52.4MB. Free memory is still 35.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.63ms. Allocated memory is still 75.5MB. Free memory was 45.5MB in the beginning and 54.1MB in the end (delta: -8.6MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.53ms. Allocated memory is still 75.5MB. Free memory was 53.7MB in the beginning and 52.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.37ms. Allocated memory is still 75.5MB. Free memory was 52.1MB in the beginning and 50.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 381.45ms. Allocated memory is still 75.5MB. Free memory was 49.6MB in the beginning and 34.6MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7070.73ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 33.9MB in the beginning and 38.6MB in the end (delta: -4.7MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Witness Printer took 140.83ms. Allocated memory is still 92.3MB. Free memory was 38.6MB in the beginning and 67.9MB in the end (delta: -29.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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 - PositiveResult [Line: 61]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 7 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 21 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=0, InterpolantAutomatonStates: 14, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 28 ConstructedInterpolants, 8 QuantifiedInterpolants, 544 SizeOfPredicates, 5 NumberOfNonLiveVariables, 127 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (x == x) RESULT: Ultimate proved your program to be correct! [2024-10-12 17:22:55,476 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 Writing output log to file Ultimate.log Result: TRUE