./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/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-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:30:15,536 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:30:15,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:30:15,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:30:15,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:30:15,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:30:15,638 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:30:15,638 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:30:15,639 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:30:15,639 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:30:15,640 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:30:15,641 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:30:15,641 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:30:15,642 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:30:15,642 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:30:15,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:30:15,644 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:30:15,645 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:30:15,645 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:30:15,645 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:30:15,646 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:30:15,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:30:15,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:30:15,650 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:30:15,650 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:30:15,650 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:30:15,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:30:15,651 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:30:15,651 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:30:15,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:30:15,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:30:15,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:30:15,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:30:15,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:30:15,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:30:15,662 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:30:15,663 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:30:15,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:30:15,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:30:15,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:30:15,664 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:30:15,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:30:15,666 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-10-13 03:30:15,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:30:15,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:30:15,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:30:15,960 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:30:15,960 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:30:15,962 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i [2024-10-13 03:30:17,387 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:30:17,607 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:30:17,607 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i [2024-10-13 03:30:17,615 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7130c9889/852d8835d6604c509a08c30f9c67f4fa/FLAGfa3b34a06 [2024-10-13 03:30:17,993 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7130c9889/852d8835d6604c509a08c30f9c67f4fa [2024-10-13 03:30:17,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:30:17,997 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:30:17,998 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:30:17,998 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:30:18,003 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:30:18,003 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:30:17" (1/1) ... [2024-10-13 03:30:18,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d88f309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:18, skipping insertion in model container [2024-10-13 03:30:18,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:30:17" (1/1) ... [2024-10-13 03:30:18,043 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:30:18,212 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i[917,930] [2024-10-13 03:30:18,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:30:18,265 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:30:18,275 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i[917,930] [2024-10-13 03:30:18,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:30:18,315 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:30:18,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:18 WrapperNode [2024-10-13 03:30:18,316 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:30:18,317 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:30:18,317 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:30:18,317 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:30:18,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:18" (1/1) ... [2024-10-13 03:30:18,332 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:18" (1/1) ... [2024-10-13 03:30:18,356 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-10-13 03:30:18,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:30:18,360 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:30:18,360 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:30:18,360 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:30:18,368 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:18" (1/1) ... [2024-10-13 03:30:18,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:18" (1/1) ... [2024-10-13 03:30:18,370 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:18" (1/1) ... [2024-10-13 03:30:18,381 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 03:30:18,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:18" (1/1) ... [2024-10-13 03:30:18,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:18" (1/1) ... [2024-10-13 03:30:18,387 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:18" (1/1) ... [2024-10-13 03:30:18,389 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:18" (1/1) ... [2024-10-13 03:30:18,391 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:18" (1/1) ... [2024-10-13 03:30:18,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:18" (1/1) ... [2024-10-13 03:30:18,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:30:18,395 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:30:18,395 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:30:18,395 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:30:18,396 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:18" (1/1) ... [2024-10-13 03:30:18,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:30:18,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:30:18,436 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:30:18,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:30:18,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:30:18,483 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:30:18,484 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:30:18,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:30:18,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:30:18,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:30:18,626 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:30:18,628 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:30:18,894 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 03:30:18,894 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:30:18,938 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:30:18,938 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:30:18,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:30:18 BoogieIcfgContainer [2024-10-13 03:30:18,939 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:30:18,941 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:30:18,941 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:30:18,944 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:30:18,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:30:17" (1/3) ... [2024-10-13 03:30:18,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0db5a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:30:18, skipping insertion in model container [2024-10-13 03:30:18,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:18" (2/3) ... [2024-10-13 03:30:18,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0db5a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:30:18, skipping insertion in model container [2024-10-13 03:30:18,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:30:18" (3/3) ... [2024-10-13 03:30:18,947 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-74.i [2024-10-13 03:30:18,963 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:30:18,963 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:30:19,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:30:19,047 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;@27d11251, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:30:19,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:30:19,051 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 03:30:19,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 03:30:19,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:30:19,066 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:30:19,066 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:30:19,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:30:19,074 INFO L85 PathProgramCache]: Analyzing trace with hash -162583371, now seen corresponding path program 1 times [2024-10-13 03:30:19,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:30:19,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712499309] [2024-10-13 03:30:19,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:30:19,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:30:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:19,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:30:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:19,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 03:30:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:19,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 03:30:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:19,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 03:30:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:19,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 03:30:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:19,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 03:30:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:19,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 03:30:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:19,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 03:30:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:19,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 03:30:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:19,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:30:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:19,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:30:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:19,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 03:30:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:19,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 03:30:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:19,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 03:30:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:19,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 03:30:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:19,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 03:30:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:19,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 03:30:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:19,484 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 03:30:19,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:30:19,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712499309] [2024-10-13 03:30:19,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712499309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:30:19,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:30:19,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:30:19,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224375493] [2024-10-13 03:30:19,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:30:19,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:30:19,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:30:19,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:30:19,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:30:19,520 INFO L87 Difference]: Start difference. First operand has 48 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 03:30:19,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:30:19,562 INFO L93 Difference]: Finished difference Result 93 states and 161 transitions. [2024-10-13 03:30:19,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:30:19,566 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 105 [2024-10-13 03:30:19,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:30:19,574 INFO L225 Difference]: With dead ends: 93 [2024-10-13 03:30:19,574 INFO L226 Difference]: Without dead ends: 46 [2024-10-13 03:30:19,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:30:19,582 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:30:19,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:30:19,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-13 03:30:19,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-13 03:30:19,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 03:30:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2024-10-13 03:30:19,636 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 105 [2024-10-13 03:30:19,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:30:19,636 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2024-10-13 03:30:19,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 03:30:19,637 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2024-10-13 03:30:19,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 03:30:19,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:30:19,641 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:30:19,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:30:19,641 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:30:19,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:30:19,642 INFO L85 PathProgramCache]: Analyzing trace with hash 529998271, now seen corresponding path program 1 times [2024-10-13 03:30:19,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:30:19,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080513741] [2024-10-13 03:30:19,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:30:19,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:30:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:20,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:30:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:20,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 03:30:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:20,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 03:30:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:20,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 03:30:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:20,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 03:30:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:20,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 03:30:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:20,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 03:30:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:20,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 03:30:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:20,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 03:30:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:20,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:30:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:20,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:30:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:20,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 03:30:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:20,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 03:30:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:20,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 03:30:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:20,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 03:30:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:20,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 03:30:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:20,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 03:30:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:20,270 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 03:30:20,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:30:20,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080513741] [2024-10-13 03:30:20,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080513741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:30:20,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:30:20,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 03:30:20,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742525884] [2024-10-13 03:30:20,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:30:20,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:30:20,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:30:20,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:30:20,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:30:20,277 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 03:30:20,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:30:20,456 INFO L93 Difference]: Finished difference Result 137 states and 203 transitions. [2024-10-13 03:30:20,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 03:30:20,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 105 [2024-10-13 03:30:20,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:30:20,459 INFO L225 Difference]: With dead ends: 137 [2024-10-13 03:30:20,460 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 03:30:20,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:30:20,461 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 38 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:30:20,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 217 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:30:20,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 03:30:20,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2024-10-13 03:30:20,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 03:30:20,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 118 transitions. [2024-10-13 03:30:20,493 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 118 transitions. Word has length 105 [2024-10-13 03:30:20,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:30:20,494 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 118 transitions. [2024-10-13 03:30:20,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 03:30:20,495 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 118 transitions. [2024-10-13 03:30:20,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 03:30:20,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:30:20,497 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:30:20,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:30:20,497 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:30:20,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:30:20,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1245009091, now seen corresponding path program 1 times [2024-10-13 03:30:20,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:30:20,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827993775] [2024-10-13 03:30:20,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:30:20,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:30:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:30:20,654 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:30:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:30:20,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 03:30:20,782 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 03:30:20,784 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:30:20,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:30:20,788 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 03:30:20,873 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:30:20,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:30:20 BoogieIcfgContainer [2024-10-13 03:30:20,877 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:30:20,878 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:30:20,878 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:30:20,878 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:30:20,878 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:30:18" (3/4) ... [2024-10-13 03:30:20,880 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 03:30:20,882 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:30:20,885 INFO L158 Benchmark]: Toolchain (without parser) took 2885.44ms. Allocated memory was 157.3MB in the beginning and 199.2MB in the end (delta: 41.9MB). Free memory was 124.4MB in the beginning and 143.1MB in the end (delta: -18.8MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-10-13 03:30:20,886 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 157.3MB. Free memory was 127.3MB in the beginning and 127.1MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:30:20,886 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.51ms. Allocated memory is still 157.3MB. Free memory was 124.4MB in the beginning and 109.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 03:30:20,886 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.20ms. Allocated memory is still 157.3MB. Free memory was 109.7MB in the beginning and 107.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 03:30:20,887 INFO L158 Benchmark]: Boogie Preprocessor took 33.97ms. Allocated memory is still 157.3MB. Free memory was 107.7MB in the beginning and 104.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 03:30:20,887 INFO L158 Benchmark]: RCFGBuilder took 544.44ms. Allocated memory is still 157.3MB. Free memory was 104.9MB in the beginning and 114.7MB in the end (delta: -9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 03:30:20,887 INFO L158 Benchmark]: TraceAbstraction took 1936.49ms. Allocated memory was 157.3MB in the beginning and 199.2MB in the end (delta: 41.9MB). Free memory was 114.0MB in the beginning and 143.1MB in the end (delta: -29.2MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2024-10-13 03:30:20,888 INFO L158 Benchmark]: Witness Printer took 3.98ms. Allocated memory is still 199.2MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:30:20,895 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 157.3MB. Free memory was 127.3MB in the beginning and 127.1MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.51ms. Allocated memory is still 157.3MB. Free memory was 124.4MB in the beginning and 109.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.20ms. Allocated memory is still 157.3MB. Free memory was 109.7MB in the beginning and 107.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.97ms. Allocated memory is still 157.3MB. Free memory was 107.7MB in the beginning and 104.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 544.44ms. Allocated memory is still 157.3MB. Free memory was 104.9MB in the beginning and 114.7MB in the end (delta: -9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1936.49ms. Allocated memory was 157.3MB in the beginning and 199.2MB in the end (delta: 41.9MB). Free memory was 114.0MB in the beginning and 143.1MB in the end (delta: -29.2MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * Witness Printer took 3.98ms. Allocated memory is still 199.2MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 25; [L23] double var_1_2 = 63.25; [L24] double var_1_3 = 3.779; [L25] double var_1_4 = 31.6; [L26] double var_1_5 = 100.5; [L27] unsigned long int var_1_6 = 64; [L28] unsigned long int var_1_7 = 3150951169; [L29] unsigned long int var_1_8 = 128; [L30] unsigned long int var_1_9 = 1; [L31] unsigned char var_1_10 = 1; [L32] double var_1_11 = 9.3; [L33] unsigned char var_1_14 = 0; [L34] unsigned char var_1_15 = 1; [L35] unsigned char var_1_16 = 1; [L36] unsigned char last_1_var_1_16 = 1; [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L101] last_1_var_1_16 = var_1_16 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L72] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L73] var_1_3 = __VERIFIER_nondet_double() [L74] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L74] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L75] var_1_4 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L76] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L77] var_1_5 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L78] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L79] var_1_6 = __VERIFIER_nondet_ulong() [L80] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L80] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L81] CALL assume_abort_if_not(var_1_6 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L81] RET assume_abort_if_not(var_1_6 <= 4294967294) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L82] var_1_7 = __VERIFIER_nondet_ulong() [L83] CALL assume_abort_if_not(var_1_7 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=128, var_1_9=1] [L83] RET assume_abort_if_not(var_1_7 >= 2147483647) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=128, var_1_9=1] [L84] CALL assume_abort_if_not(var_1_7 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=128, var_1_9=1] [L84] RET assume_abort_if_not(var_1_7 <= 4294967294) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=128, var_1_9=1] [L85] var_1_8 = __VERIFIER_nondet_ulong() [L86] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_9=1] [L86] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_9=1] [L87] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=1] [L87] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=1] [L88] var_1_9 = __VERIFIER_nondet_ulong() [L89] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1] [L89] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1] [L90] CALL assume_abort_if_not(var_1_9 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L90] RET assume_abort_if_not(var_1_9 <= 4294967294) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L91] var_1_11 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L92] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L93] var_1_14 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L94] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L95] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L95] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L96] var_1_15 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=-255, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=-255, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L97] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=-255, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L98] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=-255, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=-255, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L98] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=-255, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L112] RET updateVariables() [L113] CALL step() [L40] unsigned char stepLocal_0 = last_1_var_1_16 && last_1_var_1_16; VAL [isInitial=1, last_1_var_1_16=1, stepLocal_0=1, var_1_10=1, var_1_14=0, var_1_15=-255, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L41] COND TRUE (var_1_5 > var_1_11) || stepLocal_0 [L42] var_1_10 = var_1_14 VAL [isInitial=1, last_1_var_1_16=1, var_1_10=0, var_1_14=0, var_1_15=-255, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L46] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_16=1, stepLocal_1=0, var_1_10=0, var_1_14=0, var_1_15=-255, var_1_16=1, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L47] COND FALSE !(stepLocal_1 && var_1_10) [L54] var_1_16 = var_1_15 VAL [isInitial=1, last_1_var_1_16=1, var_1_10=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_1=25, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L56] COND TRUE ((((((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) < (var_1_4)) ? (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) : (var_1_4))) < var_1_5 [L57] var_1_1 = ((((var_1_6) > ((var_1_7 - var_1_8))) ? (var_1_6) : ((var_1_7 - var_1_8)))) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_1=-2147483650, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L113] RET step() [L114] CALL, EXPR property() [L104-L105] return (((((((((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) < (var_1_4)) ? (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) : (var_1_4))) < var_1_5) ? (var_1_1 == ((unsigned long int) ((((var_1_6) > ((var_1_7 - var_1_8))) ? (var_1_6) : ((var_1_7 - var_1_8)))))) : ((var_1_2 >= (var_1_3 + var_1_5)) ? ((var_1_4 > (- var_1_5)) ? (var_1_1 == ((unsigned long int) var_1_6)) : (var_1_1 == ((unsigned long int) var_1_9))) : (var_1_1 == ((unsigned long int) var_1_6)))) && (((var_1_5 > var_1_11) || (last_1_var_1_16 && last_1_var_1_16)) ? (var_1_10 == ((unsigned char) var_1_14)) : (var_1_10 == ((unsigned char) (var_1_14 && (! var_1_15)))))) && ((var_1_10 && var_1_10) ? ((var_1_4 < (- var_1_5)) ? (var_1_16 == ((unsigned char) var_1_15)) : (var_1_16 == ((unsigned char) var_1_15))) : (var_1_16 == ((unsigned char) var_1_15))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_1=-2147483650, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=1, var_1_10=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_1=-2147483650, var_1_6=-2147483651, var_1_7=-2147483649, var_1_8=1, var_1_9=4294967294] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 282 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 154 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 56 IncrementalHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 128 mSDtfsCounter, 56 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 272 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1088/1088 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 03:30:20,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/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-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:30:23,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:30:23,118 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 03:30:23,122 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:30:23,123 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:30:23,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:30:23,153 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:30:23,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:30:23,154 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:30:23,155 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:30:23,155 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:30:23,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:30:23,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:30:23,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:30:23,157 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:30:23,157 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:30:23,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:30:23,158 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:30:23,158 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:30:23,158 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:30:23,159 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:30:23,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:30:23,159 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:30:23,160 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 03:30:23,160 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 03:30:23,160 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:30:23,161 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 03:30:23,161 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:30:23,161 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:30:23,162 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:30:23,162 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:30:23,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:30:23,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:30:23,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:30:23,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:30:23,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:30:23,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:30:23,164 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:30:23,165 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 03:30:23,165 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 03:30:23,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:30:23,167 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:30:23,167 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:30:23,168 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:30:23,168 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 03:30:23,168 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-10-13 03:30:23,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:30:23,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:30:23,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:30:23,521 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:30:23,521 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:30:23,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i [2024-10-13 03:30:24,984 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:30:25,208 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:30:25,208 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i [2024-10-13 03:30:25,218 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d22ca36e/8253c72a96aa4a87a77ebce9a8c3cc66/FLAG4c713dd2f [2024-10-13 03:30:25,570 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d22ca36e/8253c72a96aa4a87a77ebce9a8c3cc66 [2024-10-13 03:30:25,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:30:25,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:30:25,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:30:25,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:30:25,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:30:25,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:30:25" (1/1) ... [2024-10-13 03:30:25,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74b26955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:25, skipping insertion in model container [2024-10-13 03:30:25,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:30:25" (1/1) ... [2024-10-13 03:30:25,614 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:30:25,788 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i[917,930] [2024-10-13 03:30:25,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:30:25,871 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:30:25,885 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-74.i[917,930] [2024-10-13 03:30:25,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:30:25,943 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:30:25,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:25 WrapperNode [2024-10-13 03:30:25,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:30:25,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:30:25,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:30:25,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:30:25,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:25" (1/1) ... [2024-10-13 03:30:25,969 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:25" (1/1) ... [2024-10-13 03:30:26,008 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-10-13 03:30:26,009 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:30:26,010 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:30:26,010 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:30:26,010 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:30:26,019 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:25" (1/1) ... [2024-10-13 03:30:26,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:25" (1/1) ... [2024-10-13 03:30:26,022 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:25" (1/1) ... [2024-10-13 03:30:26,033 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 03:30:26,033 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:25" (1/1) ... [2024-10-13 03:30:26,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:25" (1/1) ... [2024-10-13 03:30:26,045 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:25" (1/1) ... [2024-10-13 03:30:26,048 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:25" (1/1) ... [2024-10-13 03:30:26,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:25" (1/1) ... [2024-10-13 03:30:26,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:25" (1/1) ... [2024-10-13 03:30:26,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:30:26,063 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:30:26,063 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:30:26,063 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:30:26,064 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:25" (1/1) ... [2024-10-13 03:30:26,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:30:26,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:30:26,096 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:30:26,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:30:26,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:30:26,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 03:30:26,132 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:30:26,132 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:30:26,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:30:26,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:30:26,205 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:30:26,207 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:30:26,894 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 03:30:26,895 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:30:26,954 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:30:26,955 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:30:26,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:30:26 BoogieIcfgContainer [2024-10-13 03:30:26,955 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:30:26,958 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:30:26,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:30:26,962 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:30:26,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:30:25" (1/3) ... [2024-10-13 03:30:26,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5851def1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:30:26, skipping insertion in model container [2024-10-13 03:30:26,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:30:25" (2/3) ... [2024-10-13 03:30:26,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5851def1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:30:26, skipping insertion in model container [2024-10-13 03:30:26,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:30:26" (3/3) ... [2024-10-13 03:30:26,966 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-74.i [2024-10-13 03:30:26,990 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:30:26,990 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:30:27,045 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:30:27,050 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;@66d41c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:30:27,050 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:30:27,054 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 03:30:27,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 03:30:27,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:30:27,066 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:30:27,066 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:30:27,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:30:27,071 INFO L85 PathProgramCache]: Analyzing trace with hash -162583371, now seen corresponding path program 1 times [2024-10-13 03:30:27,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:30:27,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844342043] [2024-10-13 03:30:27,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:30:27,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:30:27,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:30:27,083 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:30:27,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 03:30:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:27,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 03:30:27,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:30:27,381 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-13 03:30:27,382 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:30:27,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:30:27,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844342043] [2024-10-13 03:30:27,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1844342043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:30:27,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:30:27,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:30:27,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577462653] [2024-10-13 03:30:27,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:30:27,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:30:27,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:30:27,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:30:27,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:30:27,416 INFO L87 Difference]: Start difference. First operand has 48 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 03:30:27,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:30:27,575 INFO L93 Difference]: Finished difference Result 93 states and 161 transitions. [2024-10-13 03:30:27,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:30:27,584 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 105 [2024-10-13 03:30:27,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:30:27,590 INFO L225 Difference]: With dead ends: 93 [2024-10-13 03:30:27,590 INFO L226 Difference]: Without dead ends: 46 [2024-10-13 03:30:27,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:30:27,599 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:30:27,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:30:27,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-13 03:30:27,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-13 03:30:27,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 03:30:27,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2024-10-13 03:30:27,635 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 105 [2024-10-13 03:30:27,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:30:27,635 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2024-10-13 03:30:27,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 03:30:27,636 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2024-10-13 03:30:27,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 03:30:27,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:30:27,638 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:30:27,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 03:30:27,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:30:27,840 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:30:27,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:30:27,841 INFO L85 PathProgramCache]: Analyzing trace with hash 529998271, now seen corresponding path program 1 times [2024-10-13 03:30:27,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:30:27,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054918342] [2024-10-13 03:30:27,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:30:27,842 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:30:27,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:30:27,846 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:30:27,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 03:30:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:28,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 03:30:28,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:30:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 03:30:28,338 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:30:28,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:30:28,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1054918342] [2024-10-13 03:30:28,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1054918342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:30:28,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:30:28,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:30:28,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808973077] [2024-10-13 03:30:28,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:30:28,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:30:28,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:30:28,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:30:28,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:30:28,348 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 03:30:28,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:30:28,854 INFO L93 Difference]: Finished difference Result 137 states and 203 transitions. [2024-10-13 03:30:28,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 03:30:28,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 105 [2024-10-13 03:30:28,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:30:28,863 INFO L225 Difference]: With dead ends: 137 [2024-10-13 03:30:28,863 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 03:30:28,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:30:28,864 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 36 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 03:30:28,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 251 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 03:30:28,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 03:30:28,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2024-10-13 03:30:28,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 03:30:28,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 118 transitions. [2024-10-13 03:30:28,900 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 118 transitions. Word has length 105 [2024-10-13 03:30:28,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:30:28,900 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 118 transitions. [2024-10-13 03:30:28,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 03:30:28,903 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 118 transitions. [2024-10-13 03:30:28,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 03:30:28,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:30:28,904 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:30:28,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 03:30:29,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:30:29,106 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:30:29,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:30:29,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1245009091, now seen corresponding path program 1 times [2024-10-13 03:30:29,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:30:29,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161273344] [2024-10-13 03:30:29,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:30:29,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:30:29,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:30:29,110 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:30:29,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 03:30:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:30:29,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 03:30:29,293 INFO L278 TraceCheckSpWp]: Computing forward predicates...