./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 3399d68d5f538e178264c8cc09444ea6c28026f61fb8e4808b455fab52f2fa4f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:49:11,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:49:11,879 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:49:11,885 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:49:11,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:49:11,917 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:49:11,918 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:49:11,919 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:49:11,919 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:49:11,920 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:49:11,922 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:49:11,922 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:49:11,922 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:49:11,923 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:49:11,923 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:49:11,925 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:49:11,925 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:49:11,926 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:49:11,926 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:49:11,926 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:49:11,926 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:49:11,930 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:49:11,930 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:49:11,931 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:49:11,931 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:49:11,931 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:49:11,931 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:49:11,931 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:49:11,932 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:49:11,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:49:11,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:49:11,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:49:11,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:49:11,933 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:49:11,933 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:49:11,933 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:49:11,933 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:49:11,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:49:11,934 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:49:11,934 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:49:11,934 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:49:11,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:49:11,937 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-clean/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-clean/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 -> 3399d68d5f538e178264c8cc09444ea6c28026f61fb8e4808b455fab52f2fa4f [2024-10-11 10:49:12,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:49:12,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:49:12,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:49:12,233 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:49:12,233 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:49:12,234 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i [2024-10-11 10:49:13,613 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:49:13,809 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:49:13,810 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i [2024-10-11 10:49:13,818 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ab2d9cacd/cddb68ebbc5243b586a4a8596c33535c/FLAG0512f73d4 [2024-10-11 10:49:14,190 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ab2d9cacd/cddb68ebbc5243b586a4a8596c33535c [2024-10-11 10:49:14,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:49:14,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:49:14,195 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:49:14,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:49:14,201 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:49:14,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:49:14" (1/1) ... [2024-10-11 10:49:14,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eece7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:14, skipping insertion in model container [2024-10-11 10:49:14,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:49:14" (1/1) ... [2024-10-11 10:49:14,230 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:49:14,405 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i[917,930] [2024-10-11 10:49:14,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:49:14,473 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:49:14,482 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i[917,930] [2024-10-11 10:49:14,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:49:14,526 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:49:14,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:14 WrapperNode [2024-10-11 10:49:14,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:49:14,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:49:14,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:49:14,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:49:14,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:14" (1/1) ... [2024-10-11 10:49:14,542 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:14" (1/1) ... [2024-10-11 10:49:14,572 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-10-11 10:49:14,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:49:14,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:49:14,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:49:14,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:49:14,584 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:14" (1/1) ... [2024-10-11 10:49:14,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:14" (1/1) ... [2024-10-11 10:49:14,587 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:14" (1/1) ... [2024-10-11 10:49:14,607 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:49:14,608 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:14" (1/1) ... [2024-10-11 10:49:14,608 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:14" (1/1) ... [2024-10-11 10:49:14,619 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:14" (1/1) ... [2024-10-11 10:49:14,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:14" (1/1) ... [2024-10-11 10:49:14,632 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:14" (1/1) ... [2024-10-11 10:49:14,633 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:14" (1/1) ... [2024-10-11 10:49:14,636 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:49:14,637 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:49:14,638 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:49:14,638 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:49:14,639 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:14" (1/1) ... [2024-10-11 10:49:14,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:49:14,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:49:14,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:49:14,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:49:14,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:49:14,720 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:49:14,720 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:49:14,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:49:14,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:49:14,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:49:14,821 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:49:14,823 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:49:15,037 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 10:49:15,038 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:49:15,099 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:49:15,100 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:49:15,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:49:15 BoogieIcfgContainer [2024-10-11 10:49:15,100 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:49:15,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:49:15,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:49:15,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:49:15,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:49:14" (1/3) ... [2024-10-11 10:49:15,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278cff7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:49:15, skipping insertion in model container [2024-10-11 10:49:15,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:14" (2/3) ... [2024-10-11 10:49:15,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278cff7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:49:15, skipping insertion in model container [2024-10-11 10:49:15,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:49:15" (3/3) ... [2024-10-11 10:49:15,112 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-74.i [2024-10-11 10:49:15,128 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:49:15,128 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:49:15,185 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:49:15,192 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;@ab99f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:49:15,192 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:49:15,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 10:49:15,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 10:49:15,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:49:15,205 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:49:15,205 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:49:15,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:49:15,209 INFO L85 PathProgramCache]: Analyzing trace with hash -162583371, now seen corresponding path program 1 times [2024-10-11 10:49:15,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:49:15,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978448010] [2024-10-11 10:49:15,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:49:15,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:49:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:15,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:49:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:15,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:49:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:15,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:49:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:15,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 10:49:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:15,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 10:49:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:15,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 10:49:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:15,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 10:49:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:15,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:49:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:15,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 10:49:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:15,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 10:49:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:15,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 10:49:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:15,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:49:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:15,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:49:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:15,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 10:49:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:15,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:49:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:15,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 10:49:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:15,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:49:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:15,644 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 10:49:15,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:49:15,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978448010] [2024-10-11 10:49:15,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978448010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:49:15,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:49:15,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:49:15,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409589005] [2024-10-11 10:49:15,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:49:15,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:49:15,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:49:15,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:49:15,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:49:15,678 INFO L87 Difference]: Start difference. First operand has 48 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 10:49:15,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:49:15,723 INFO L93 Difference]: Finished difference Result 93 states and 161 transitions. [2024-10-11 10:49:15,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:49:15,725 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 105 [2024-10-11 10:49:15,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:49:15,732 INFO L225 Difference]: With dead ends: 93 [2024-10-11 10:49:15,732 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 10:49:15,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:49:15,741 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:49:15,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:49:15,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 10:49:15,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-11 10:49:15,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 10:49:15,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2024-10-11 10:49:15,793 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 105 [2024-10-11 10:49:15,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:49:15,793 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2024-10-11 10:49:15,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 10:49:15,794 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2024-10-11 10:49:15,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 10:49:15,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:49:15,798 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:49:15,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:49:15,799 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:49:15,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:49:15,800 INFO L85 PathProgramCache]: Analyzing trace with hash 529998271, now seen corresponding path program 1 times [2024-10-11 10:49:15,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:49:15,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138235658] [2024-10-11 10:49:15,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:49:15,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:49:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:16,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:49:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:16,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:49:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:16,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:49:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:16,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 10:49:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:16,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 10:49:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:16,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 10:49:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:16,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 10:49:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:16,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:49:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:16,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 10:49:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:16,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 10:49:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:16,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 10:49:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:16,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:49:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:16,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:49:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:16,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 10:49:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:16,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:49:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:16,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 10:49:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:16,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:49:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 10:49:16,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:49:16,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138235658] [2024-10-11 10:49:16,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138235658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:49:16,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:49:16,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 10:49:16,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616898412] [2024-10-11 10:49:16,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:49:16,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:49:16,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:49:16,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:49:16,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:49:16,440 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 10:49:16,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:49:16,627 INFO L93 Difference]: Finished difference Result 137 states and 203 transitions. [2024-10-11 10:49:16,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:49:16,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 105 [2024-10-11 10:49:16,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:49:16,633 INFO L225 Difference]: With dead ends: 137 [2024-10-11 10:49:16,633 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 10:49:16,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:49:16,635 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 38 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:49:16,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 217 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:49:16,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 10:49:16,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2024-10-11 10:49:16,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 10:49:16,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 118 transitions. [2024-10-11 10:49:16,660 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 118 transitions. Word has length 105 [2024-10-11 10:49:16,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:49:16,660 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 118 transitions. [2024-10-11 10:49:16,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 10:49:16,661 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 118 transitions. [2024-10-11 10:49:16,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 10:49:16,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:49:16,665 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:49:16,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:49:16,666 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:49:16,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:49:16,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1245009091, now seen corresponding path program 1 times [2024-10-11 10:49:16,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:49:16,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185982706] [2024-10-11 10:49:16,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:49:16,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:49:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:49:16,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:49:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:49:16,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:49:16,934 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:49:16,936 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:49:16,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:49:16,942 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 10:49:17,032 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:49:17,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:49:17 BoogieIcfgContainer [2024-10-11 10:49:17,037 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:49:17,038 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:49:17,038 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:49:17,038 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:49:17,038 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:49:15" (3/4) ... [2024-10-11 10:49:17,040 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:49:17,041 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:49:17,043 INFO L158 Benchmark]: Toolchain (without parser) took 2848.10ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 108.2MB in the beginning and 130.5MB in the end (delta: -22.3MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2024-10-11 10:49:17,044 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 56.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:49:17,044 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.59ms. Allocated memory is still 161.5MB. Free memory was 108.0MB in the beginning and 93.5MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 10:49:17,044 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.75ms. Allocated memory is still 161.5MB. Free memory was 93.5MB in the beginning and 91.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 10:49:17,047 INFO L158 Benchmark]: Boogie Preprocessor took 63.25ms. Allocated memory is still 161.5MB. Free memory was 91.4MB in the beginning and 88.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:49:17,048 INFO L158 Benchmark]: RCFGBuilder took 463.22ms. Allocated memory is still 161.5MB. Free memory was 88.6MB in the beginning and 116.7MB in the end (delta: -28.0MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2024-10-11 10:49:17,048 INFO L158 Benchmark]: TraceAbstraction took 1932.94ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 115.8MB in the beginning and 130.5MB in the end (delta: -14.7MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2024-10-11 10:49:17,048 INFO L158 Benchmark]: Witness Printer took 3.85ms. Allocated memory is still 195.0MB. Free memory is still 130.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:49:17,050 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.17ms. Allocated memory is still 96.5MB. Free memory is still 56.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.59ms. Allocated memory is still 161.5MB. Free memory was 108.0MB in the beginning and 93.5MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.75ms. Allocated memory is still 161.5MB. Free memory was 93.5MB in the beginning and 91.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.25ms. Allocated memory is still 161.5MB. Free memory was 91.4MB in the beginning and 88.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 463.22ms. Allocated memory is still 161.5MB. Free memory was 88.6MB in the beginning and 116.7MB in the end (delta: -28.0MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1932.94ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 115.8MB in the beginning and 130.5MB in the end (delta: -14.7MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * Witness Printer took 3.85ms. Allocated memory is still 195.0MB. Free memory is still 130.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 25; [L23] double var_1_2 = 63.25; [L24] double var_1_3 = 3.779; [L25] double var_1_4 = 31.6; [L26] double var_1_5 = 100.5; [L27] unsigned long int var_1_6 = 64; [L28] unsigned long int var_1_7 = 3150951169; [L29] unsigned long int var_1_8 = 128; [L30] unsigned long int var_1_9 = 1; [L31] unsigned char var_1_10 = 1; [L32] double var_1_11 = 9.3; [L33] unsigned char var_1_14 = 0; [L34] unsigned char var_1_15 = 1; [L35] unsigned char var_1_16 = 1; [L36] unsigned char last_1_var_1_16 = 1; [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L101] last_1_var_1_16 = var_1_16 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L72] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L73] var_1_3 = __VERIFIER_nondet_double() [L74] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L74] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L75] var_1_4 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L76] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L77] var_1_5 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L78] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L79] var_1_6 = __VERIFIER_nondet_ulong() [L80] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L80] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L81] CALL assume_abort_if_not(var_1_6 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L81] RET assume_abort_if_not(var_1_6 <= 4294967294) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L82] var_1_7 = __VERIFIER_nondet_ulong() [L83] CALL assume_abort_if_not(var_1_7 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=128, var_1_9=1] [L83] RET assume_abort_if_not(var_1_7 >= 2147483647) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=128, var_1_9=1] [L84] CALL assume_abort_if_not(var_1_7 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=128, var_1_9=1] [L84] RET assume_abort_if_not(var_1_7 <= 4294967294) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=128, var_1_9=1] [L85] var_1_8 = __VERIFIER_nondet_ulong() [L86] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_9=1] [L86] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_9=1] [L87] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=1] [L87] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=1] [L88] var_1_9 = __VERIFIER_nondet_ulong() [L89] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1] [L89] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1] [L90] CALL assume_abort_if_not(var_1_9 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L90] RET assume_abort_if_not(var_1_9 <= 4294967294) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L91] var_1_11 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L92] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L93] var_1_14 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L94] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L95] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L95] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L96] var_1_15 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=-255, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=-255, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L97] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=-255, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L98] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=-255, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=-255, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L98] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=-255, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L112] RET updateVariables() [L113] CALL step() [L40] unsigned char stepLocal_0 = last_1_var_1_16 && last_1_var_1_16; VAL [isInitial=1, last_1_var_1_16=1, stepLocal_0=1, var_1_10=1, var_1_14=0, var_1_15=-255, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L41] COND TRUE (var_1_5 > var_1_11) || stepLocal_0 [L42] var_1_10 = var_1_14 VAL [isInitial=1, last_1_var_1_16=1, var_1_10=0, var_1_14=0, var_1_15=-255, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L46] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_16=1, stepLocal_1=0, var_1_10=0, var_1_14=0, var_1_15=-255, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L47] COND FALSE !(stepLocal_1 && var_1_10) [L54] var_1_16 = var_1_15 VAL [isInitial=1, last_1_var_1_16=1, var_1_10=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L56] COND TRUE ((((((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) < (var_1_4)) ? (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) : (var_1_4))) < var_1_5 [L57] var_1_1 = ((((var_1_6) > ((var_1_7 - var_1_8))) ? (var_1_6) : ((var_1_7 - var_1_8)))) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_1=-2147483650, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L113] RET step() [L114] CALL, EXPR property() [L104-L105] return (((((((((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) < (var_1_4)) ? (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) : (var_1_4))) < var_1_5) ? (var_1_1 == ((unsigned long int) ((((var_1_6) > ((var_1_7 - var_1_8))) ? (var_1_6) : ((var_1_7 - var_1_8)))))) : ((var_1_2 >= (var_1_3 + var_1_5)) ? ((var_1_4 > (- var_1_5)) ? (var_1_1 == ((unsigned long int) var_1_6)) : (var_1_1 == ((unsigned long int) var_1_9))) : (var_1_1 == ((unsigned long int) var_1_6)))) && (((var_1_5 > var_1_11) || (last_1_var_1_16 && last_1_var_1_16)) ? (var_1_10 == ((unsigned char) var_1_14)) : (var_1_10 == ((unsigned char) (var_1_14 && (! var_1_15)))))) && ((var_1_10 && var_1_10) ? ((var_1_4 < (- var_1_5)) ? (var_1_16 == ((unsigned char) var_1_15)) : (var_1_16 == ((unsigned char) var_1_15))) : (var_1_16 == ((unsigned char) var_1_15))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_1=-2147483650, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=1, var_1_10=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_1=-2147483650, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 282 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 154 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 56 IncrementalHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 128 mSDtfsCounter, 56 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 272 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1088/1088 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 10:49:17,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 3399d68d5f538e178264c8cc09444ea6c28026f61fb8e4808b455fab52f2fa4f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:49:19,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:49:19,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 10:49:19,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:49:19,310 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:49:19,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:49:19,344 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:49:19,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:49:19,347 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:49:19,347 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:49:19,347 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:49:19,348 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:49:19,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:49:19,349 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:49:19,349 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:49:19,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:49:19,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:49:19,350 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:49:19,350 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:49:19,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:49:19,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:49:19,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:49:19,357 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:49:19,357 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:49:19,357 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:49:19,358 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:49:19,358 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:49:19,358 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:49:19,358 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:49:19,359 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:49:19,359 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:49:19,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:49:19,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:49:19,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:49:19,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:49:19,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:49:19,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:49:19,360 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:49:19,361 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:49:19,361 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:49:19,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:49:19,362 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:49:19,362 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:49:19,362 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:49:19,362 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:49:19,363 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-clean/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-clean/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 -> 3399d68d5f538e178264c8cc09444ea6c28026f61fb8e4808b455fab52f2fa4f [2024-10-11 10:49:19,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:49:19,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:49:19,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:49:19,699 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:49:19,700 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:49:19,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i [2024-10-11 10:49:21,311 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:49:21,513 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:49:21,515 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i [2024-10-11 10:49:21,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/87428e81a/36af9f4129e443719c2880bb1636e4d5/FLAG22e0d1d3c [2024-10-11 10:49:21,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/87428e81a/36af9f4129e443719c2880bb1636e4d5 [2024-10-11 10:49:21,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:49:21,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:49:21,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:49:21,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:49:21,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:49:21,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:49:21" (1/1) ... [2024-10-11 10:49:21,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f71a41d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:21, skipping insertion in model container [2024-10-11 10:49:21,891 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:49:21" (1/1) ... [2024-10-11 10:49:21,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:49:22,109 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i[917,930] [2024-10-11 10:49:22,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:49:22,187 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:49:22,198 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i[917,930] [2024-10-11 10:49:22,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:49:22,254 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:49:22,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:22 WrapperNode [2024-10-11 10:49:22,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:49:22,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:49:22,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:49:22,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:49:22,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:22" (1/1) ... [2024-10-11 10:49:22,283 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:22" (1/1) ... [2024-10-11 10:49:22,312 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-10-11 10:49:22,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:49:22,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:49:22,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:49:22,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:49:22,329 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:22" (1/1) ... [2024-10-11 10:49:22,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:22" (1/1) ... [2024-10-11 10:49:22,332 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:22" (1/1) ... [2024-10-11 10:49:22,350 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:49:22,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:22" (1/1) ... [2024-10-11 10:49:22,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:22" (1/1) ... [2024-10-11 10:49:22,367 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:22" (1/1) ... [2024-10-11 10:49:22,374 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:22" (1/1) ... [2024-10-11 10:49:22,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:22" (1/1) ... [2024-10-11 10:49:22,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:22" (1/1) ... [2024-10-11 10:49:22,384 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:49:22,389 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:49:22,389 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:49:22,389 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:49:22,390 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:22" (1/1) ... [2024-10-11 10:49:22,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:49:22,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:49:22,425 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:49:22,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:49:22,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:49:22,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:49:22,481 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:49:22,481 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:49:22,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:49:22,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:49:22,564 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:49:22,566 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:49:23,237 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 10:49:23,238 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:49:23,303 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:49:23,303 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:49:23,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:49:23 BoogieIcfgContainer [2024-10-11 10:49:23,304 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:49:23,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:49:23,308 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:49:23,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:49:23,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:49:21" (1/3) ... [2024-10-11 10:49:23,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6534d173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:49:23, skipping insertion in model container [2024-10-11 10:49:23,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:49:22" (2/3) ... [2024-10-11 10:49:23,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6534d173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:49:23, skipping insertion in model container [2024-10-11 10:49:23,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:49:23" (3/3) ... [2024-10-11 10:49:23,316 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-74.i [2024-10-11 10:49:23,332 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:49:23,333 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:49:23,402 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:49:23,411 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;@2fbcfa4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:49:23,411 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:49:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 10:49:23,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 10:49:23,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:49:23,429 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:49:23,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:49:23,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:49:23,437 INFO L85 PathProgramCache]: Analyzing trace with hash -162583371, now seen corresponding path program 1 times [2024-10-11 10:49:23,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:49:23,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364710725] [2024-10-11 10:49:23,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:49:23,454 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:49:23,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:49:23,457 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:49:23,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 10:49:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:23,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:49:23,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:49:23,797 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-11 10:49:23,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:49:23,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:49:23,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364710725] [2024-10-11 10:49:23,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364710725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:49:23,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:49:23,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:49:23,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230348020] [2024-10-11 10:49:23,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:49:23,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:49:23,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:49:23,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:49:23,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:49:23,833 INFO L87 Difference]: Start difference. First operand has 48 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 10:49:24,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:49:24,022 INFO L93 Difference]: Finished difference Result 93 states and 161 transitions. [2024-10-11 10:49:24,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:49:24,035 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 105 [2024-10-11 10:49:24,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:49:24,042 INFO L225 Difference]: With dead ends: 93 [2024-10-11 10:49:24,042 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 10:49:24,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:49:24,048 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:49:24,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:49:24,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 10:49:24,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-11 10:49:24,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 10:49:24,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2024-10-11 10:49:24,084 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 105 [2024-10-11 10:49:24,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:49:24,085 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2024-10-11 10:49:24,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 10:49:24,085 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2024-10-11 10:49:24,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 10:49:24,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:49:24,087 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:49:24,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 10:49:24,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:49:24,292 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:49:24,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:49:24,293 INFO L85 PathProgramCache]: Analyzing trace with hash 529998271, now seen corresponding path program 1 times [2024-10-11 10:49:24,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:49:24,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095321482] [2024-10-11 10:49:24,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:49:24,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:49:24,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:49:24,300 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:49:24,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 10:49:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:24,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 10:49:24,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:49:24,853 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 10:49:24,854 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:49:24,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:49:24,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095321482] [2024-10-11 10:49:24,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095321482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:49:24,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:49:24,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:49:24,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325507814] [2024-10-11 10:49:24,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:49:24,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:49:24,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:49:24,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:49:24,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:49:24,865 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 10:49:25,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:49:25,392 INFO L93 Difference]: Finished difference Result 137 states and 203 transitions. [2024-10-11 10:49:25,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:49:25,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 105 [2024-10-11 10:49:25,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:49:25,406 INFO L225 Difference]: With dead ends: 137 [2024-10-11 10:49:25,406 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 10:49:25,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:49:25,408 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 36 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:49:25,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 251 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 10:49:25,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 10:49:25,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2024-10-11 10:49:25,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 10:49:25,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 118 transitions. [2024-10-11 10:49:25,439 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 118 transitions. Word has length 105 [2024-10-11 10:49:25,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:49:25,440 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 118 transitions. [2024-10-11 10:49:25,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 10:49:25,441 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 118 transitions. [2024-10-11 10:49:25,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 10:49:25,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:49:25,443 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:49:25,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 10:49:25,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:49:25,647 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:49:25,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:49:25,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1245009091, now seen corresponding path program 1 times [2024-10-11 10:49:25,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:49:25,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513760278] [2024-10-11 10:49:25,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:49:25,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:49:25,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:49:25,654 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:49:25,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 10:49:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:49:25,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 10:49:25,838 INFO L278 TraceCheckSpWp]: Computing forward predicates...