./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-24.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_no-floats_file-24.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 fbed63e7ceb32b7a0e8cf5dc0c27da185670168d6f706e37fa0256a1876a7a11 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:50:52,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:50:52,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:50:53,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:50:53,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:50:53,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:50:53,027 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:50:53,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:50:53,028 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:50:53,028 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:50:53,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:50:53,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:50:53,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:50:53,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:50:53,030 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:50:53,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:50:53,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:50:53,031 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:50:53,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:50:53,032 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:50:53,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:50:53,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:50:53,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:50:53,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:50:53,036 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:50:53,037 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:50:53,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:50:53,037 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:50:53,037 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:50:53,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:50:53,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:50:53,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:50:53,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:50:53,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:50:53,039 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:50:53,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:50:53,039 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:50:53,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:50:53,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:50:53,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:50:53,040 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:50:53,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:50:53,041 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 -> fbed63e7ceb32b7a0e8cf5dc0c27da185670168d6f706e37fa0256a1876a7a11 [2024-11-10 06:50:53,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:50:53,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:50:53,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:50:53,295 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:50:53,295 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:50:53,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-24.i [2024-11-10 06:50:54,703 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:50:54,865 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:50:54,866 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-24.i [2024-11-10 06:50:54,872 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae06542a6/aa57ec0883624ddba2c314ffdac13496/FLAGaddbaa401 [2024-11-10 06:50:54,890 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae06542a6/aa57ec0883624ddba2c314ffdac13496 [2024-11-10 06:50:54,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:50:54,894 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:50:54,895 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:50:54,895 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:50:54,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:50:54,900 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:50:54" (1/1) ... [2024-11-10 06:50:54,901 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44a72c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:54, skipping insertion in model container [2024-11-10 06:50:54,901 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:50:54" (1/1) ... [2024-11-10 06:50:54,920 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:50:55,073 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_no-floats_file-24.i[916,929] [2024-11-10 06:50:55,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:50:55,157 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:50:55,170 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_no-floats_file-24.i[916,929] [2024-11-10 06:50:55,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:50:55,216 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:50:55,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:55 WrapperNode [2024-11-10 06:50:55,217 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:50:55,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:50:55,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:50:55,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:50:55,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:55" (1/1) ... [2024-11-10 06:50:55,229 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:55" (1/1) ... [2024-11-10 06:50:55,259 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2024-11-10 06:50:55,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:50:55,260 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:50:55,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:50:55,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:50:55,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:55" (1/1) ... [2024-11-10 06:50:55,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:55" (1/1) ... [2024-11-10 06:50:55,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:55" (1/1) ... [2024-11-10 06:50:55,281 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-10 06:50:55,284 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:55" (1/1) ... [2024-11-10 06:50:55,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:55" (1/1) ... [2024-11-10 06:50:55,290 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:55" (1/1) ... [2024-11-10 06:50:55,291 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:55" (1/1) ... [2024-11-10 06:50:55,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:55" (1/1) ... [2024-11-10 06:50:55,297 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:55" (1/1) ... [2024-11-10 06:50:55,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:50:55,307 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:50:55,307 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:50:55,307 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:50:55,308 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:55" (1/1) ... [2024-11-10 06:50:55,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:50:55,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:50:55,346 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-10 06:50:55,349 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-10 06:50:55,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:50:55,390 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:50:55,391 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:50:55,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:50:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:50:55,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:50:55,463 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:50:55,466 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:50:55,677 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 06:50:55,678 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:50:55,691 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:50:55,691 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:50:55,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:50:55 BoogieIcfgContainer [2024-11-10 06:50:55,692 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:50:55,693 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:50:55,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:50:55,696 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:50:55,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:50:54" (1/3) ... [2024-11-10 06:50:55,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3204099e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:50:55, skipping insertion in model container [2024-11-10 06:50:55,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:55" (2/3) ... [2024-11-10 06:50:55,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3204099e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:50:55, skipping insertion in model container [2024-11-10 06:50:55,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:50:55" (3/3) ... [2024-11-10 06:50:55,698 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-24.i [2024-11-10 06:50:55,710 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:50:55,710 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:50:55,764 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:50:55,771 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;@177fbf45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:50:55,771 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:50:55,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 06:50:55,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-10 06:50:55,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:50:55,784 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:50:55,785 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:50:55,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:50:55,790 INFO L85 PathProgramCache]: Analyzing trace with hash -106170975, now seen corresponding path program 1 times [2024-11-10 06:50:55,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:50:55,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137148774] [2024-11-10 06:50:55,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:50:55,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:50:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:55,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:50:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:55,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:50:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:50:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:50:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:50:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:50:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:50:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:50:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:50:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:50:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:50:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:50:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:50:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:50:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:50:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:50:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,066 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 06:50:56,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:50:56,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137148774] [2024-11-10 06:50:56,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137148774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:50:56,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:50:56,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:50:56,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481123434] [2024-11-10 06:50:56,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:50:56,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:50:56,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:50:56,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:50:56,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:50:56,147 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 06:50:56,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:50:56,179 INFO L93 Difference]: Finished difference Result 94 states and 155 transitions. [2024-11-10 06:50:56,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:50:56,186 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2024-11-10 06:50:56,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:50:56,191 INFO L225 Difference]: With dead ends: 94 [2024-11-10 06:50:56,192 INFO L226 Difference]: Without dead ends: 46 [2024-11-10 06:50:56,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:50:56,197 INFO L432 NwaCegarLoop]: 65 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, 65 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-10 06:50:56,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:50:56,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-10 06:50:56,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-10 06:50:56,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 06:50:56,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2024-11-10 06:50:56,230 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 103 [2024-11-10 06:50:56,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:50:56,231 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2024-11-10 06:50:56,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 06:50:56,231 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2024-11-10 06:50:56,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-10 06:50:56,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:50:56,234 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:50:56,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:50:56,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:50:56,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:50:56,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1505191329, now seen corresponding path program 1 times [2024-11-10 06:50:56,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:50:56,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262401225] [2024-11-10 06:50:56,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:50:56,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:50:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:50:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:50:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:50:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:50:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:50:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:50:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:50:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:50:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:50:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:50:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:50:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:50:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:50:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:50:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:50:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:50:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,809 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-10 06:50:56,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:50:56,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262401225] [2024-11-10 06:50:56,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262401225] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 06:50:56,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207619158] [2024-11-10 06:50:56,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:50:56,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:50:56,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:50:56,819 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 06:50:56,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 06:50:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:50:56,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 06:50:56,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:50:57,121 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 242 proven. 24 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2024-11-10 06:50:57,122 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:50:57,281 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-10 06:50:57,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207619158] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 06:50:57,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 06:50:57,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2024-11-10 06:50:57,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236916334] [2024-11-10 06:50:57,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 06:50:57,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 06:50:57,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:50:57,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 06:50:57,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-10 06:50:57,285 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2024-11-10 06:50:58,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:50:58,012 INFO L93 Difference]: Finished difference Result 206 states and 273 transitions. [2024-11-10 06:50:58,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-10 06:50:58,013 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 103 [2024-11-10 06:50:58,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:50:58,018 INFO L225 Difference]: With dead ends: 206 [2024-11-10 06:50:58,018 INFO L226 Difference]: Without dead ends: 163 [2024-11-10 06:50:58,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 234 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=362, Invalid=970, Unknown=0, NotChecked=0, Total=1332 [2024-11-10 06:50:58,019 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 150 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 06:50:58,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 387 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 06:50:58,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-10 06:50:58,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 104. [2024-11-10 06:50:58,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 64 states have (on average 1.109375) internal successors, (71), 65 states have internal predecessors, (71), 32 states have call successors, (32), 7 states have call predecessors, (32), 7 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 06:50:58,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2024-11-10 06:50:58,053 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 135 transitions. Word has length 103 [2024-11-10 06:50:58,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:50:58,054 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 135 transitions. [2024-11-10 06:50:58,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2024-11-10 06:50:58,054 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 135 transitions. [2024-11-10 06:50:58,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-10 06:50:58,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:50:58,055 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:50:58,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 06:50:58,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:50:58,257 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:50:58,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:50:58,257 INFO L85 PathProgramCache]: Analyzing trace with hash -302263134, now seen corresponding path program 1 times [2024-11-10 06:50:58,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:50:58,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695558896] [2024-11-10 06:50:58,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:50:58,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:50:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:50:58,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:50:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:50:58,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 06:50:58,375 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 06:50:58,376 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 06:50:58,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 06:50:58,380 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 06:50:58,445 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 06:50:58,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:50:58 BoogieIcfgContainer [2024-11-10 06:50:58,450 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 06:50:58,451 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 06:50:58,451 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 06:50:58,451 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 06:50:58,451 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:50:55" (3/4) ... [2024-11-10 06:50:58,453 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 06:50:58,454 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 06:50:58,455 INFO L158 Benchmark]: Toolchain (without parser) took 3561.30ms. Allocated memory was 167.8MB in the beginning and 237.0MB in the end (delta: 69.2MB). Free memory was 93.7MB in the beginning and 121.7MB in the end (delta: -28.0MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2024-11-10 06:50:58,455 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:50:58,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.48ms. Allocated memory is still 167.8MB. Free memory was 93.6MB in the beginning and 138.5MB in the end (delta: -45.0MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2024-11-10 06:50:58,456 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.33ms. Allocated memory is still 167.8MB. Free memory was 138.5MB in the beginning and 135.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 06:50:58,456 INFO L158 Benchmark]: Boogie Preprocessor took 46.26ms. Allocated memory is still 167.8MB. Free memory was 135.4MB in the beginning and 132.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 06:50:58,456 INFO L158 Benchmark]: IcfgBuilder took 384.53ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 116.5MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 06:50:58,457 INFO L158 Benchmark]: TraceAbstraction took 2756.75ms. Allocated memory was 167.8MB in the beginning and 237.0MB in the end (delta: 69.2MB). Free memory was 115.5MB in the beginning and 122.8MB in the end (delta: -7.3MB). Peak memory consumption was 59.8MB. Max. memory is 16.1GB. [2024-11-10 06:50:58,457 INFO L158 Benchmark]: Witness Printer took 3.70ms. Allocated memory is still 237.0MB. Free memory was 122.8MB in the beginning and 121.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:50:58,458 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.16ms. Allocated memory is still 167.8MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.48ms. Allocated memory is still 167.8MB. Free memory was 93.6MB in the beginning and 138.5MB in the end (delta: -45.0MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.33ms. Allocated memory is still 167.8MB. Free memory was 138.5MB in the beginning and 135.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.26ms. Allocated memory is still 167.8MB. Free memory was 135.4MB in the beginning and 132.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 384.53ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 116.5MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2756.75ms. Allocated memory was 167.8MB in the beginning and 237.0MB in the end (delta: 69.2MB). Free memory was 115.5MB in the beginning and 122.8MB in the end (delta: -7.3MB). Peak memory consumption was 59.8MB. Max. memory is 16.1GB. * Witness Printer took 3.70ms. Allocated memory is still 237.0MB. Free memory was 122.8MB in the beginning and 121.7MB in the end (delta: 1.0MB). 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 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] unsigned char var_1_2 = 0; [L24] signed char var_1_4 = 16; [L25] signed char var_1_5 = 4; [L26] signed char var_1_6 = 0; [L27] unsigned short int var_1_7 = 0; [L28] unsigned short int var_1_10 = 55182; [L29] unsigned char var_1_12 = 0; [L30] unsigned char var_1_14 = 1; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 100; [L33] signed long int var_1_17 = 2; [L34] signed long int var_1_18 = 199; [L35] signed char var_1_19 = -128; VAL [isInitial=0, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=0, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L62] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L63] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L63] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L64] var_1_4 = __VERIFIER_nondet_char() [L65] CALL assume_abort_if_not(var_1_4 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=0, var_1_7=0] [L65] RET assume_abort_if_not(var_1_4 >= -1) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=0, var_1_7=0] [L66] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=0, var_1_7=0] [L66] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=0, var_1_7=0] [L67] var_1_5 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=0, var_1_7=0] [L68] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=0, var_1_7=0] [L69] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=0, var_1_7=0] [L69] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=0, var_1_7=0] [L70] var_1_6 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_6 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L71] RET assume_abort_if_not(var_1_6 >= -127) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L72] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L72] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L73] var_1_10 = __VERIFIER_nondet_ushort() [L74] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L74] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L75] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L75] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L76] var_1_14 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L77] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L78] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L78] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L79] var_1_15 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L80] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L81] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L81] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=199, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L82] var_1_18 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_18 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=0, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=0, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L83] RET assume_abort_if_not(var_1_18 >= -2147483648) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=0, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L84] CALL assume_abort_if_not(var_1_18 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=0, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=0, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L84] RET assume_abort_if_not(var_1_18 <= 2147483647) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=0, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L97] RET updateVariables() [L98] CALL step() [L39] COND FALSE !(! var_1_2) [L42] var_1_12 = ((! var_1_15) || (! (! 0))) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=2, var_1_18=0, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L44] var_1_16 = var_1_5 [L45] var_1_17 = var_1_18 [L46] var_1_19 = var_1_4 VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=32, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L47] COND FALSE !(var_1_12 || (64.75f < var_1_17)) [L54] var_1_1 = var_1_4 VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=-1, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=0] [L56] COND TRUE (((((var_1_17 * 127.75)) > ((var_1_17 / 3.4))) ? ((var_1_17 * 127.75)) : ((var_1_17 / 3.4)))) >= var_1_17 [L57] var_1_7 = (((((var_1_10 - (22925 - var_1_5))) < (var_1_16)) ? ((var_1_10 - (22925 - var_1_5))) : (var_1_16))) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=-1, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=4] [L98] RET step() [L99] CALL, EXPR property() [L89-L90] return ((((((var_1_12 || (64.75f < var_1_17)) ? (var_1_12 ? (var_1_1 == ((signed char) (var_1_4 - var_1_5))) : (var_1_1 == ((signed char) ((((((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) < (var_1_6)) ? (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6)))))) : (var_1_1 == ((signed char) var_1_4))) && (((((((var_1_17 * 127.75)) > ((var_1_17 / 3.4))) ? ((var_1_17 * 127.75)) : ((var_1_17 / 3.4)))) >= var_1_17) ? (var_1_7 == ((unsigned short int) (((((var_1_10 - (22925 - var_1_5))) < (var_1_16)) ? ((var_1_10 - (22925 - var_1_5))) : (var_1_16))))) : 1)) && ((! var_1_2) ? (var_1_12 == ((unsigned char) var_1_14)) : (var_1_12 == ((unsigned char) ((! var_1_15) || (! (! 0))))))) && (var_1_16 == ((unsigned char) var_1_5))) && (var_1_17 == ((signed long int) var_1_18))) && (var_1_19 == ((signed char) var_1_4)) ; VAL [\result=0, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=-1, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=4] [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=-1, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=4] [L19] reach_error() VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=-1, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_6=5, var_1_7=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 150 mSDsluCounter, 452 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 307 mSDsCounter, 105 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 470 IncrementalHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 105 mSolverCounterUnsat, 145 mSDtfsCounter, 470 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 321 GetRequests, 284 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=2, InterpolantAutomatonStates: 36, 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, 59 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 704 SizeOfPredicates, 1 NumberOfNonLiveVariables, 245 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 1866/1920 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-10 06:50:58,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_no-floats_file-24.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 fbed63e7ceb32b7a0e8cf5dc0c27da185670168d6f706e37fa0256a1876a7a11 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:51:00,752 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:51:00,803 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 06:51:00,807 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:51:00,807 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:51:00,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:51:00,831 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:51:00,831 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:51:00,832 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:51:00,835 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:51:00,835 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:51:00,835 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:51:00,836 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:51:00,836 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:51:00,836 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:51:00,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:51:00,836 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:51:00,837 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:51:00,837 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:51:00,837 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:51:00,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:51:00,840 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:51:00,840 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:51:00,840 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 06:51:00,840 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 06:51:00,841 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:51:00,841 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 06:51:00,841 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:51:00,841 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:51:00,842 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:51:00,842 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:51:00,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:51:00,843 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:51:00,843 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:51:00,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:51:00,844 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:51:00,844 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:51:00,844 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:51:00,844 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 06:51:00,845 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 06:51:00,845 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:51:00,845 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:51:00,845 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:51:00,845 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:51:00,845 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 -> fbed63e7ceb32b7a0e8cf5dc0c27da185670168d6f706e37fa0256a1876a7a11 [2024-11-10 06:51:01,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:51:01,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:51:01,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:51:01,125 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:51:01,126 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:51:01,128 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-24.i [2024-11-10 06:51:02,571 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:51:02,881 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:51:02,881 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-24.i [2024-11-10 06:51:02,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/639390bb1/6aa4ce721e3e43c690ca989692b93e1f/FLAG77d0c68ce [2024-11-10 06:51:02,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/639390bb1/6aa4ce721e3e43c690ca989692b93e1f [2024-11-10 06:51:02,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:51:02,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:51:02,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:51:02,938 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:51:02,944 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:51:02,944 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:51:02" (1/1) ... [2024-11-10 06:51:02,945 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7830543a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:02, skipping insertion in model container [2024-11-10 06:51:02,945 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:51:02" (1/1) ... [2024-11-10 06:51:02,967 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:51:03,104 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_no-floats_file-24.i[916,929] [2024-11-10 06:51:03,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:51:03,172 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:51:03,183 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_no-floats_file-24.i[916,929] [2024-11-10 06:51:03,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:51:03,224 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:51:03,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:03 WrapperNode [2024-11-10 06:51:03,225 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:51:03,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:51:03,226 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:51:03,226 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:51:03,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:03" (1/1) ... [2024-11-10 06:51:03,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:03" (1/1) ... [2024-11-10 06:51:03,276 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2024-11-10 06:51:03,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:51:03,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:51:03,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:51:03,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:51:03,293 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:03" (1/1) ... [2024-11-10 06:51:03,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:03" (1/1) ... [2024-11-10 06:51:03,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:03" (1/1) ... [2024-11-10 06:51:03,340 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-10 06:51:03,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:03" (1/1) ... [2024-11-10 06:51:03,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:03" (1/1) ... [2024-11-10 06:51:03,353 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:03" (1/1) ... [2024-11-10 06:51:03,354 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:03" (1/1) ... [2024-11-10 06:51:03,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:03" (1/1) ... [2024-11-10 06:51:03,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:03" (1/1) ... [2024-11-10 06:51:03,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:51:03,360 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:51:03,360 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:51:03,360 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:51:03,361 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:03" (1/1) ... [2024-11-10 06:51:03,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:51:03,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:51:03,395 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-10 06:51:03,399 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-10 06:51:03,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:51:03,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 06:51:03,434 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:51:03,435 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:51:03,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:51:03,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:51:03,505 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:51:03,507 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:51:16,371 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 06:51:16,371 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:51:16,381 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:51:16,381 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:51:16,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:51:16 BoogieIcfgContainer [2024-11-10 06:51:16,381 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:51:16,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:51:16,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:51:16,386 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:51:16,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:51:02" (1/3) ... [2024-11-10 06:51:16,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45dd9ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:51:16, skipping insertion in model container [2024-11-10 06:51:16,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:03" (2/3) ... [2024-11-10 06:51:16,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45dd9ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:51:16, skipping insertion in model container [2024-11-10 06:51:16,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:51:16" (3/3) ... [2024-11-10 06:51:16,388 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-24.i [2024-11-10 06:51:16,400 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:51:16,400 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:51:16,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:51:16,456 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;@6105e62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:51:16,456 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:51:16,459 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 06:51:16,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-10 06:51:16,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:51:16,468 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:51:16,469 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:51:16,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:51:16,475 INFO L85 PathProgramCache]: Analyzing trace with hash -106170975, now seen corresponding path program 1 times [2024-11-10 06:51:16,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:51:16,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [363098902] [2024-11-10 06:51:16,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:51:16,489 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-10 06:51:16,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:51:16,494 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-10 06:51:16,495 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-10 06:51:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:17,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 06:51:17,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:51:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-11-10 06:51:17,337 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:51:17,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:51:17,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [363098902] [2024-11-10 06:51:17,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [363098902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:51:17,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:51:17,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:51:17,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750980198] [2024-11-10 06:51:17,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:51:17,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:51:17,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:51:17,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:51:17,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:51:17,366 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 06:51:17,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:51:17,386 INFO L93 Difference]: Finished difference Result 94 states and 155 transitions. [2024-11-10 06:51:17,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:51:17,388 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2024-11-10 06:51:17,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:51:17,393 INFO L225 Difference]: With dead ends: 94 [2024-11-10 06:51:17,395 INFO L226 Difference]: Without dead ends: 46 [2024-11-10 06:51:17,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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-10 06:51:17,401 INFO L432 NwaCegarLoop]: 65 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, 65 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-10 06:51:17,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:51:17,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-10 06:51:17,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-10 06:51:17,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 06:51:17,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2024-11-10 06:51:17,435 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 103 [2024-11-10 06:51:17,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:51:17,435 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2024-11-10 06:51:17,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 06:51:17,435 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2024-11-10 06:51:17,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-10 06:51:17,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:51:17,437 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:51:17,459 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-10 06:51:17,639 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-10 06:51:17,639 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:51:17,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:51:17,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1505191329, now seen corresponding path program 1 times [2024-11-10 06:51:17,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:51:17,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095154087] [2024-11-10 06:51:17,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:51:17,642 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-10 06:51:17,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:51:17,645 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-10 06:51:17,651 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-10 06:51:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:18,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 06:51:18,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:51:21,495 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 242 proven. 24 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2024-11-10 06:51:21,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:51:23,979 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-10 06:51:23,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:51:23,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095154087] [2024-11-10 06:51:23,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095154087] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 06:51:23,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 06:51:23,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-11-10 06:51:23,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740064399] [2024-11-10 06:51:23,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 06:51:23,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 06:51:23,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:51:23,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 06:51:23,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-10 06:51:23,983 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2024-11-10 06:51:31,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:51:35,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:51:39,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:51:45,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:51:45,861 INFO L93 Difference]: Finished difference Result 202 states and 270 transitions. [2024-11-10 06:51:45,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-10 06:51:45,866 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 103 [2024-11-10 06:51:45,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:51:45,869 INFO L225 Difference]: With dead ends: 202 [2024-11-10 06:51:45,875 INFO L226 Difference]: Without dead ends: 159 [2024-11-10 06:51:45,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=296, Invalid=760, Unknown=0, NotChecked=0, Total=1056 [2024-11-10 06:51:45,877 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 100 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 69 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:51:45,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 325 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 368 Invalid, 2 Unknown, 0 Unchecked, 18.2s Time] [2024-11-10 06:51:45,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-10 06:51:45,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 57. [2024-11-10 06:51:45,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 06:51:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2024-11-10 06:51:45,910 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 103 [2024-11-10 06:51:45,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:51:45,910 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2024-11-10 06:51:45,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2024-11-10 06:51:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2024-11-10 06:51:45,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-10 06:51:45,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:51:45,912 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:51:45,956 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-10 06:51:46,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:51:46,118 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:51:46,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:51:46,119 INFO L85 PathProgramCache]: Analyzing trace with hash -302263134, now seen corresponding path program 1 times [2024-11-10 06:51:46,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:51:46,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901726167] [2024-11-10 06:51:46,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:51:46,119 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-10 06:51:46,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:51:46,123 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:51:46,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 06:51:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:46,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 06:51:46,930 INFO L278 TraceCheckSpWp]: Computing forward predicates...