./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1232b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1232b.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 6764d5c0204d5929259e99bbe2407d8f2018e402cda704b63da836202ebf4e68 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 11:54:06,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 11:54:06,988 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 11:54:06,995 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 11:54:06,999 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 11:54:07,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 11:54:07,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 11:54:07,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 11:54:07,027 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 11:54:07,027 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 11:54:07,027 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 11:54:07,028 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 11:54:07,028 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 11:54:07,028 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 11:54:07,028 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 11:54:07,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 11:54:07,029 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 11:54:07,029 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 11:54:07,033 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 11:54:07,033 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 11:54:07,033 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 11:54:07,034 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 11:54:07,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 11:54:07,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 11:54:07,034 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 11:54:07,035 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 11:54:07,035 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 11:54:07,035 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 11:54:07,035 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 11:54:07,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 11:54:07,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 11:54:07,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 11:54:07,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 11:54:07,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 11:54:07,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 11:54:07,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 11:54:07,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 11:54:07,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 11:54:07,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 11:54:07,037 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 11:54:07,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 11:54:07,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 11:54:07,041 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 -> 6764d5c0204d5929259e99bbe2407d8f2018e402cda704b63da836202ebf4e68 [2024-11-18 11:54:07,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 11:54:07,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 11:54:07,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 11:54:07,331 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 11:54:07,332 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 11:54:07,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1232b.c [2024-11-18 11:54:08,892 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 11:54:09,066 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 11:54:09,066 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232b.c [2024-11-18 11:54:09,072 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cb2da047/36231904a15045b1ab2fa548eb00bf4f/FLAGa3a198f7b [2024-11-18 11:54:09,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cb2da047/36231904a15045b1ab2fa548eb00bf4f [2024-11-18 11:54:09,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 11:54:09,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 11:54:09,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 11:54:09,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 11:54:09,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 11:54:09,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:54:09" (1/1) ... [2024-11-18 11:54:09,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48bbe891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:09, skipping insertion in model container [2024-11-18 11:54:09,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:54:09" (1/1) ... [2024-11-18 11:54:09,115 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 11:54:09,277 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232b.c[1657,1670] [2024-11-18 11:54:09,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 11:54:09,288 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 11:54:09,314 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232b.c[1657,1670] [2024-11-18 11:54:09,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 11:54:09,341 INFO L204 MainTranslator]: Completed translation [2024-11-18 11:54:09,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:09 WrapperNode [2024-11-18 11:54:09,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 11:54:09,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 11:54:09,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 11:54:09,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 11:54:09,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:09" (1/1) ... [2024-11-18 11:54:09,361 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:09" (1/1) ... [2024-11-18 11:54:09,385 INFO L138 Inliner]: procedures = 18, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-11-18 11:54:09,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 11:54:09,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 11:54:09,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 11:54:09,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 11:54:09,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:09" (1/1) ... [2024-11-18 11:54:09,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:09" (1/1) ... [2024-11-18 11:54:09,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:09" (1/1) ... [2024-11-18 11:54:09,422 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 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-11-18 11:54:09,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:09" (1/1) ... [2024-11-18 11:54:09,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:09" (1/1) ... [2024-11-18 11:54:09,434 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:09" (1/1) ... [2024-11-18 11:54:09,440 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:09" (1/1) ... [2024-11-18 11:54:09,442 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:09" (1/1) ... [2024-11-18 11:54:09,443 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:09" (1/1) ... [2024-11-18 11:54:09,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 11:54:09,450 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 11:54:09,450 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 11:54:09,450 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 11:54:09,451 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:09" (1/1) ... [2024-11-18 11:54:09,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 11:54:09,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 11:54:09,489 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 11:54:09,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 11:54:09,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 11:54:09,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 11:54:09,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 11:54:09,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-18 11:54:09,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-18 11:54:09,549 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-18 11:54:09,549 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-18 11:54:09,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-18 11:54:09,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-18 11:54:09,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-18 11:54:09,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 11:54:09,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 11:54:09,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-18 11:54:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-18 11:54:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-18 11:54:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-18 11:54:09,678 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 11:54:09,680 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 11:54:09,889 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-18 11:54:09,889 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 11:54:09,898 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 11:54:09,898 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-18 11:54:09,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:54:09 BoogieIcfgContainer [2024-11-18 11:54:09,899 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 11:54:09,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 11:54:09,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 11:54:09,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 11:54:09,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:54:09" (1/3) ... [2024-11-18 11:54:09,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d70d32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:54:09, skipping insertion in model container [2024-11-18 11:54:09,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:09" (2/3) ... [2024-11-18 11:54:09,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d70d32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:54:09, skipping insertion in model container [2024-11-18 11:54:09,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:54:09" (3/3) ... [2024-11-18 11:54:09,906 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1232b.c [2024-11-18 11:54:09,927 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 11:54:09,928 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 11:54:09,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 11:54:09,993 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;@2ce4f855, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 11:54:09,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 11:54:09,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 11:54:10,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-18 11:54:10,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:10,005 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:10,006 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:10,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:10,011 INFO L85 PathProgramCache]: Analyzing trace with hash -160972861, now seen corresponding path program 1 times [2024-11-18 11:54:10,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:54:10,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375600077] [2024-11-18 11:54:10,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:10,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:54:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 11:54:10,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:54:10,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375600077] [2024-11-18 11:54:10,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375600077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:10,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:10,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 11:54:10,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108524536] [2024-11-18 11:54:10,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:10,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 11:54:10,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:54:10,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 11:54:10,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 11:54:10,191 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:54:10,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:10,208 INFO L93 Difference]: Finished difference Result 55 states and 80 transitions. [2024-11-18 11:54:10,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 11:54:10,210 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-18 11:54:10,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:10,220 INFO L225 Difference]: With dead ends: 55 [2024-11-18 11:54:10,221 INFO L226 Difference]: Without dead ends: 26 [2024-11-18 11:54:10,224 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-11-18 11:54:10,228 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:10,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:10,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-18 11:54:10,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-18 11:54:10,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 11:54:10,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-18 11:54:10,286 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 14 [2024-11-18 11:54:10,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:10,286 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-18 11:54:10,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:54:10,286 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-18 11:54:10,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-18 11:54:10,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:10,288 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:10,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 11:54:10,288 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:10,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:10,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1856750492, now seen corresponding path program 1 times [2024-11-18 11:54:10,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:54:10,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375696532] [2024-11-18 11:54:10,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:10,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:54:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:10,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 11:54:10,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:54:10,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375696532] [2024-11-18 11:54:10,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375696532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:10,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:10,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:54:10,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948316082] [2024-11-18 11:54:10,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:10,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:54:10,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:54:10,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:54:10,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:54:10,500 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:54:10,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:10,526 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-18 11:54:10,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:54:10,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-18 11:54:10,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:10,530 INFO L225 Difference]: With dead ends: 39 [2024-11-18 11:54:10,530 INFO L226 Difference]: Without dead ends: 30 [2024-11-18 11:54:10,530 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-11-18 11:54:10,531 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:10,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:10,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-18 11:54:10,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-18 11:54:10,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-18 11:54:10,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-18 11:54:10,546 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2024-11-18 11:54:10,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:10,546 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-18 11:54:10,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:54:10,547 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-18 11:54:10,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-18 11:54:10,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:10,548 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:10,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 11:54:10,548 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:10,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:10,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1502968870, now seen corresponding path program 1 times [2024-11-18 11:54:10,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:54:10,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278745720] [2024-11-18 11:54:10,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:10,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:54:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 11:54:10,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:54:10,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278745720] [2024-11-18 11:54:10,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278745720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:10,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:10,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:54:10,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794867348] [2024-11-18 11:54:10,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:10,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:54:10,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:54:10,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:54:10,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:54:10,639 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:54:10,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:10,665 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-18 11:54:10,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:54:10,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-18 11:54:10,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:10,667 INFO L225 Difference]: With dead ends: 43 [2024-11-18 11:54:10,667 INFO L226 Difference]: Without dead ends: 34 [2024-11-18 11:54:10,668 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-11-18 11:54:10,669 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:10,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:10,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-18 11:54:10,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-18 11:54:10,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-18 11:54:10,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-18 11:54:10,674 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 16 [2024-11-18 11:54:10,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:10,674 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-18 11:54:10,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:54:10,675 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-18 11:54:10,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-18 11:54:10,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:10,675 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:10,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 11:54:10,676 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:10,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:10,676 INFO L85 PathProgramCache]: Analyzing trace with hash -359796568, now seen corresponding path program 1 times [2024-11-18 11:54:10,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:54:10,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112005657] [2024-11-18 11:54:10,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:10,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:54:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:10,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 11:54:10,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:54:10,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112005657] [2024-11-18 11:54:10,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112005657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:10,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:10,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:54:10,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074130063] [2024-11-18 11:54:10,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:10,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:54:10,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:54:10,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:54:10,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:54:10,744 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:54:10,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:10,776 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-18 11:54:10,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:54:10,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-18 11:54:10,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:10,779 INFO L225 Difference]: With dead ends: 43 [2024-11-18 11:54:10,779 INFO L226 Difference]: Without dead ends: 34 [2024-11-18 11:54:10,779 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-11-18 11:54:10,783 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:10,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-18 11:54:10,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-18 11:54:10,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-18 11:54:10,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-18 11:54:10,790 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2024-11-18 11:54:10,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:10,790 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-18 11:54:10,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:54:10,791 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-18 11:54:10,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-18 11:54:10,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:10,791 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:10,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 11:54:10,792 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:10,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:10,792 INFO L85 PathProgramCache]: Analyzing trace with hash -910833558, now seen corresponding path program 1 times [2024-11-18 11:54:10,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:54:10,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785292335] [2024-11-18 11:54:10,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:10,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:54:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:10,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 11:54:10,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:54:10,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785292335] [2024-11-18 11:54:10,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785292335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:10,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:10,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:54:10,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395864657] [2024-11-18 11:54:10,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:10,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:54:10,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:54:10,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:54:10,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:54:10,894 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:54:10,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:10,914 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-18 11:54:10,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:54:10,915 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-18 11:54:10,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:10,916 INFO L225 Difference]: With dead ends: 43 [2024-11-18 11:54:10,916 INFO L226 Difference]: Without dead ends: 34 [2024-11-18 11:54:10,916 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-11-18 11:54:10,917 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:10,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:10,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-18 11:54:10,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-18 11:54:10,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-18 11:54:10,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-18 11:54:10,921 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 18 [2024-11-18 11:54:10,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:10,921 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-18 11:54:10,921 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:54:10,922 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-18 11:54:10,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-18 11:54:10,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:10,922 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:10,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 11:54:10,923 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:10,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:10,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1576679275, now seen corresponding path program 1 times [2024-11-18 11:54:10,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:54:10,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120806970] [2024-11-18 11:54:10,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:10,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:54:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 11:54:10,935 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 11:54:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 11:54:10,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 11:54:10,978 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 11:54:10,979 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 11:54:10,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 11:54:10,985 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-18 11:54:11,006 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 11:54:11,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:54:11 BoogieIcfgContainer [2024-11-18 11:54:11,011 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 11:54:11,012 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 11:54:11,012 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 11:54:11,012 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 11:54:11,012 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:54:09" (3/4) ... [2024-11-18 11:54:11,015 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 11:54:11,016 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 11:54:11,020 INFO L158 Benchmark]: Toolchain (without parser) took 1935.49ms. Allocated memory was 159.4MB in the beginning and 249.6MB in the end (delta: 90.2MB). Free memory was 87.3MB in the beginning and 166.7MB in the end (delta: -79.4MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2024-11-18 11:54:11,020 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 109.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 11:54:11,020 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.40ms. Allocated memory is still 159.4MB. Free memory was 87.1MB in the beginning and 74.1MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 11:54:11,020 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.66ms. Allocated memory is still 159.4MB. Free memory was 74.1MB in the beginning and 72.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 11:54:11,020 INFO L158 Benchmark]: Boogie Preprocessor took 62.19ms. Allocated memory is still 159.4MB. Free memory was 72.5MB in the beginning and 70.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 11:54:11,021 INFO L158 Benchmark]: RCFGBuilder took 448.86ms. Allocated memory was 159.4MB in the beginning and 249.6MB in the end (delta: 90.2MB). Free memory was 70.3MB in the beginning and 211.9MB in the end (delta: -141.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-18 11:54:11,021 INFO L158 Benchmark]: TraceAbstraction took 1110.81ms. Allocated memory is still 249.6MB. Free memory was 211.9MB in the beginning and 166.7MB in the end (delta: 45.2MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. [2024-11-18 11:54:11,021 INFO L158 Benchmark]: Witness Printer took 7.54ms. Allocated memory is still 249.6MB. Free memory is still 166.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 11:54:11,023 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 159.4MB. Free memory is still 109.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.40ms. Allocated memory is still 159.4MB. Free memory was 87.1MB in the beginning and 74.1MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.66ms. Allocated memory is still 159.4MB. Free memory was 74.1MB in the beginning and 72.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.19ms. Allocated memory is still 159.4MB. Free memory was 72.5MB in the beginning and 70.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 448.86ms. Allocated memory was 159.4MB in the beginning and 249.6MB in the end (delta: 90.2MB). Free memory was 70.3MB in the beginning and 211.9MB in the end (delta: -141.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1110.81ms. Allocated memory is still 249.6MB. Free memory was 211.9MB in the beginning and 166.7MB in the end (delta: 45.2MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. * Witness Printer took 7.54ms. Allocated memory is still 249.6MB. Free memory is still 166.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 72]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someUnaryFLOAToperation at line 66. Possible FailurePath: [L66] float x = -0.0f; [L67] float y = 0.0f; [L68] CALL, EXPR fmin_float(x, y) [L38] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=4286578698] [L15] __uint32_t w; VAL [\old(x)=4286578698, x=4286578698] [L18] ieee_float_shape_type gf_u; [L19] gf_u.value = (x) [L20] EXPR gf_u.word [L20] (w) = gf_u.word [L23] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=4286578698, w=4286578689, x=4286578698] [L25-L26] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=4286578698, w=4286578689, x=4286578698] [L28-L29] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=4286578698, w=4286578689, x=4286578698] [L31] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L34] return 0; VAL [\old(x)=4286578698, \result=0, x=4286578698] [L38] RET, EXPR __fpclassify_float(x) VAL [x=4286578698, y=0] [L38] COND TRUE __fpclassify_float(x) == 0 [L39] return y; VAL [\result=0, x=4286578698] [L68] RET, EXPR fmin_float(x, y) [L68] float res = fmin_float(x, y); [L71] EXPR res == -0.0f && __signbit_float(res) == 1 VAL [res=0] [L71] EXPR res == -0.0f && __signbit_float(res) == 1 [L71] COND TRUE !(res == -0.0f && __signbit_float(res) == 1) [L72] reach_error() VAL [res=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 409 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 234 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 175 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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-11-18 11:54:11,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1232b.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 6764d5c0204d5929259e99bbe2407d8f2018e402cda704b63da836202ebf4e68 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 11:54:13,301 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 11:54:13,380 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 11:54:13,385 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 11:54:13,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 11:54:13,409 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 11:54:13,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 11:54:13,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 11:54:13,411 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 11:54:13,412 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 11:54:13,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 11:54:13,412 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 11:54:13,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 11:54:13,414 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 11:54:13,414 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 11:54:13,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 11:54:13,415 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 11:54:13,415 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 11:54:13,415 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 11:54:13,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 11:54:13,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 11:54:13,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 11:54:13,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 11:54:13,419 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 11:54:13,419 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 11:54:13,419 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 11:54:13,419 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 11:54:13,420 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 11:54:13,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 11:54:13,420 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 11:54:13,420 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 11:54:13,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 11:54:13,420 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 11:54:13,421 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 11:54:13,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 11:54:13,421 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 11:54:13,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 11:54:13,421 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 11:54:13,421 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 11:54:13,422 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 11:54:13,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 11:54:13,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 11:54:13,422 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 11:54:13,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 11:54:13,423 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6764d5c0204d5929259e99bbe2407d8f2018e402cda704b63da836202ebf4e68 [2024-11-18 11:54:13,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 11:54:13,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 11:54:13,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 11:54:13,764 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 11:54:13,764 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 11:54:13,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1232b.c [2024-11-18 11:54:15,318 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 11:54:15,479 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 11:54:15,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232b.c [2024-11-18 11:54:15,491 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb28b4194/975aff81f54c4e27932942eca1697125/FLAG5c31800c2 [2024-11-18 11:54:15,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb28b4194/975aff81f54c4e27932942eca1697125 [2024-11-18 11:54:15,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 11:54:15,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 11:54:15,513 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 11:54:15,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 11:54:15,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 11:54:15,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:54:15" (1/1) ... [2024-11-18 11:54:15,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38371406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:15, skipping insertion in model container [2024-11-18 11:54:15,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:54:15" (1/1) ... [2024-11-18 11:54:15,539 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 11:54:15,698 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232b.c[1657,1670] [2024-11-18 11:54:15,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 11:54:15,716 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 11:54:15,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232b.c[1657,1670] [2024-11-18 11:54:15,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 11:54:15,759 INFO L204 MainTranslator]: Completed translation [2024-11-18 11:54:15,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:15 WrapperNode [2024-11-18 11:54:15,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 11:54:15,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 11:54:15,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 11:54:15,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 11:54:15,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:15" (1/1) ... [2024-11-18 11:54:15,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:15" (1/1) ... [2024-11-18 11:54:15,796 INFO L138 Inliner]: procedures = 21, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-11-18 11:54:15,797 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 11:54:15,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 11:54:15,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 11:54:15,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 11:54:15,807 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:15" (1/1) ... [2024-11-18 11:54:15,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:15" (1/1) ... [2024-11-18 11:54:15,809 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:15" (1/1) ... [2024-11-18 11:54:15,827 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 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-11-18 11:54:15,827 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:15" (1/1) ... [2024-11-18 11:54:15,827 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:15" (1/1) ... [2024-11-18 11:54:15,838 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:15" (1/1) ... [2024-11-18 11:54:15,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:15" (1/1) ... [2024-11-18 11:54:15,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:15" (1/1) ... [2024-11-18 11:54:15,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:15" (1/1) ... [2024-11-18 11:54:15,850 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 11:54:15,851 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 11:54:15,854 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 11:54:15,854 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 11:54:15,854 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:15" (1/1) ... [2024-11-18 11:54:15,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 11:54:15,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 11:54:15,903 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 11:54:15,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 11:54:15,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 11:54:15,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 11:54:15,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-18 11:54:15,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-18 11:54:15,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-18 11:54:15,961 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-18 11:54:15,961 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-18 11:54:15,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-18 11:54:15,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-18 11:54:15,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-18 11:54:15,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 11:54:15,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 11:54:15,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-18 11:54:15,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-18 11:54:15,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-18 11:54:15,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-18 11:54:16,050 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 11:54:16,052 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 11:54:16,207 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-18 11:54:16,207 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 11:54:16,216 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 11:54:16,216 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-18 11:54:16,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:54:16 BoogieIcfgContainer [2024-11-18 11:54:16,217 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 11:54:16,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 11:54:16,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 11:54:16,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 11:54:16,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:54:15" (1/3) ... [2024-11-18 11:54:16,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7994012b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:54:16, skipping insertion in model container [2024-11-18 11:54:16,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:15" (2/3) ... [2024-11-18 11:54:16,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7994012b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:54:16, skipping insertion in model container [2024-11-18 11:54:16,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:54:16" (3/3) ... [2024-11-18 11:54:16,223 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1232b.c [2024-11-18 11:54:16,237 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 11:54:16,237 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 11:54:16,299 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 11:54:16,304 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;@19c02da1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 11:54:16,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 11:54:16,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 11:54:16,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-18 11:54:16,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:16,315 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:16,315 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:16,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:16,320 INFO L85 PathProgramCache]: Analyzing trace with hash 624090286, now seen corresponding path program 1 times [2024-11-18 11:54:16,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:54:16,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [219931323] [2024-11-18 11:54:16,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:16,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 11:54:16,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:54:16,334 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 11:54:16,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-18 11:54:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:16,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 11:54:16,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:54:16,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 11:54:16,418 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:54:16,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:54:16,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [219931323] [2024-11-18 11:54:16,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [219931323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:16,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:16,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 11:54:16,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835442077] [2024-11-18 11:54:16,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:16,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 11:54:16,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:54:16,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 11:54:16,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 11:54:16,477 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:54:16,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:16,497 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2024-11-18 11:54:16,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 11:54:16,499 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-18 11:54:16,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:16,505 INFO L225 Difference]: With dead ends: 51 [2024-11-18 11:54:16,505 INFO L226 Difference]: Without dead ends: 24 [2024-11-18 11:54:16,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 11:54:16,513 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:16,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:16,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-18 11:54:16,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-18 11:54:16,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 11:54:16,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-18 11:54:16,566 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2024-11-18 11:54:16,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:16,570 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-18 11:54:16,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:54:16,571 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-18 11:54:16,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-18 11:54:16,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:16,572 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:16,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-18 11:54:16,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 11:54:16,777 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:16,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:16,778 INFO L85 PathProgramCache]: Analyzing trace with hash 181002929, now seen corresponding path program 1 times [2024-11-18 11:54:16,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:54:16,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506827813] [2024-11-18 11:54:16,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:16,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 11:54:16,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:54:16,781 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 11:54:16,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-18 11:54:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:16,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 11:54:16,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:54:16,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 11:54:16,926 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:54:16,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:54:16,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506827813] [2024-11-18 11:54:16,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [506827813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:16,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:16,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:54:16,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138276545] [2024-11-18 11:54:16,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:16,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:54:16,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:54:16,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:54:16,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:54:16,932 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:54:16,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:16,960 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-11-18 11:54:16,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:54:16,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-18 11:54:16,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:16,963 INFO L225 Difference]: With dead ends: 36 [2024-11-18 11:54:16,963 INFO L226 Difference]: Without dead ends: 27 [2024-11-18 11:54:16,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 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-11-18 11:54:16,965 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:16,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:16,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-18 11:54:16,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-18 11:54:16,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-18 11:54:16,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-18 11:54:16,974 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2024-11-18 11:54:16,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:16,974 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-18 11:54:16,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:54:16,975 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-18 11:54:16,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-18 11:54:16,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:16,976 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:16,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-18 11:54:17,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 11:54:17,178 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:17,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:17,179 INFO L85 PathProgramCache]: Analyzing trace with hash -943857557, now seen corresponding path program 1 times [2024-11-18 11:54:17,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:54:17,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890623961] [2024-11-18 11:54:17,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:17,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 11:54:17,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:54:17,183 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 11:54:17,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-18 11:54:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:17,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-18 11:54:17,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:54:17,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 11:54:17,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:54:17,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:54:17,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890623961] [2024-11-18 11:54:17,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890623961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:17,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:17,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 11:54:17,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114175286] [2024-11-18 11:54:17,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:17,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 11:54:17,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:54:17,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 11:54:17,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 11:54:17,414 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:54:17,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:17,639 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-11-18 11:54:17,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 11:54:17,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-18 11:54:17,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:17,642 INFO L225 Difference]: With dead ends: 49 [2024-11-18 11:54:17,642 INFO L226 Difference]: Without dead ends: 26 [2024-11-18 11:54:17,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 11:54:17,644 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:17,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 73 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 11:54:17,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-18 11:54:17,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-18 11:54:17,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 11:54:17,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-18 11:54:17,655 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 15 [2024-11-18 11:54:17,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:17,656 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-18 11:54:17,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:54:17,656 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-18 11:54:17,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-18 11:54:17,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:17,658 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:17,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-18 11:54:17,862 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-11-18 11:54:17,863 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:17,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:17,863 INFO L85 PathProgramCache]: Analyzing trace with hash -941704498, now seen corresponding path program 1 times [2024-11-18 11:54:17,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:54:17,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175751533] [2024-11-18 11:54:17,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:17,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 11:54:17,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:54:17,870 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 11:54:17,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-18 11:54:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:17,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 11:54:17,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:54:17,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-18 11:54:17,971 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:54:17,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:54:17,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175751533] [2024-11-18 11:54:17,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175751533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:17,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:17,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:54:17,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211040457] [2024-11-18 11:54:17,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:17,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:54:17,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:54:17,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:54:17,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:54:17,975 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 11:54:18,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:18,000 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2024-11-18 11:54:18,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:54:18,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-18 11:54:18,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:18,001 INFO L225 Difference]: With dead ends: 36 [2024-11-18 11:54:18,001 INFO L226 Difference]: Without dead ends: 27 [2024-11-18 11:54:18,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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-11-18 11:54:18,002 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:18,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:18,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-18 11:54:18,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-18 11:54:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 11:54:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-18 11:54:18,006 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 22 [2024-11-18 11:54:18,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:18,006 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-18 11:54:18,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 11:54:18,007 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-18 11:54:18,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-18 11:54:18,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:18,007 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:18,021 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 (5)] Ended with exit code 0 [2024-11-18 11:54:18,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 11:54:18,214 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:18,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:18,215 INFO L85 PathProgramCache]: Analyzing trace with hash -939857456, now seen corresponding path program 1 times [2024-11-18 11:54:18,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:54:18,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143714285] [2024-11-18 11:54:18,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:18,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 11:54:18,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:54:18,218 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 11:54:18,219 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 (6)] Waiting until timeout for monitored process [2024-11-18 11:54:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:18,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-18 11:54:18,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:54:18,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-18 11:54:18,352 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:54:18,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:54:18,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143714285] [2024-11-18 11:54:18,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143714285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:18,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:18,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 11:54:18,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478395223] [2024-11-18 11:54:18,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:18,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 11:54:18,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:54:18,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 11:54:18,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 11:54:18,357 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 11:54:18,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:18,418 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-18 11:54:18,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 11:54:18,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-18 11:54:18,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:18,422 INFO L225 Difference]: With dead ends: 32 [2024-11-18 11:54:18,422 INFO L226 Difference]: Without dead ends: 29 [2024-11-18 11:54:18,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 11:54:18,427 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:18,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 11:54:18,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-18 11:54:18,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-18 11:54:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 11:54:18,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-18 11:54:18,436 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 22 [2024-11-18 11:54:18,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:18,436 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-18 11:54:18,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 11:54:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-11-18 11:54:18,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-18 11:54:18,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:18,437 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:18,446 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 (6)] Ended with exit code 0 [2024-11-18 11:54:18,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 11:54:18,638 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:18,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:18,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1022935030, now seen corresponding path program 1 times [2024-11-18 11:54:18,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:54:18,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023336634] [2024-11-18 11:54:18,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:18,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 11:54:18,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:54:18,643 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 11:54:18,644 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 (7)] Waiting until timeout for monitored process [2024-11-18 11:54:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:18,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-18 11:54:18,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:54:18,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 11:54:18,759 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:54:18,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:54:18,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023336634] [2024-11-18 11:54:18,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023336634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:18,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:18,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 11:54:18,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054637974] [2024-11-18 11:54:18,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:18,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 11:54:18,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:54:18,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 11:54:18,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 11:54:18,762 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 11:54:18,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:18,933 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-11-18 11:54:18,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 11:54:18,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-18 11:54:18,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:18,938 INFO L225 Difference]: With dead ends: 38 [2024-11-18 11:54:18,938 INFO L226 Difference]: Without dead ends: 21 [2024-11-18 11:54:18,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 11:54:18,938 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:18,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 68 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 11:54:18,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-18 11:54:18,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-18 11:54:18,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.0) internal successors, (17), 17 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 11:54:18,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-11-18 11:54:18,945 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 23 [2024-11-18 11:54:18,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:18,945 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-11-18 11:54:18,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 11:54:18,945 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-11-18 11:54:18,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-18 11:54:18,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:18,946 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:18,958 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 (7)] Forceful destruction successful, exit code 0 [2024-11-18 11:54:19,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 11:54:19,146 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:19,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:19,147 INFO L85 PathProgramCache]: Analyzing trace with hash 2027753189, now seen corresponding path program 1 times [2024-11-18 11:54:19,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:54:19,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [568492514] [2024-11-18 11:54:19,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:19,148 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 11:54:19,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:54:19,154 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 11:54:19,155 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 (8)] Waiting until timeout for monitored process [2024-11-18 11:54:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 11:54:19,309 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 11:54:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 11:54:19,428 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-18 11:54:19,432 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 11:54:19,433 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 11:54:19,441 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 (8)] Ended with exit code 0 [2024-11-18 11:54:19,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 11:54:19,637 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:19,685 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 11:54:19,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:54:19 BoogieIcfgContainer [2024-11-18 11:54:19,695 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 11:54:19,695 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 11:54:19,695 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 11:54:19,696 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 11:54:19,696 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:54:16" (3/4) ... [2024-11-18 11:54:19,700 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-18 11:54:19,755 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 11:54:19,755 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 11:54:19,756 INFO L158 Benchmark]: Toolchain (without parser) took 4245.01ms. Allocated memory was 67.1MB in the beginning and 119.5MB in the end (delta: 52.4MB). Free memory was 47.6MB in the beginning and 94.9MB in the end (delta: -47.3MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2024-11-18 11:54:19,756 INFO L158 Benchmark]: CDTParser took 0.84ms. Allocated memory is still 67.1MB. Free memory was 43.8MB in the beginning and 43.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 11:54:19,756 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.50ms. Allocated memory is still 67.1MB. Free memory was 47.4MB in the beginning and 34.0MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 11:54:19,757 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.21ms. Allocated memory is still 67.1MB. Free memory was 33.8MB in the beginning and 32.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 11:54:19,757 INFO L158 Benchmark]: Boogie Preprocessor took 51.93ms. Allocated memory is still 67.1MB. Free memory was 32.2MB in the beginning and 29.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 11:54:19,757 INFO L158 Benchmark]: RCFGBuilder took 365.81ms. Allocated memory was 67.1MB in the beginning and 98.6MB in the end (delta: 31.5MB). Free memory was 29.8MB in the beginning and 66.5MB in the end (delta: -36.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 11:54:19,757 INFO L158 Benchmark]: TraceAbstraction took 3476.78ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 66.0MB in the beginning and 97.1MB in the end (delta: -31.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 11:54:19,757 INFO L158 Benchmark]: Witness Printer took 60.15ms. Allocated memory is still 119.5MB. Free memory was 97.1MB in the beginning and 94.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 11:54:19,759 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.84ms. Allocated memory is still 67.1MB. Free memory was 43.8MB in the beginning and 43.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.50ms. Allocated memory is still 67.1MB. Free memory was 47.4MB in the beginning and 34.0MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.21ms. Allocated memory is still 67.1MB. Free memory was 33.8MB in the beginning and 32.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.93ms. Allocated memory is still 67.1MB. Free memory was 32.2MB in the beginning and 29.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 365.81ms. Allocated memory was 67.1MB in the beginning and 98.6MB in the end (delta: 31.5MB). Free memory was 29.8MB in the beginning and 66.5MB in the end (delta: -36.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3476.78ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 66.0MB in the beginning and 97.1MB in the end (delta: -31.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 60.15ms. Allocated memory is still 119.5MB. Free memory was 97.1MB in the beginning and 94.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. 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 - CounterExampleResult [Line: 72]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L66] float x = -0.0f; [L67] float y = 0.0f; [L68] CALL, EXPR fmin_float(x, y) [L38] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=0.0] [L15] __uint32_t w; VAL [\old(x)=0.0, x=0.0] [L18] ieee_float_shape_type gf_u; [L19] gf_u.value = (x) [L20] EXPR gf_u.word [L20] (w) = gf_u.word [L23] COND TRUE w == 0x00000000 || w == 0x80000000 [L24] return 2; VAL [\old(x)=0.0, \result=2, x=0.0] [L38] RET, EXPR __fpclassify_float(x) VAL [x=0.0, y=0.0] [L38] COND FALSE !(__fpclassify_float(x) == 0) [L40] CALL, EXPR __fpclassify_float(y) VAL [\old(x)=0.0] [L15] __uint32_t w; VAL [\old(x)=0.0, x=0.0] [L18] ieee_float_shape_type gf_u; [L19] gf_u.value = (x) [L20] EXPR gf_u.word [L20] (w) = gf_u.word [L23] COND TRUE w == 0x00000000 || w == 0x80000000 [L24] return 2; VAL [\old(x)=0.0, \result=2, x=0.0] [L40] RET, EXPR __fpclassify_float(y) VAL [x=0.0, y=0.0] [L40] COND FALSE !(__fpclassify_float(y) == 0) [L43] return x < y ? x : y; VAL [\result=0.0] [L68] RET, EXPR fmin_float(x, y) [L68] float res = fmin_float(x, y); [L71] EXPR res == -0.0f && __signbit_float(res) == 1 VAL [res=0.0] [L71] EXPR res == -0.0f && __signbit_float(res) == 1 [L71] CALL, EXPR __signbit_float(res) [L47] __uint32_t w; VAL [x=0.0] [L50] ieee_float_shape_type gf_u; [L51] gf_u.value = (x) [L52] EXPR gf_u.word [L52] (w) = gf_u.word [L55] return (w & 0x80000000) != 0; VAL [\result=0, x=0.0] [L71] RET, EXPR __signbit_float(res) [L71] EXPR res == -0.0f && __signbit_float(res) == 1 [L71] COND TRUE !(res == -0.0f && __signbit_float(res) == 1) [L72] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 431 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 277 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 143 IncrementalHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 154 mSDtfsCounter, 143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=5, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 103 ConstructedInterpolants, 6 QuantifiedInterpolants, 280 SizeOfPredicates, 9 NumberOfNonLiveVariables, 376 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 18/18 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 proved your program to be incorrect! [2024-11-18 11:54:19,792 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE