./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3399d68d5f538e178264c8cc09444ea6c28026f61fb8e4808b455fab52f2fa4f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:42:12,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:42:13,035 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:42:13,042 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:42:13,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:42:13,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:42:13,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:42:13,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:42:13,081 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:42:13,082 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:42:13,082 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:42:13,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:42:13,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:42:13,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:42:13,104 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:42:13,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:42:13,105 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:42:13,105 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:42:13,105 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:42:13,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:42:13,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:42:13,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:42:13,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:42:13,111 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:42:13,111 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:42:13,111 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:42:13,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:42:13,112 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:42:13,112 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:42:13,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:42:13,113 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:42:13,113 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:42:13,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:42:13,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:42:13,114 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:42:13,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:42:13,115 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:42:13,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:42:13,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:42:13,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:42:13,115 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:42:13,116 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:42:13,116 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3399d68d5f538e178264c8cc09444ea6c28026f61fb8e4808b455fab52f2fa4f [2024-11-12 04:42:13,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:42:13,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:42:13,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:42:13,367 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:42:13,367 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:42:13,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i [2024-11-12 04:42:14,834 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:42:15,086 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:42:15,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i [2024-11-12 04:42:15,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c9b071c8/bb6891aad79044549c388b92afe9148c/FLAGd48b1f911 [2024-11-12 04:42:15,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c9b071c8/bb6891aad79044549c388b92afe9148c [2024-11-12 04:42:15,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:42:15,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:42:15,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:42:15,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:42:15,128 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:42:15,129 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:42:15" (1/1) ... [2024-11-12 04:42:15,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5072c197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:15, skipping insertion in model container [2024-11-12 04:42:15,130 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:42:15" (1/1) ... [2024-11-12 04:42:15,163 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:42:15,342 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i[917,930] [2024-11-12 04:42:15,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:42:15,409 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:42:15,425 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i[917,930] [2024-11-12 04:42:15,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:42:15,467 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:42:15,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:15 WrapperNode [2024-11-12 04:42:15,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:42:15,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:42:15,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:42:15,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:42:15,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:15" (1/1) ... [2024-11-12 04:42:15,485 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:15" (1/1) ... [2024-11-12 04:42:15,513 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-11-12 04:42:15,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:42:15,515 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:42:15,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:42:15,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:42:15,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:15" (1/1) ... [2024-11-12 04:42:15,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:15" (1/1) ... [2024-11-12 04:42:15,529 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:15" (1/1) ... [2024-11-12 04:42:15,549 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:42:15,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:15" (1/1) ... [2024-11-12 04:42:15,550 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:15" (1/1) ... [2024-11-12 04:42:15,555 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:15" (1/1) ... [2024-11-12 04:42:15,558 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:15" (1/1) ... [2024-11-12 04:42:15,559 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:15" (1/1) ... [2024-11-12 04:42:15,560 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:15" (1/1) ... [2024-11-12 04:42:15,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:42:15,563 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:42:15,563 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:42:15,564 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:42:15,564 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:15" (1/1) ... [2024-11-12 04:42:15,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:42:15,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:42:15,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:42:15,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:42:15,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:42:15,652 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:42:15,653 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:42:15,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:42:15,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:42:15,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:42:15,744 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:42:15,747 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:42:15,972 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 04:42:15,973 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:42:15,991 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:42:15,992 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:42:15,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:42:15 BoogieIcfgContainer [2024-11-12 04:42:15,992 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:42:15,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:42:15,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:42:16,000 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:42:16,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:42:15" (1/3) ... [2024-11-12 04:42:16,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212eece3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:42:16, skipping insertion in model container [2024-11-12 04:42:16,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:15" (2/3) ... [2024-11-12 04:42:16,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212eece3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:42:16, skipping insertion in model container [2024-11-12 04:42:16,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:42:15" (3/3) ... [2024-11-12 04:42:16,004 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-74.i [2024-11-12 04:42:16,020 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:42:16,021 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:42:16,101 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:42:16,110 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;@591d13b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:42:16,111 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:42:16,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 04:42:16,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 04:42:16,129 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:42:16,130 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:42:16,131 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:42:16,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:42:16,137 INFO L85 PathProgramCache]: Analyzing trace with hash -780075771, now seen corresponding path program 1 times [2024-11-12 04:42:16,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:42:16,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57396744] [2024-11-12 04:42:16,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:42:16,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:42:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:16,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:42:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:16,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 04:42:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:16,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 04:42:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:16,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 04:42:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:16,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 04:42:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:16,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 04:42:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:16,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-12 04:42:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:16,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 04:42:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:16,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-12 04:42:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:16,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 04:42:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:16,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 04:42:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:16,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 04:42:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:16,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 04:42:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:16,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 04:42:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:16,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 04:42:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:16,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 04:42:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:16,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 04:42:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:16,542 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 04:42:16,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:42:16,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57396744] [2024-11-12 04:42:16,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57396744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:42:16,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:42:16,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:42:16,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874474386] [2024-11-12 04:42:16,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:42:16,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:42:16,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:42:16,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:42:16,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:42:16,607 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 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), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 04:42:16,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:42:16,674 INFO L93 Difference]: Finished difference Result 101 states and 169 transitions. [2024-11-12 04:42:16,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:42:16,677 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), 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 109 [2024-11-12 04:42:16,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:42:16,688 INFO L225 Difference]: With dead ends: 101 [2024-11-12 04:42:16,689 INFO L226 Difference]: Without dead ends: 50 [2024-11-12 04:42:16,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:42:16,701 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:42:16,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:42:16,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-12 04:42:16,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-12 04:42:16,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 04:42:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2024-11-12 04:42:16,741 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 109 [2024-11-12 04:42:16,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:42:16,742 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2024-11-12 04:42:16,742 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), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 04:42:16,742 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2024-11-12 04:42:16,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 04:42:16,745 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:42:16,746 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:42:16,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:42:16,746 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:42:16,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:42:16,747 INFO L85 PathProgramCache]: Analyzing trace with hash -784881349, now seen corresponding path program 1 times [2024-11-12 04:42:16,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:42:16,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606121135] [2024-11-12 04:42:16,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:42:16,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:42:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:17,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:42:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:17,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 04:42:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:17,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 04:42:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:17,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 04:42:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:17,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 04:42:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:17,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 04:42:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:17,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-12 04:42:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:17,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 04:42:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:17,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-12 04:42:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:17,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 04:42:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:17,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 04:42:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:17,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 04:42:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:17,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 04:42:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:17,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 04:42:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:17,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 04:42:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:17,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 04:42:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:17,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 04:42:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:17,386 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 04:42:17,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:42:17,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606121135] [2024-11-12 04:42:17,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606121135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:42:17,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:42:17,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 04:42:17,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187806441] [2024-11-12 04:42:17,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:42:17,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 04:42:17,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:42:17,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 04:42:17,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:42:17,394 INFO L87 Difference]: Start difference. First operand 50 states and 72 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-11-12 04:42:17,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:42:17,681 INFO L93 Difference]: Finished difference Result 145 states and 211 transitions. [2024-11-12 04:42:17,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 04:42:17,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 109 [2024-11-12 04:42:17,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:42:17,685 INFO L225 Difference]: With dead ends: 145 [2024-11-12 04:42:17,687 INFO L226 Difference]: Without dead ends: 98 [2024-11-12 04:42:17,688 INFO L434 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-11-12 04:42:17,690 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 42 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:42:17,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 230 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:42:17,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-12 04:42:17,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2024-11-12 04:42:17,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 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-11-12 04:42:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 123 transitions. [2024-11-12 04:42:17,710 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 123 transitions. Word has length 109 [2024-11-12 04:42:17,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:42:17,712 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 123 transitions. [2024-11-12 04:42:17,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-11-12 04:42:17,713 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 123 transitions. [2024-11-12 04:42:17,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 04:42:17,717 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:42:17,717 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:42:17,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 04:42:17,717 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:42:17,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:42:17,718 INFO L85 PathProgramCache]: Analyzing trace with hash 24465277, now seen corresponding path program 1 times [2024-11-12 04:42:17,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:42:17,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051736504] [2024-11-12 04:42:17,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:42:17,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:42:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:42:17,871 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 04:42:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:42:18,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 04:42:18,027 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 04:42:18,028 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:42:18,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 04:42:18,033 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 04:42:18,113 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:42:18,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:42:18 BoogieIcfgContainer [2024-11-12 04:42:18,121 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:42:18,122 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:42:18,122 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:42:18,122 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:42:18,123 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:42:15" (3/4) ... [2024-11-12 04:42:18,125 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 04:42:18,126 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:42:18,127 INFO L158 Benchmark]: Toolchain (without parser) took 3009.19ms. Allocated memory is still 186.6MB. Free memory was 118.5MB in the beginning and 109.4MB in the end (delta: 9.0MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2024-11-12 04:42:18,129 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory was 74.5MB in the beginning and 74.3MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:42:18,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.14ms. Allocated memory is still 186.6MB. Free memory was 118.2MB in the beginning and 103.7MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 04:42:18,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.03ms. Allocated memory is still 186.6MB. Free memory was 103.7MB in the beginning and 101.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:42:18,130 INFO L158 Benchmark]: Boogie Preprocessor took 47.08ms. Allocated memory is still 186.6MB. Free memory was 101.4MB in the beginning and 98.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:42:18,131 INFO L158 Benchmark]: RCFGBuilder took 429.32ms. Allocated memory is still 186.6MB. Free memory was 98.8MB in the beginning and 147.9MB in the end (delta: -49.1MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2024-11-12 04:42:18,131 INFO L158 Benchmark]: TraceAbstraction took 2125.32ms. Allocated memory is still 186.6MB. Free memory was 147.1MB in the beginning and 109.4MB in the end (delta: 37.6MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. [2024-11-12 04:42:18,135 INFO L158 Benchmark]: Witness Printer took 4.77ms. Allocated memory is still 186.6MB. Free memory is still 109.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:42:18,136 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory was 74.5MB in the beginning and 74.3MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.14ms. Allocated memory is still 186.6MB. Free memory was 118.2MB in the beginning and 103.7MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.03ms. Allocated memory is still 186.6MB. Free memory was 103.7MB in the beginning and 101.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.08ms. Allocated memory is still 186.6MB. Free memory was 101.4MB in the beginning and 98.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 429.32ms. Allocated memory is still 186.6MB. Free memory was 98.8MB in the beginning and 147.9MB in the end (delta: -49.1MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2125.32ms. Allocated memory is still 186.6MB. Free memory was 147.1MB in the beginning and 109.4MB in the end (delta: 37.6MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. * Witness Printer took 4.77ms. Allocated memory is still 186.6MB. Free memory is still 109.4MB. 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; VAL [isInitial=0, 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_2=253/4, 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] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L101] last_1_var_1_16 = var_1_16 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_2=253/4, 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] [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=4294967299, 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=4294967299, 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=4294967299, 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=4294967299, var_1_7=-2147483645, 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=4294967299, var_1_7=-2147483645, 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=4294967299, var_1_7=-2147483645, 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=4294967299, var_1_7=-2147483645, 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=4294967299, var_1_7=-2147483645, 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=4294967299, var_1_7=-2147483645, 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=4294967299, var_1_7=-2147483645, 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=4294967299, var_1_7=-2147483645, 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=4294967299, var_1_7=-2147483645, 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=4294967299, var_1_7=-2147483645, var_1_8=-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=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, 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=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, 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=4294967299, var_1_7=-2147483645, var_1_8=-2147483649] [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=4294967299, var_1_7=-2147483645, var_1_8=-2147483649] [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=4294967299, var_1_7=-2147483645, var_1_8=-2147483649] [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=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, 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=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, 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=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, 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=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, 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=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, 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=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, 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=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, 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=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, 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=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, 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=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, 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=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, 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=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, 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=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, 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=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, 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=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, 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=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, 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=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, 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=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, 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=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, 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=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, 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=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, 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=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, 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=4, var_1_6=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, 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))) ; VAL [\result=0, 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=4, var_1_6=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, var_1_9=4294967294] [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=4, var_1_6=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, 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=4, var_1_6=4294967299, var_1_7=-2147483645, var_1_8=-2147483649, var_1_9=4294967294] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 3, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 302 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 162 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52 IncrementalHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 140 mSDtfsCounter, 52 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=85occurred 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.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 286 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-11-12 04:42:18,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3399d68d5f538e178264c8cc09444ea6c28026f61fb8e4808b455fab52f2fa4f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:42:20,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:42:20,431 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 04:42:20,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:42:20,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:42:20,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:42:20,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:42:20,468 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:42:20,469 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:42:20,473 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:42:20,473 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:42:20,473 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:42:20,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:42:20,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:42:20,475 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:42:20,476 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:42:20,476 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:42:20,476 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:42:20,476 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:42:20,477 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:42:20,477 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:42:20,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:42:20,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:42:20,478 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 04:42:20,479 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 04:42:20,479 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:42:20,479 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 04:42:20,479 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:42:20,480 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:42:20,480 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:42:20,480 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:42:20,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:42:20,480 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:42:20,481 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:42:20,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:42:20,482 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:42:20,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:42:20,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:42:20,483 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 04:42:20,483 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 04:42:20,484 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:42:20,484 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:42:20,484 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:42:20,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:42:20,485 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3399d68d5f538e178264c8cc09444ea6c28026f61fb8e4808b455fab52f2fa4f [2024-11-12 04:42:20,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:42:20,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:42:20,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:42:20,839 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:42:20,839 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:42:20,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i [2024-11-12 04:42:22,493 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:42:22,681 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:42:22,682 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i [2024-11-12 04:42:22,694 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c348b3c9c/65f694fbd29647879b467825c5a9648f/FLAGdc739613c [2024-11-12 04:42:22,711 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c348b3c9c/65f694fbd29647879b467825c5a9648f [2024-11-12 04:42:22,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:42:22,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:42:22,718 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:42:22,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:42:22,725 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:42:22,726 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:42:22" (1/1) ... [2024-11-12 04:42:22,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50b811c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:22, skipping insertion in model container [2024-11-12 04:42:22,727 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:42:22" (1/1) ... [2024-11-12 04:42:22,755 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:42:22,958 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i[917,930] [2024-11-12 04:42:23,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:42:23,039 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:42:23,053 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i[917,930] [2024-11-12 04:42:23,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:42:23,106 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:42:23,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:23 WrapperNode [2024-11-12 04:42:23,106 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:42:23,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:42:23,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:42:23,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:42:23,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:23" (1/1) ... [2024-11-12 04:42:23,130 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:23" (1/1) ... [2024-11-12 04:42:23,163 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-11-12 04:42:23,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:42:23,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:42:23,166 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:42:23,166 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:42:23,177 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:23" (1/1) ... [2024-11-12 04:42:23,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:23" (1/1) ... [2024-11-12 04:42:23,181 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:23" (1/1) ... [2024-11-12 04:42:23,192 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:42:23,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:23" (1/1) ... [2024-11-12 04:42:23,193 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:23" (1/1) ... [2024-11-12 04:42:23,200 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:23" (1/1) ... [2024-11-12 04:42:23,206 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:23" (1/1) ... [2024-11-12 04:42:23,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:23" (1/1) ... [2024-11-12 04:42:23,212 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:23" (1/1) ... [2024-11-12 04:42:23,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:42:23,219 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:42:23,222 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:42:23,222 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:42:23,223 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:23" (1/1) ... [2024-11-12 04:42:23,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:42:23,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:42:23,264 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:42:23,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:42:23,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:42:23,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 04:42:23,311 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:42:23,311 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:42:23,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:42:23,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:42:23,391 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:42:23,394 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:42:24,269 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 04:42:24,270 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:42:24,288 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:42:24,288 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:42:24,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:42:24 BoogieIcfgContainer [2024-11-12 04:42:24,289 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:42:24,292 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:42:24,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:42:24,296 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:42:24,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:42:22" (1/3) ... [2024-11-12 04:42:24,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d67b54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:42:24, skipping insertion in model container [2024-11-12 04:42:24,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:23" (2/3) ... [2024-11-12 04:42:24,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d67b54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:42:24, skipping insertion in model container [2024-11-12 04:42:24,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:42:24" (3/3) ... [2024-11-12 04:42:24,299 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-74.i [2024-11-12 04:42:24,315 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:42:24,316 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:42:24,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:42:24,385 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;@d0301c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:42:24,385 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:42:24,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 04:42:24,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 04:42:24,404 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:42:24,405 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:42:24,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:42:24,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:42:24,411 INFO L85 PathProgramCache]: Analyzing trace with hash -780075771, now seen corresponding path program 1 times [2024-11-12 04:42:24,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:42:24,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060193247] [2024-11-12 04:42:24,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:42:24,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:42:24,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:42:24,426 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:42:24,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 04:42:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:24,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 04:42:24,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:42:24,750 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-12 04:42:24,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:42:24,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:42:24,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060193247] [2024-11-12 04:42:24,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060193247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:42:24,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:42:24,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:42:24,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095839838] [2024-11-12 04:42:24,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:42:24,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:42:24,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:42:24,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:42:24,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:42:24,793 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 04:42:24,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:42:24,815 INFO L93 Difference]: Finished difference Result 101 states and 169 transitions. [2024-11-12 04:42:24,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:42:24,817 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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 109 [2024-11-12 04:42:24,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:42:24,823 INFO L225 Difference]: With dead ends: 101 [2024-11-12 04:42:24,823 INFO L226 Difference]: Without dead ends: 50 [2024-11-12 04:42:24,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:42:24,829 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:42:24,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:42:24,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-12 04:42:24,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-12 04:42:24,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 04:42:24,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2024-11-12 04:42:24,872 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 109 [2024-11-12 04:42:24,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:42:24,872 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2024-11-12 04:42:24,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 04:42:24,873 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2024-11-12 04:42:24,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 04:42:24,876 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:42:24,876 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:42:24,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 04:42:25,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:42:25,077 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:42:25,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:42:25,078 INFO L85 PathProgramCache]: Analyzing trace with hash -784881349, now seen corresponding path program 1 times [2024-11-12 04:42:25,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:42:25,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652140579] [2024-11-12 04:42:25,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:42:25,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:42:25,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:42:25,081 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:42:25,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 04:42:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:25,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 04:42:25,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:42:25,695 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 04:42:25,697 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:42:25,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:42:25,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652140579] [2024-11-12 04:42:25,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652140579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:42:25,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:42:25,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 04:42:25,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684929363] [2024-11-12 04:42:25,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:42:25,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 04:42:25,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:42:25,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 04:42:25,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:42:25,704 INFO L87 Difference]: Start difference. First operand 50 states and 72 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-11-12 04:42:26,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:42:26,200 INFO L93 Difference]: Finished difference Result 145 states and 211 transitions. [2024-11-12 04:42:26,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 04:42:26,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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 109 [2024-11-12 04:42:26,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:42:26,210 INFO L225 Difference]: With dead ends: 145 [2024-11-12 04:42:26,210 INFO L226 Difference]: Without dead ends: 98 [2024-11-12 04:42:26,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 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-11-12 04:42:26,212 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 40 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 04:42:26,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 265 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 04:42:26,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-12 04:42:26,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2024-11-12 04:42:26,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 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-11-12 04:42:26,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 123 transitions. [2024-11-12 04:42:26,234 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 123 transitions. Word has length 109 [2024-11-12 04:42:26,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:42:26,235 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 123 transitions. [2024-11-12 04:42:26,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-11-12 04:42:26,235 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 123 transitions. [2024-11-12 04:42:26,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 04:42:26,237 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:42:26,237 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:42:26,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 04:42:26,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:42:26,438 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:42:26,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:42:26,439 INFO L85 PathProgramCache]: Analyzing trace with hash 24465277, now seen corresponding path program 1 times [2024-11-12 04:42:26,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:42:26,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887519557] [2024-11-12 04:42:26,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:42:26,440 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:42:26,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:42:26,441 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:42:26,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 04:42:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:26,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 04:42:26,666 INFO L279 TraceCheckSpWp]: Computing forward predicates...