./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-63.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e232e31d2ef49a20919d421300baab40e8d32863fd290aed1658ebcf167ecf0c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:40:44,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:40:44,442 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:40:44,450 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:40:44,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:40:44,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:40:44,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:40:44,486 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:40:44,486 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:40:44,487 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:40:44,487 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:40:44,487 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:40:44,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:40:44,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:40:44,491 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:40:44,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:40:44,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:40:44,494 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:40:44,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:40:44,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:40:44,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:40:44,496 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:40:44,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:40:44,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:40:44,497 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:40:44,497 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:40:44,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:40:44,498 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:40:44,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:40:44,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:40:44,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:40:44,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:40:44,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:40:44,500 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:40:44,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:40:44,501 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:40:44,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:40:44,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:40:44,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:40:44,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:40:44,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:40:44,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:40:44,503 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e232e31d2ef49a20919d421300baab40e8d32863fd290aed1658ebcf167ecf0c [2024-11-12 04:40:44,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:40:44,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:40:44,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:40:44,811 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:40:44,812 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:40:44,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-63.i [2024-11-12 04:40:46,386 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:40:46,598 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:40:46,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-63.i [2024-11-12 04:40:46,612 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0aec095a/3c754b56ec484cdca6e7c1ebcb451cb3/FLAG76b116b8a [2024-11-12 04:40:46,965 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0aec095a/3c754b56ec484cdca6e7c1ebcb451cb3 [2024-11-12 04:40:46,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:40:46,970 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:40:46,971 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:40:46,971 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:40:46,977 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:40:46,978 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:40:46" (1/1) ... [2024-11-12 04:40:46,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e3d4888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:46, skipping insertion in model container [2024-11-12 04:40:46,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:40:46" (1/1) ... [2024-11-12 04:40:47,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:40:47,219 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-63.i[917,930] [2024-11-12 04:40:47,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:40:47,290 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:40:47,302 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-63.i[917,930] [2024-11-12 04:40:47,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:40:47,352 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:40:47,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:47 WrapperNode [2024-11-12 04:40:47,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:40:47,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:40:47,355 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:40:47,355 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:40:47,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:47" (1/1) ... [2024-11-12 04:40:47,380 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:47" (1/1) ... [2024-11-12 04:40:47,424 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-11-12 04:40:47,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:40:47,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:40:47,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:40:47,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:40:47,440 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:47" (1/1) ... [2024-11-12 04:40:47,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:47" (1/1) ... [2024-11-12 04:40:47,443 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:47" (1/1) ... [2024-11-12 04:40:47,467 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:40:47,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:47" (1/1) ... [2024-11-12 04:40:47,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:47" (1/1) ... [2024-11-12 04:40:47,481 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:47" (1/1) ... [2024-11-12 04:40:47,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:47" (1/1) ... [2024-11-12 04:40:47,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:47" (1/1) ... [2024-11-12 04:40:47,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:47" (1/1) ... [2024-11-12 04:40:47,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:40:47,500 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:40:47,500 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:40:47,501 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:40:47,502 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:47" (1/1) ... [2024-11-12 04:40:47,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:40:47,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:40:47,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:40:47,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:40:47,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:40:47,612 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:40:47,613 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:40:47,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:40:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:40:47,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:40:47,697 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:40:47,702 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:40:47,995 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 04:40:47,997 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:40:48,039 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:40:48,041 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:40:48,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:40:48 BoogieIcfgContainer [2024-11-12 04:40:48,042 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:40:48,045 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:40:48,045 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:40:48,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:40:48,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:40:46" (1/3) ... [2024-11-12 04:40:48,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@93bd645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:40:48, skipping insertion in model container [2024-11-12 04:40:48,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:47" (2/3) ... [2024-11-12 04:40:48,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@93bd645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:40:48, skipping insertion in model container [2024-11-12 04:40:48,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:40:48" (3/3) ... [2024-11-12 04:40:48,055 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-63.i [2024-11-12 04:40:48,076 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:40:48,077 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:40:48,160 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:40:48,167 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;@4b458a51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:40:48,167 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:40:48,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 04:40:48,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 04:40:48,185 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:40:48,187 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:40:48,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:40:48,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:40:48,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1773879400, now seen corresponding path program 1 times [2024-11-12 04:40:48,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:40:48,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378499343] [2024-11-12 04:40:48,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:40:48,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:40:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:48,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:40:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:48,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 04:40:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:48,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 04:40:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:48,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 04:40:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:48,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 04:40:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:48,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 04:40:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:48,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-12 04:40:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:48,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 04:40:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:48,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-12 04:40:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:48,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 04:40:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:48,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 04:40:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:48,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 04:40:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:48,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 04:40:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:48,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 04:40:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:48,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 04:40:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:48,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 04:40:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:48,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 04:40:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:48,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 04:40:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:48,706 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 04:40:48,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:40:48,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378499343] [2024-11-12 04:40:48,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378499343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:40:48,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:40:48,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:40:48,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726397827] [2024-11-12 04:40:48,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:40:48,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:40:48,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:40:48,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:40:48,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:40:48,746 INFO L87 Difference]: Start difference. First operand has 52 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 04:40:48,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:40:48,775 INFO L93 Difference]: Finished difference Result 97 states and 162 transitions. [2024-11-12 04:40:48,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:40:48,779 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 114 [2024-11-12 04:40:48,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:40:48,789 INFO L225 Difference]: With dead ends: 97 [2024-11-12 04:40:48,789 INFO L226 Difference]: Without dead ends: 48 [2024-11-12 04:40:48,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:40:48,799 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:40:48,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:40:48,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-12 04:40:48,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-12 04:40:48,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 04:40:48,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2024-11-12 04:40:48,855 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 114 [2024-11-12 04:40:48,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:40:48,856 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2024-11-12 04:40:48,857 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 04:40:48,857 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2024-11-12 04:40:48,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 04:40:48,861 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:40:48,861 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:40:48,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:40:48,862 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:40:48,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:40:48,863 INFO L85 PathProgramCache]: Analyzing trace with hash -3676308, now seen corresponding path program 1 times [2024-11-12 04:40:48,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:40:48,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936643957] [2024-11-12 04:40:48,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:40:48,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:40:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:49,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:40:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:49,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 04:40:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:49,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 04:40:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:49,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 04:40:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:49,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 04:40:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:49,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 04:40:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:49,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-12 04:40:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:49,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 04:40:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:49,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-12 04:40:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:49,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 04:40:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:49,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 04:40:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:49,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 04:40:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:49,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 04:40:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:49,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 04:40:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:49,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 04:40:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:49,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 04:40:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:49,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 04:40:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:49,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 04:40:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 04:40:49,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:40:49,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936643957] [2024-11-12 04:40:49,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936643957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:40:49,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:40:49,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 04:40:49,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047361361] [2024-11-12 04:40:49,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:40:49,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 04:40:49,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:40:49,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 04:40:49,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:40:49,586 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 04:40:49,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:40:49,906 INFO L93 Difference]: Finished difference Result 97 states and 136 transitions. [2024-11-12 04:40:49,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 04:40:49,907 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 114 [2024-11-12 04:40:49,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:40:49,909 INFO L225 Difference]: With dead ends: 97 [2024-11-12 04:40:49,909 INFO L226 Difference]: Without dead ends: 52 [2024-11-12 04:40:49,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-12 04:40:49,912 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 95 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:40:49,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 96 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:40:49,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-12 04:40:49,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-12 04:40:49,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 04:40:49,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 70 transitions. [2024-11-12 04:40:49,976 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 70 transitions. Word has length 114 [2024-11-12 04:40:49,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:40:49,976 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 70 transitions. [2024-11-12 04:40:49,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 04:40:49,977 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 70 transitions. [2024-11-12 04:40:49,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 04:40:49,985 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:40:49,985 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:40:49,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 04:40:49,991 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:40:49,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:40:49,992 INFO L85 PathProgramCache]: Analyzing trace with hash 53581994, now seen corresponding path program 1 times [2024-11-12 04:40:49,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:40:49,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177582155] [2024-11-12 04:40:49,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:40:49,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:40:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:40:50,131 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 04:40:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:40:50,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 04:40:50,287 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 04:40:50,289 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:40:50,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 04:40:50,295 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 04:40:50,386 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:40:50,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:40:50 BoogieIcfgContainer [2024-11-12 04:40:50,390 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:40:50,391 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:40:50,391 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:40:50,392 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:40:50,392 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:40:48" (3/4) ... [2024-11-12 04:40:50,395 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 04:40:50,396 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:40:50,397 INFO L158 Benchmark]: Toolchain (without parser) took 3426.64ms. Allocated memory was 153.1MB in the beginning and 216.0MB in the end (delta: 62.9MB). Free memory was 97.2MB in the beginning and 152.4MB in the end (delta: -55.1MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2024-11-12 04:40:50,397 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 153.1MB. Free memory is still 113.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:40:50,398 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.40ms. Allocated memory is still 153.1MB. Free memory was 97.2MB in the beginning and 82.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 04:40:50,398 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.62ms. Allocated memory is still 153.1MB. Free memory was 82.6MB in the beginning and 80.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:40:50,399 INFO L158 Benchmark]: Boogie Preprocessor took 69.94ms. Allocated memory is still 153.1MB. Free memory was 80.5MB in the beginning and 77.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:40:50,399 INFO L158 Benchmark]: RCFGBuilder took 542.45ms. Allocated memory was 153.1MB in the beginning and 216.0MB in the end (delta: 62.9MB). Free memory was 77.5MB in the beginning and 185.5MB in the end (delta: -108.0MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2024-11-12 04:40:50,400 INFO L158 Benchmark]: TraceAbstraction took 2345.97ms. Allocated memory is still 216.0MB. Free memory was 185.5MB in the beginning and 152.4MB in the end (delta: 33.2MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2024-11-12 04:40:50,400 INFO L158 Benchmark]: Witness Printer took 4.96ms. Allocated memory is still 216.0MB. Free memory is still 152.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:40:50,403 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.20ms. Allocated memory is still 153.1MB. Free memory is still 113.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.40ms. Allocated memory is still 153.1MB. Free memory was 97.2MB in the beginning and 82.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.62ms. Allocated memory is still 153.1MB. Free memory was 82.6MB in the beginning and 80.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.94ms. Allocated memory is still 153.1MB. Free memory was 80.5MB in the beginning and 77.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 542.45ms. Allocated memory was 153.1MB in the beginning and 216.0MB in the end (delta: 62.9MB). Free memory was 77.5MB in the beginning and 185.5MB in the end (delta: -108.0MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2345.97ms. Allocated memory is still 216.0MB. Free memory was 185.5MB in the beginning and 152.4MB in the end (delta: 33.2MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. * Witness Printer took 4.96ms. Allocated memory is still 216.0MB. Free memory is still 152.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] float var_1_2 = 8.3; [L24] float var_1_3 = 2.25; [L25] float var_1_4 = 10.3; [L26] unsigned char var_1_6 = 0; [L27] signed long int var_1_7 = 128; [L28] float var_1_8 = 9.8; [L29] unsigned long int var_1_13 = 1; [L30] unsigned long int var_1_14 = 32; [L31] signed char var_1_15 = -10; [L32] signed char var_1_16 = 16; [L33] signed char var_1_17 = 25; [L34] signed char var_1_18 = 1; [L35] signed char var_1_19 = 0; [L36] signed char var_1_20 = 32; [L37] signed short int var_1_21 = 256; [L38] signed char var_1_22 = 16; [L39] unsigned char var_1_23 = 0; [L40] signed short int last_1_var_1_21 = 256; VAL [isInitial=0, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_2=83/10, var_1_3=9/4, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] CALL updateLastVariables() [L93] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_2=83/10, var_1_3=9/4, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L103] RET updateLastVariables() [L104] CALL updateVariables() [L62] var_1_2 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_3=9/4, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_3=9/4, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L63] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_3=9/4, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L64] var_1_3 = __VERIFIER_nondet_float() [L65] 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_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L65] 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_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L66] var_1_4 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128, var_1_8=49/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128, var_1_8=49/5] [L67] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128, var_1_8=49/5] [L68] var_1_6 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_7=128, var_1_8=49/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_7=128, var_1_8=49/5] [L69] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_7=128, var_1_8=49/5] [L70] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128, var_1_8=49/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128, var_1_8=49/5] [L70] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128, var_1_8=49/5] [L71] var_1_8 = __VERIFIER_nondet_float() [L72] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L72] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L73] var_1_14 = __VERIFIER_nondet_ulong() [L74] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L74] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L75] CALL assume_abort_if_not(var_1_14 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L75] RET assume_abort_if_not(var_1_14 <= 4294967294) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L76] var_1_16 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L77] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L78] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L78] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L79] var_1_17 = __VERIFIER_nondet_char() [L80] CALL assume_abort_if_not(var_1_17 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L80] RET assume_abort_if_not(var_1_17 >= -1) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L81] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L81] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L82] var_1_18 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L83] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L84] CALL assume_abort_if_not(var_1_18 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L84] RET assume_abort_if_not(var_1_18 <= 31) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L85] var_1_19 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=0, var_1_19=63, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=0, var_1_19=63, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L86] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=0, var_1_19=63, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L87] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=0, var_1_19=63, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=0, var_1_19=63, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L87] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=0, var_1_19=63, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L88] var_1_20 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=0, var_1_19=63, var_1_1=0, var_1_20=62, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=0, var_1_19=63, var_1_1=0, var_1_20=62, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L89] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=0, var_1_19=63, var_1_1=0, var_1_20=62, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L90] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=0, var_1_19=63, var_1_1=0, var_1_20=62, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=0, var_1_19=63, var_1_1=0, var_1_20=62, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L90] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=0, var_1_19=63, var_1_1=0, var_1_20=62, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L104] RET updateVariables() [L105] CALL step() [L44] var_1_13 = var_1_14 [L45] var_1_21 = last_1_var_1_21 [L46] var_1_22 = var_1_16 [L47] var_1_23 = var_1_6 VAL [isInitial=1, last_1_var_1_21=256, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=0, var_1_19=63, var_1_1=0, var_1_20=62, var_1_21=256, var_1_22=0, var_1_23=-256, var_1_6=-256, var_1_7=128] [L48] COND TRUE ((((1.1f) < (var_1_2)) ? (1.1f) : (var_1_2))) > (var_1_3 * var_1_4) [L49] var_1_1 = (var_1_23 && var_1_6) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=0, var_1_19=63, var_1_1=0, var_1_20=62, var_1_21=256, var_1_22=0, var_1_23=-256, var_1_6=-256, var_1_7=128] [L51] signed char stepLocal_0 = var_1_22; VAL [isInitial=1, last_1_var_1_21=256, stepLocal_0=0, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=0, var_1_19=63, var_1_1=0, var_1_20=62, var_1_21=256, var_1_22=0, var_1_23=-256, var_1_6=-256, var_1_7=128] [L52] COND FALSE !(stepLocal_0 != ((((var_1_22) < (var_1_21)) ? (var_1_22) : (var_1_21)))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=0, var_1_19=63, var_1_1=0, var_1_20=62, var_1_21=256, var_1_22=0, var_1_23=-256, var_1_6=-256, var_1_7=128] [L55] COND TRUE var_1_4 <= (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) * var_1_8) [L56] var_1_7 = (((((((((var_1_22 + var_1_15)) > (var_1_15)) ? ((var_1_22 + var_1_15)) : (var_1_15)))) > (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) ? ((((((var_1_22 + var_1_15)) > (var_1_15)) ? ((var_1_22 + var_1_15)) : (var_1_15)))) : (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=0, var_1_19=63, var_1_1=0, var_1_20=62, var_1_21=256, var_1_22=0, var_1_23=-256, var_1_6=-256, var_1_7=10] [L105] RET step() [L106] CALL, EXPR property() [L96-L97] return (((((((((((1.1f) < (var_1_2)) ? (1.1f) : (var_1_2))) > (var_1_3 * var_1_4)) ? (var_1_1 == ((unsigned char) (var_1_23 && var_1_6))) : 1) && ((var_1_4 <= (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) * var_1_8)) ? (var_1_7 == ((signed long int) (((((((((var_1_22 + var_1_15)) > (var_1_15)) ? ((var_1_22 + var_1_15)) : (var_1_15)))) > (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) ? ((((((var_1_22 + var_1_15)) > (var_1_15)) ? ((var_1_22 + var_1_15)) : (var_1_15)))) : (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))))))) : (var_1_7 == ((signed long int) var_1_22)))) && (var_1_13 == ((unsigned long int) var_1_14))) && ((var_1_22 != ((((var_1_22) < (var_1_21)) ? (var_1_22) : (var_1_21)))) ? (var_1_15 == ((signed char) ((((((10 + var_1_16)) < (var_1_17)) ? ((10 + var_1_16)) : (var_1_17))) - ((32 - var_1_18) + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20))))))) : 1)) && (var_1_21 == ((signed short int) last_1_var_1_21))) && (var_1_22 == ((signed char) var_1_16))) && (var_1_23 == ((unsigned char) var_1_6)) ; VAL [\result=0, isInitial=1, last_1_var_1_21=256, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=0, var_1_19=63, var_1_1=0, var_1_20=62, var_1_21=256, var_1_22=0, var_1_23=-256, var_1_6=-256, var_1_7=10] [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=0, var_1_19=63, var_1_1=0, var_1_20=62, var_1_21=256, var_1_22=0, var_1_23=-256, var_1_6=-256, var_1_7=10] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=256, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=0, var_1_19=63, var_1_1=0, var_1_20=62, var_1_21=256, var_1_22=0, var_1_23=-256, var_1_6=-256, var_1_7=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 3, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 95 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 164 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 69 IncrementalHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 129 mSDtfsCounter, 69 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 342 NumberOfCodeBlocks, 342 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 338 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1224/1224 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 04:40:50,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-63.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e232e31d2ef49a20919d421300baab40e8d32863fd290aed1658ebcf167ecf0c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:40:52,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:40:53,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 04:40:53,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:40:53,060 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:40:53,097 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:40:53,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:40:53,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:40:53,098 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:40:53,098 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:40:53,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:40:53,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:40:53,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:40:53,104 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:40:53,105 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:40:53,105 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:40:53,105 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:40:53,106 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:40:53,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:40:53,108 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:40:53,109 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:40:53,109 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:40:53,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:40:53,112 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 04:40:53,112 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 04:40:53,113 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:40:53,113 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 04:40:53,113 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:40:53,113 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:40:53,114 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:40:53,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:40:53,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:40:53,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:40:53,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:40:53,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:40:53,122 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:40:53,122 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:40:53,122 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:40:53,123 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 04:40:53,123 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 04:40:53,123 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:40:53,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:40:53,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:40:53,124 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:40:53,124 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e232e31d2ef49a20919d421300baab40e8d32863fd290aed1658ebcf167ecf0c [2024-11-12 04:40:53,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:40:53,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:40:53,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:40:53,545 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:40:53,545 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:40:53,547 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-63.i [2024-11-12 04:40:55,244 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:40:55,493 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:40:55,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-63.i [2024-11-12 04:40:55,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30e55a5bf/11fcfff10f244d0e9c180234b214c7f8/FLAG301d0691c [2024-11-12 04:40:55,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30e55a5bf/11fcfff10f244d0e9c180234b214c7f8 [2024-11-12 04:40:55,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:40:55,866 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:40:55,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:40:55,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:40:55,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:40:55,874 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:40:55" (1/1) ... [2024-11-12 04:40:55,875 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@95d6d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:55, skipping insertion in model container [2024-11-12 04:40:55,875 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:40:55" (1/1) ... [2024-11-12 04:40:55,906 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:40:56,107 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-63.i[917,930] [2024-11-12 04:40:56,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:40:56,192 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:40:56,205 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-63.i[917,930] [2024-11-12 04:40:56,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:40:56,282 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:40:56,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:56 WrapperNode [2024-11-12 04:40:56,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:40:56,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:40:56,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:40:56,285 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:40:56,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:56" (1/1) ... [2024-11-12 04:40:56,305 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:56" (1/1) ... [2024-11-12 04:40:56,343 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-11-12 04:40:56,345 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:40:56,346 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:40:56,346 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:40:56,347 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:40:56,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:56" (1/1) ... [2024-11-12 04:40:56,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:56" (1/1) ... [2024-11-12 04:40:56,366 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:56" (1/1) ... [2024-11-12 04:40:56,396 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:40:56,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:56" (1/1) ... [2024-11-12 04:40:56,400 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:56" (1/1) ... [2024-11-12 04:40:56,412 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:56" (1/1) ... [2024-11-12 04:40:56,418 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:56" (1/1) ... [2024-11-12 04:40:56,421 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:56" (1/1) ... [2024-11-12 04:40:56,426 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:56" (1/1) ... [2024-11-12 04:40:56,430 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:40:56,434 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:40:56,436 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:40:56,436 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:40:56,437 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:56" (1/1) ... [2024-11-12 04:40:56,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:40:56,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:40:56,473 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:40:56,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:40:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:40:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 04:40:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:40:56,528 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:40:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:40:56,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:40:56,624 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:40:56,626 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:40:58,827 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 04:40:58,827 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:40:58,841 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:40:58,841 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:40:58,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:40:58 BoogieIcfgContainer [2024-11-12 04:40:58,842 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:40:58,847 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:40:58,847 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:40:58,850 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:40:58,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:40:55" (1/3) ... [2024-11-12 04:40:58,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb92a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:40:58, skipping insertion in model container [2024-11-12 04:40:58,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:56" (2/3) ... [2024-11-12 04:40:58,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb92a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:40:58, skipping insertion in model container [2024-11-12 04:40:58,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:40:58" (3/3) ... [2024-11-12 04:40:58,853 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-63.i [2024-11-12 04:40:58,866 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:40:58,866 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:40:58,931 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:40:58,938 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;@7d9e28aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:40:58,939 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:40:58,942 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 04:40:58,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 04:40:58,953 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:40:58,954 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:40:58,954 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:40:58,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:40:58,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1773879400, now seen corresponding path program 1 times [2024-11-12 04:40:58,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:40:58,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517834432] [2024-11-12 04:40:58,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:40:58,973 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:40:58,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:40:58,977 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:40:58,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 04:40:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:59,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 04:40:59,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:40:59,377 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-12 04:40:59,378 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:40:59,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:40:59,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517834432] [2024-11-12 04:40:59,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1517834432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:40:59,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:40:59,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:40:59,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354695742] [2024-11-12 04:40:59,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:40:59,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:40:59,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:40:59,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:40:59,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:40:59,425 INFO L87 Difference]: Start difference. First operand has 52 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 04:40:59,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:40:59,470 INFO L93 Difference]: Finished difference Result 97 states and 162 transitions. [2024-11-12 04:40:59,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:40:59,473 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 114 [2024-11-12 04:40:59,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:40:59,480 INFO L225 Difference]: With dead ends: 97 [2024-11-12 04:40:59,481 INFO L226 Difference]: Without dead ends: 48 [2024-11-12 04:40:59,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:40:59,491 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:40:59,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:40:59,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-12 04:40:59,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-12 04:40:59,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 04:40:59,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2024-11-12 04:40:59,529 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 114 [2024-11-12 04:40:59,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:40:59,530 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2024-11-12 04:40:59,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 04:40:59,530 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2024-11-12 04:40:59,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 04:40:59,534 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:40:59,534 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:40:59,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 04:40:59,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:40:59,735 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:40:59,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:40:59,736 INFO L85 PathProgramCache]: Analyzing trace with hash -3676308, now seen corresponding path program 1 times [2024-11-12 04:40:59,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:40:59,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147008414] [2024-11-12 04:40:59,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:40:59,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:40:59,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:40:59,742 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:40:59,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 04:41:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:41:00,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 04:41:00,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:41:01,074 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 321 proven. 27 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 04:41:01,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:41:01,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:41:01,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147008414] [2024-11-12 04:41:01,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147008414] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:41:01,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1329580875] [2024-11-12 04:41:01,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:41:01,512 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 04:41:01,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 04:41:01,515 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 04:41:01,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-12 04:41:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:41:02,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-12 04:41:02,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:41:47,133 WARN L286 SmtUtils]: Spent 6.43s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 04:41:53,318 WARN L286 SmtUtils]: Spent 6.18s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 04:42:04,310 WARN L286 SmtUtils]: Spent 6.68s 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) [2024-11-12 04:42:17,392 WARN L286 SmtUtils]: Spent 6.75s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)