./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-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-11.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97b1061e2cabddcb3093af5cecca71c7ed1fd9a404462e73f738c3d404d688bc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:41:23,316 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:41:23,377 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:41:23,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:41:23,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:41:23,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:41:23,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:41:23,412 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:41:23,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:41:23,414 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:41:23,414 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:41:23,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:41:23,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:41:23,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:41:23,416 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:41:23,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:41:23,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:41:23,417 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:41:23,417 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:41:23,418 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:41:23,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:41:23,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:41:23,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:41:23,420 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:41:23,421 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:41:23,421 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:41:23,421 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:41:23,421 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:41:23,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:41:23,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:41:23,422 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:41:23,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:41:23,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:41:23,422 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:41:23,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:41:23,423 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:41:23,423 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:41:23,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:41:23,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:41:23,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:41:23,424 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:41:23,425 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:41:23,425 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97b1061e2cabddcb3093af5cecca71c7ed1fd9a404462e73f738c3d404d688bc [2024-10-11 10:41:23,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:41:23,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:41:23,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:41:23,687 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:41:23,688 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:41:23,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-11.i [2024-10-11 10:41:25,044 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:41:25,226 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:41:25,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-11.i [2024-10-11 10:41:25,233 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1d4d52c9d/9e0a8bc82fe040ca9b9c45472bbf6a9b/FLAG0ce2beaab [2024-10-11 10:41:25,249 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1d4d52c9d/9e0a8bc82fe040ca9b9c45472bbf6a9b [2024-10-11 10:41:25,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:41:25,253 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:41:25,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:41:25,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:41:25,263 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:41:25,265 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:41:25" (1/1) ... [2024-10-11 10:41:25,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@577af32f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:25, skipping insertion in model container [2024-10-11 10:41:25,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:41:25" (1/1) ... [2024-10-11 10:41:25,297 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:41:25,412 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-11.i[917,930] [2024-10-11 10:41:25,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:41:25,452 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:41:25,462 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-11.i[917,930] [2024-10-11 10:41:25,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:41:25,491 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:41:25,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:25 WrapperNode [2024-10-11 10:41:25,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:41:25,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:41:25,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:41:25,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:41:25,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:25" (1/1) ... [2024-10-11 10:41:25,506 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:25" (1/1) ... [2024-10-11 10:41:25,550 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-10-11 10:41:25,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:41:25,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:41:25,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:41:25,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:41:25,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:25" (1/1) ... [2024-10-11 10:41:25,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:25" (1/1) ... [2024-10-11 10:41:25,571 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:25" (1/1) ... [2024-10-11 10:41:25,592 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:41:25,592 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:25" (1/1) ... [2024-10-11 10:41:25,592 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:25" (1/1) ... [2024-10-11 10:41:25,602 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:25" (1/1) ... [2024-10-11 10:41:25,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:25" (1/1) ... [2024-10-11 10:41:25,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:25" (1/1) ... [2024-10-11 10:41:25,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:25" (1/1) ... [2024-10-11 10:41:25,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:41:25,612 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:41:25,613 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:41:25,613 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:41:25,614 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:25" (1/1) ... [2024-10-11 10:41:25,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:41:25,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:41:25,654 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:41:25,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:41:25,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:41:25,703 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:41:25,704 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:41:25,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:41:25,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:41:25,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:41:25,772 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:41:25,776 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:41:26,061 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 10:41:26,063 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:41:26,112 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:41:26,113 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:41:26,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:41:26 BoogieIcfgContainer [2024-10-11 10:41:26,117 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:41:26,118 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:41:26,118 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:41:26,121 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:41:26,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:41:25" (1/3) ... [2024-10-11 10:41:26,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5bdfe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:41:26, skipping insertion in model container [2024-10-11 10:41:26,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:25" (2/3) ... [2024-10-11 10:41:26,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5bdfe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:41:26, skipping insertion in model container [2024-10-11 10:41:26,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:41:26" (3/3) ... [2024-10-11 10:41:26,127 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-11.i [2024-10-11 10:41:26,141 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:41:26,142 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:41:26,209 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:41:26,217 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;@1abb6c73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:41:26,218 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:41:26,222 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 10:41:26,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 10:41:26,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:41:26,234 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:41:26,234 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:41:26,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:41:26,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1788450943, now seen corresponding path program 1 times [2024-10-11 10:41:26,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:41:26,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430704388] [2024-10-11 10:41:26,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:41:26,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:41:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:26,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:41:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:26,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:41:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:26,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:41:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:26,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 10:41:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:26,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:41:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:26,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 10:41:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:26,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 10:41:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:26,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:41:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:26,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 10:41:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:26,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 10:41:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:26,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 10:41:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:26,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:41:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:26,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:41:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:26,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:41:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:26,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:41:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:26,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:41:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:26,537 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 10:41:26,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:41:26,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430704388] [2024-10-11 10:41:26,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430704388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:41:26,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:41:26,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:41:26,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424209490] [2024-10-11 10:41:26,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:41:26,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:41:26,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:41:26,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:41:26,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:41:26,570 INFO L87 Difference]: Start difference. First operand has 48 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 10:41:26,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:41:26,607 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2024-10-11 10:41:26,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:41:26,613 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 100 [2024-10-11 10:41:26,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:41:26,619 INFO L225 Difference]: With dead ends: 93 [2024-10-11 10:41:26,620 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 10:41:26,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:41:26,626 INFO L432 NwaCegarLoop]: 66 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, 66 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:41:26,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:41:26,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 10:41:26,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-11 10:41:26,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 10:41:26,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 69 transitions. [2024-10-11 10:41:26,662 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 69 transitions. Word has length 100 [2024-10-11 10:41:26,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:41:26,663 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 69 transitions. [2024-10-11 10:41:26,663 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 10:41:26,664 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2024-10-11 10:41:26,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 10:41:26,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:41:26,670 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:41:26,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:41:26,671 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:41:26,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:41:26,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1112841215, now seen corresponding path program 1 times [2024-10-11 10:41:26,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:41:26,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5680402] [2024-10-11 10:41:26,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:41:26,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:41:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:27,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:41:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:27,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:41:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:27,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:41:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:27,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 10:41:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:27,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:41:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:27,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 10:41:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:27,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 10:41:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:27,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:41:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:27,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 10:41:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:27,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 10:41:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:27,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 10:41:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:27,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:41:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:27,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:41:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:27,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:41:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:27,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:41:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:27,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:41:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:27,102 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 10:41:27,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:41:27,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5680402] [2024-10-11 10:41:27,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5680402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:41:27,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:41:27,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:41:27,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174864417] [2024-10-11 10:41:27,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:41:27,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:41:27,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:41:27,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:41:27,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:41:27,107 INFO L87 Difference]: Start difference. First operand 46 states and 69 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 10:41:27,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:41:27,152 INFO L93 Difference]: Finished difference Result 136 states and 205 transitions. [2024-10-11 10:41:27,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:41:27,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2024-10-11 10:41:27,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:41:27,155 INFO L225 Difference]: With dead ends: 136 [2024-10-11 10:41:27,155 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 10:41:27,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:41:27,156 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 35 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:41:27,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 122 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:41:27,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 10:41:27,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2024-10-11 10:41:27,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 10:41:27,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 135 transitions. [2024-10-11 10:41:27,189 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 135 transitions. Word has length 100 [2024-10-11 10:41:27,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:41:27,192 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 135 transitions. [2024-10-11 10:41:27,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 10:41:27,192 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 135 transitions. [2024-10-11 10:41:27,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 10:41:27,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:41:27,195 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:41:27,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:41:27,195 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:41:27,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:41:27,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1112900797, now seen corresponding path program 1 times [2024-10-11 10:41:27,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:41:27,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001570724] [2024-10-11 10:41:27,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:41:27,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:41:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:41:27,285 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:41:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:41:27,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:41:27,372 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:41:27,373 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:41:27,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:41:27,378 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 10:41:27,448 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:41:27,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:41:27 BoogieIcfgContainer [2024-10-11 10:41:27,450 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:41:27,451 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:41:27,451 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:41:27,451 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:41:27,452 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:41:26" (3/4) ... [2024-10-11 10:41:27,453 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:41:27,454 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:41:27,455 INFO L158 Benchmark]: Toolchain (without parser) took 2202.34ms. Allocated memory was 159.4MB in the beginning and 260.0MB in the end (delta: 100.7MB). Free memory was 88.1MB in the beginning and 158.6MB in the end (delta: -70.5MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2024-10-11 10:41:27,455 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 159.4MB. Free memory is still 110.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:41:27,456 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.75ms. Allocated memory is still 159.4MB. Free memory was 87.9MB in the beginning and 73.4MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 10:41:27,456 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.99ms. Allocated memory is still 159.4MB. Free memory was 73.4MB in the beginning and 70.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:41:27,458 INFO L158 Benchmark]: Boogie Preprocessor took 60.58ms. Allocated memory is still 159.4MB. Free memory was 70.3MB in the beginning and 65.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:41:27,459 INFO L158 Benchmark]: RCFGBuilder took 504.13ms. Allocated memory was 159.4MB in the beginning and 260.0MB in the end (delta: 100.7MB). Free memory was 65.8MB in the beginning and 224.8MB in the end (delta: -159.0MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2024-10-11 10:41:27,459 INFO L158 Benchmark]: TraceAbstraction took 1332.25ms. Allocated memory is still 260.0MB. Free memory was 224.8MB in the beginning and 158.6MB in the end (delta: 66.2MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. [2024-10-11 10:41:27,459 INFO L158 Benchmark]: Witness Printer took 3.47ms. Allocated memory is still 260.0MB. Free memory is still 158.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:41:27,461 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.11ms. Allocated memory is still 159.4MB. Free memory is still 110.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.75ms. Allocated memory is still 159.4MB. Free memory was 87.9MB in the beginning and 73.4MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.99ms. Allocated memory is still 159.4MB. Free memory was 73.4MB in the beginning and 70.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.58ms. Allocated memory is still 159.4MB. Free memory was 70.3MB in the beginning and 65.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 504.13ms. Allocated memory was 159.4MB in the beginning and 260.0MB in the end (delta: 100.7MB). Free memory was 65.8MB in the beginning and 224.8MB in the end (delta: -159.0MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1332.25ms. Allocated memory is still 260.0MB. Free memory was 224.8MB in the beginning and 158.6MB in the end (delta: 66.2MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. * Witness Printer took 3.47ms. Allocated memory is still 260.0MB. Free memory is still 158.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 100, overapproximation of someBinaryFLOATComparisonOperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L23] double var_1_2 = 50.75; [L24] double var_1_3 = 7.675; [L25] signed char var_1_7 = 10; [L26] float var_1_8 = 32.5; [L27] float var_1_9 = 1000000.7; [L28] float var_1_10 = 2.4; [L29] unsigned char var_1_11 = 1; [L30] unsigned char var_1_12 = 1; [L31] unsigned char var_1_13 = 1; [L32] unsigned char var_1_14 = 5; [L33] unsigned char var_1_15 = 200; [L34] unsigned char var_1_16 = 10; [L35] unsigned char var_1_17 = 1; [L36] unsigned char last_1_var_1_11 = 1; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] CALL updateLastVariables() [L97] last_1_var_1_11 = var_1_11 [L107] RET updateLastVariables() [L108] CALL updateVariables() [L69] var_1_2 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_2 >= 0.0F && 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_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_3=307/40, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_3=307/40, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L70] RET assume_abort_if_not((var_1_2 >= 0.0F && 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_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_3=307/40, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L71] var_1_3 = __VERIFIER_nondet_double() [L72] 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_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L72] 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_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L73] var_1_7 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2, var_1_9=10000007/10] [L74] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2, var_1_9=10000007/10] [L75] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2, var_1_9=10000007/10] [L75] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2, var_1_9=10000007/10] [L76] var_1_9 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L77] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L78] var_1_10 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L79] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L80] var_1_12 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L81] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L82] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L82] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L83] var_1_13 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L84] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L85] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L85] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L86] var_1_15 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L87] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L88] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L88] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L89] var_1_16 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L90] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L91] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=6, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=6, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L91] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=6, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L92] var_1_17 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=6, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=6, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L93] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=6, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L94] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=6, var_1_17=6, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=6, var_1_17=6, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L94] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=6, var_1_17=6, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L108] RET updateVariables() [L109] CALL step() [L40] COND FALSE !(var_1_3 >= var_1_2) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=6, var_1_17=6, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L49] COND FALSE !(var_1_8 <= var_1_8) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=6, var_1_17=6, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L52] unsigned char stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=6, var_1_17=6, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L53] COND FALSE !((var_1_2 - 5.25) < (var_1_8 * (var_1_8 * 199.4))) VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=6, var_1_17=6, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L62] COND FALSE !(! var_1_11) [L65] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=6, var_1_15=254, var_1_16=6, var_1_17=6, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L109] RET step() [L110] CALL, EXPR property() [L100-L101] return (((((var_1_2 - 5.25) < (var_1_8 * (var_1_8 * 199.4))) ? ((var_1_11 && var_1_11) ? ((var_1_8 < var_1_8) ? (var_1_1 == ((signed char) var_1_7)) : (var_1_1 == ((signed char) var_1_7))) : 1) : 1) && ((var_1_3 >= var_1_2) ? (last_1_var_1_11 ? ((! last_1_var_1_11) ? (var_1_8 == ((float) ((((var_1_9) > ((10.25f + var_1_10))) ? (var_1_9) : ((10.25f + var_1_10)))))) : (var_1_8 == ((float) var_1_9))) : 1) : 1)) && ((var_1_8 <= var_1_8) ? (var_1_11 == ((unsigned char) (var_1_12 || var_1_13))) : 1)) && ((! var_1_11) ? (var_1_14 == ((unsigned char) ((((((((var_1_15) < (((((var_1_16) > (5)) ? (var_1_16) : (5))))) ? (var_1_15) : (((((var_1_16) > (5)) ? (var_1_16) : (5))))))) < (var_1_17)) ? (((((var_1_15) < (((((var_1_16) > (5)) ? (var_1_16) : (5))))) ? (var_1_15) : (((((var_1_16) > (5)) ? (var_1_16) : (5))))))) : (var_1_17))))) : (var_1_14 == ((unsigned char) var_1_16))) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=6, var_1_15=254, var_1_16=6, var_1_17=6, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=6, var_1_15=254, var_1_16=6, var_1_17=6, var_1_1=-16, var_1_7=-127, var_1_8=65/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 188 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18 IncrementalHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 128 mSDtfsCounter, 18 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=2, InterpolantAutomatonStates: 5, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 262 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 960/960 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 10:41:27,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-11.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97b1061e2cabddcb3093af5cecca71c7ed1fd9a404462e73f738c3d404d688bc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:41:29,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:41:29,556 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 10:41:29,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:41:29,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:41:29,583 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:41:29,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:41:29,584 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:41:29,589 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:41:29,589 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:41:29,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:41:29,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:41:29,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:41:29,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:41:29,590 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:41:29,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:41:29,590 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:41:29,591 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:41:29,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:41:29,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:41:29,594 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:41:29,594 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:41:29,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:41:29,595 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:41:29,595 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:41:29,595 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:41:29,595 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:41:29,596 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:41:29,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:41:29,596 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:41:29,596 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:41:29,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:41:29,597 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:41:29,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:41:29,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:41:29,598 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:41:29,598 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:41:29,599 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:41:29,599 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:41:29,599 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:41:29,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:41:29,603 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:41:29,603 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:41:29,603 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:41:29,604 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:41:29,604 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97b1061e2cabddcb3093af5cecca71c7ed1fd9a404462e73f738c3d404d688bc [2024-10-11 10:41:29,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:41:29,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:41:29,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:41:29,912 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:41:29,913 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:41:29,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-11.i [2024-10-11 10:41:31,269 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:41:31,449 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:41:31,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-11.i [2024-10-11 10:41:31,459 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4bd330496/47820d0a81d84964af796a4322b8e2d3/FLAG0d75d3abb [2024-10-11 10:41:31,471 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4bd330496/47820d0a81d84964af796a4322b8e2d3 [2024-10-11 10:41:31,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:41:31,474 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:41:31,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:41:31,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:41:31,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:41:31,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:41:31" (1/1) ... [2024-10-11 10:41:31,487 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27546a00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:31, skipping insertion in model container [2024-10-11 10:41:31,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:41:31" (1/1) ... [2024-10-11 10:41:31,512 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:41:31,657 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-11.i[917,930] [2024-10-11 10:41:31,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:41:31,726 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:41:31,758 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-11.i[917,930] [2024-10-11 10:41:31,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:41:31,805 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:41:31,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:31 WrapperNode [2024-10-11 10:41:31,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:41:31,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:41:31,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:41:31,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:41:31,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:31" (1/1) ... [2024-10-11 10:41:31,827 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:31" (1/1) ... [2024-10-11 10:41:31,855 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2024-10-11 10:41:31,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:41:31,857 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:41:31,857 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:41:31,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:41:31,866 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:31" (1/1) ... [2024-10-11 10:41:31,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:31" (1/1) ... [2024-10-11 10:41:31,871 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:31" (1/1) ... [2024-10-11 10:41:31,886 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:41:31,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:31" (1/1) ... [2024-10-11 10:41:31,890 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:31" (1/1) ... [2024-10-11 10:41:31,900 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:31" (1/1) ... [2024-10-11 10:41:31,907 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:31" (1/1) ... [2024-10-11 10:41:31,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:31" (1/1) ... [2024-10-11 10:41:31,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:31" (1/1) ... [2024-10-11 10:41:31,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:41:31,920 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:41:31,920 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:41:31,920 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:41:31,921 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:31" (1/1) ... [2024-10-11 10:41:31,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:41:31,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:41:31,956 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:41:31,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:41:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:41:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:41:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:41:31,998 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:41:31,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:41:32,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:41:32,069 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:41:32,071 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:41:44,588 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 10:41:44,589 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:41:44,638 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:41:44,641 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:41:44,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:41:44 BoogieIcfgContainer [2024-10-11 10:41:44,641 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:41:44,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:41:44,644 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:41:44,647 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:41:44,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:41:31" (1/3) ... [2024-10-11 10:41:44,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e5190b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:41:44, skipping insertion in model container [2024-10-11 10:41:44,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:31" (2/3) ... [2024-10-11 10:41:44,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e5190b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:41:44, skipping insertion in model container [2024-10-11 10:41:44,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:41:44" (3/3) ... [2024-10-11 10:41:44,650 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-11.i [2024-10-11 10:41:44,664 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:41:44,665 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:41:44,742 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:41:44,747 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;@6f6aea57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:41:44,748 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:41:44,751 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 10:41:44,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 10:41:44,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:41:44,760 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:41:44,760 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:41:44,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:41:44,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1788450943, now seen corresponding path program 1 times [2024-10-11 10:41:44,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:41:44,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [708809265] [2024-10-11 10:41:44,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:41:44,775 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:41:44,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:41:44,781 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:41:44,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 10:41:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:45,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:41:45,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:41:45,283 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-10-11 10:41:45,284 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:41:45,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:41:45,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [708809265] [2024-10-11 10:41:45,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [708809265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:41:45,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:41:45,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:41:45,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313878009] [2024-10-11 10:41:45,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:41:45,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:41:45,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:41:45,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:41:45,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:41:45,316 INFO L87 Difference]: Start difference. First operand has 48 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 10:41:49,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:41:49,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:41:49,526 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2024-10-11 10:41:49,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:41:49,591 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 100 [2024-10-11 10:41:49,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:41:49,596 INFO L225 Difference]: With dead ends: 93 [2024-10-11 10:41:49,597 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 10:41:49,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:41:49,601 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:41:49,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 10:41:49,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 10:41:49,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-11 10:41:49,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 10:41:49,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2024-10-11 10:41:49,641 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 100 [2024-10-11 10:41:49,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:41:49,641 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2024-10-11 10:41:49,642 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 10:41:49,642 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2024-10-11 10:41:49,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 10:41:49,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:41:49,647 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:41:49,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 10:41:49,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:41:49,849 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:41:49,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:41:49,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1112841215, now seen corresponding path program 1 times [2024-10-11 10:41:49,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:41:49,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278688251] [2024-10-11 10:41:49,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:41:49,851 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:41:49,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:41:49,854 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:41:49,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 10:41:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:50,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 10:41:50,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:41:52,355 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 10:41:52,359 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:41:52,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:41:52,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278688251] [2024-10-11 10:41:52,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [278688251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:41:52,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:41:52,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:41:52,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564895539] [2024-10-11 10:41:52,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:41:52,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:41:52,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:41:52,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:41:52,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:41:52,367 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 10:41:56,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-11 10:42:00,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-11 10:42:05,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-11 10:42:09,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-11 10:42:10,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-11 10:42:14,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:42:18,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-11 10:42:18,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:42:18,869 INFO L93 Difference]: Finished difference Result 136 states and 202 transitions. [2024-10-11 10:42:18,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:42:18,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2024-10-11 10:42:18,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:42:18,871 INFO L225 Difference]: With dead ends: 136 [2024-10-11 10:42:18,871 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 10:42:18,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:42:18,872 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 17 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:42:18,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 121 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 6 Unknown, 0 Unchecked, 26.5s Time] [2024-10-11 10:42:18,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 10:42:18,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2024-10-11 10:42:18,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 53 states have internal predecessors, (67), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 10:42:18,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 131 transitions. [2024-10-11 10:42:18,888 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 131 transitions. Word has length 100 [2024-10-11 10:42:18,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:42:18,889 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 131 transitions. [2024-10-11 10:42:18,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 10:42:18,889 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 131 transitions. [2024-10-11 10:42:18,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 10:42:18,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:42:18,891 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:42:18,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 10:42:19,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:42:19,095 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:42:19,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:42:19,100 INFO L85 PathProgramCache]: Analyzing trace with hash -662166147, now seen corresponding path program 1 times [2024-10-11 10:42:19,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:42:19,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733352607] [2024-10-11 10:42:19,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:42:19,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:42:19,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:42:19,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:42:19,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 10:42:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:42:19,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 10:42:19,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:42:20,695 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 255 proven. 21 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-11 10:42:20,695 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:42:22,129 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-11 10:42:22,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:42:22,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733352607] [2024-10-11 10:42:22,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733352607] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:42:22,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 10:42:22,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-10-11 10:42:22,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369744945] [2024-10-11 10:42:22,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 10:42:22,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 10:42:22,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:42:22,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 10:42:22,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:42:22,138 INFO L87 Difference]: Start difference. First operand 88 states and 131 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 10:42:27,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:42:31,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:42:31,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:42:31,911 INFO L93 Difference]: Finished difference Result 187 states and 271 transitions. [2024-10-11 10:42:31,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 10:42:31,982 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 100 [2024-10-11 10:42:31,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:42:31,984 INFO L225 Difference]: With dead ends: 187 [2024-10-11 10:42:31,984 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 10:42:31,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2024-10-11 10:42:31,986 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 61 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 52 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:42:31,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 92 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 110 Invalid, 1 Unknown, 0 Unchecked, 9.3s Time] [2024-10-11 10:42:31,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 10:42:32,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2024-10-11 10:42:32,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 10:42:32,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2024-10-11 10:42:32,006 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 100 [2024-10-11 10:42:32,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:42:32,007 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2024-10-11 10:42:32,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 10:42:32,007 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2024-10-11 10:42:32,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 10:42:32,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:42:32,010 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:42:32,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 10:42:32,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:42:32,211 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:42:32,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:42:32,213 INFO L85 PathProgramCache]: Analyzing trace with hash -662106565, now seen corresponding path program 1 times [2024-10-11 10:42:32,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:42:32,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788105388] [2024-10-11 10:42:32,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:42:32,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:42:32,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:42:32,216 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:42:32,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 10:42:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:42:32,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 10:42:32,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:42:42,240 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 10:42:50,485 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 10:42:58,631 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 10:43:06,888 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)