./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-23.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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-23.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 ef2666a9bef02f23b38929b9c2ae2fc4af8bff60078da153e2fdf62ec0e0c687 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:47:10,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:47:10,695 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 15:47:10,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:47:10,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:47:10,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:47:10,713 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:47:10,713 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:47:10,713 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:47:10,714 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:47:10,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:47:10,714 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:47:10,714 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:47:10,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:47:10,715 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:47:10,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:47:10,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:47:10,716 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:47:10,716 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 15:47:10,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:47:10,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:47:10,717 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:47:10,718 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:47:10,718 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:47:10,718 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:47:10,718 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:47:10,719 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:47:10,719 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:47:10,719 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:47:10,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:47:10,720 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:47:10,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:47:10,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:47:10,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:47:10,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:47:10,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:47:10,721 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 15:47:10,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 15:47:10,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:47:10,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:47:10,722 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:47:10,723 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:47:10,723 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 -> ef2666a9bef02f23b38929b9c2ae2fc4af8bff60078da153e2fdf62ec0e0c687 [2024-11-16 15:47:10,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:47:10,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:47:10,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:47:10,936 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:47:10,937 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:47:10,938 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-23.i [2024-11-16 15:47:12,125 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:47:12,285 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:47:12,286 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-23.i [2024-11-16 15:47:12,292 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85a88b28/39a72fd0221948ebbbdae410d7039462/FLAG8b577ba16 [2024-11-16 15:47:12,689 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85a88b28/39a72fd0221948ebbbdae410d7039462 [2024-11-16 15:47:12,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:47:12,692 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:47:12,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:47:12,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:47:12,697 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:47:12,697 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:47:12" (1/1) ... [2024-11-16 15:47:12,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@597fa8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:12, skipping insertion in model container [2024-11-16 15:47:12,698 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:47:12" (1/1) ... [2024-11-16 15:47:12,714 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:47:12,847 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-23.i[916,929] [2024-11-16 15:47:12,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:47:12,885 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:47:12,895 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-23.i[916,929] [2024-11-16 15:47:12,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:47:12,928 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:47:12,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:12 WrapperNode [2024-11-16 15:47:12,928 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:47:12,929 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:47:12,929 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:47:12,929 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:47:12,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:12" (1/1) ... [2024-11-16 15:47:12,942 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:12" (1/1) ... [2024-11-16 15:47:12,963 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2024-11-16 15:47:12,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:47:12,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:47:12,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:47:12,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:47:12,972 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:12" (1/1) ... [2024-11-16 15:47:12,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:12" (1/1) ... [2024-11-16 15:47:12,974 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:12" (1/1) ... [2024-11-16 15:47:12,988 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-16 15:47:12,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:12" (1/1) ... [2024-11-16 15:47:12,989 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:12" (1/1) ... [2024-11-16 15:47:12,992 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:12" (1/1) ... [2024-11-16 15:47:12,993 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:12" (1/1) ... [2024-11-16 15:47:12,994 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:12" (1/1) ... [2024-11-16 15:47:12,994 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:12" (1/1) ... [2024-11-16 15:47:12,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:47:13,000 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:47:13,000 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:47:13,000 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:47:13,000 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:12" (1/1) ... [2024-11-16 15:47:13,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:47:13,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:47:13,032 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-16 15:47:13,035 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-16 15:47:13,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:47:13,083 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:47:13,083 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:47:13,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 15:47:13,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:47:13,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:47:13,162 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:47:13,163 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:47:13,366 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-16 15:47:13,367 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:47:13,381 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:47:13,381 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:47:13,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:47:13 BoogieIcfgContainer [2024-11-16 15:47:13,381 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:47:13,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:47:13,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:47:13,387 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:47:13,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:47:12" (1/3) ... [2024-11-16 15:47:13,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4364093a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:47:13, skipping insertion in model container [2024-11-16 15:47:13,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:12" (2/3) ... [2024-11-16 15:47:13,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4364093a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:47:13, skipping insertion in model container [2024-11-16 15:47:13,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:47:13" (3/3) ... [2024-11-16 15:47:13,392 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-23.i [2024-11-16 15:47:13,405 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:47:13,405 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:47:13,463 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:47:13,467 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;@9e3bc2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:47:13,468 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:47:13,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 38 states have internal predecessors, (47), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-16 15:47:13,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-16 15:47:13,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:47:13,486 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:47:13,487 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:47:13,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:47:13,492 INFO L85 PathProgramCache]: Analyzing trace with hash -933050954, now seen corresponding path program 1 times [2024-11-16 15:47:13,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:47:13,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765664650] [2024-11-16 15:47:13,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:47:13,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:47:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:13,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:47:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:13,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:47:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:13,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:47:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:13,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:47:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:13,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:47:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:13,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:47:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:13,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:47:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:13,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:47:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:13,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:47:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:13,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:47:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:13,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 15:47:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:13,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:47:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:13,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 15:47:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:13,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:47:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:13,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 15:47:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:13,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:47:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:13,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 15:47:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:13,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 15:47:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:13,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 15:47:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:13,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 15:47:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:13,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-16 15:47:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:13,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 15:47:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:13,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 15:47:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:13,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 15:47:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:13,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-16 15:47:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-16 15:47:13,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:47:13,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765664650] [2024-11-16 15:47:13,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765664650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:47:13,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:47:13,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:47:13,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210638319] [2024-11-16 15:47:13,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:47:13,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:47:13,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:47:13,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:47:13,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:47:13,898 INFO L87 Difference]: Start difference. First operand has 65 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 38 states have internal predecessors, (47), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-16 15:47:13,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:47:13,919 INFO L93 Difference]: Finished difference Result 122 states and 212 transitions. [2024-11-16 15:47:13,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:47:13,931 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 152 [2024-11-16 15:47:13,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:47:13,938 INFO L225 Difference]: With dead ends: 122 [2024-11-16 15:47:13,938 INFO L226 Difference]: Without dead ends: 60 [2024-11-16 15:47:13,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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-16 15:47:13,943 INFO L432 NwaCegarLoop]: 89 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, 89 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-16 15:47:13,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:47:13,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-16 15:47:14,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-16 15:47:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-16 15:47:14,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2024-11-16 15:47:14,010 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 152 [2024-11-16 15:47:14,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:47:14,010 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2024-11-16 15:47:14,011 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-16 15:47:14,011 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2024-11-16 15:47:14,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-16 15:47:14,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:47:14,020 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:47:14,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 15:47:14,020 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:47:14,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:47:14,021 INFO L85 PathProgramCache]: Analyzing trace with hash 462735671, now seen corresponding path program 1 times [2024-11-16 15:47:14,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:47:14,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832446650] [2024-11-16 15:47:14,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:47:14,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:47:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:15,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:47:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:15,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:47:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:15,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:47:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:15,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:47:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:15,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:47:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:15,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:47:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:15,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:47:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:15,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:47:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:15,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:47:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:15,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:47:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:15,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 15:47:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:15,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:47:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:15,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 15:47:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:15,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:47:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:15,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 15:47:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:15,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:47:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:15,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 15:47:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:15,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 15:47:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:15,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 15:47:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:15,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 15:47:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:15,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-16 15:47:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:15,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 15:47:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:15,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 15:47:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:15,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 15:47:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:15,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-16 15:47:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-16 15:47:15,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:47:15,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832446650] [2024-11-16 15:47:15,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832446650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:47:15,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:47:15,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 15:47:15,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943443023] [2024-11-16 15:47:15,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:47:15,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 15:47:15,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:47:15,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 15:47:15,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-16 15:47:15,702 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (25), 1 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-16 15:47:16,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:47:16,076 INFO L93 Difference]: Finished difference Result 156 states and 220 transitions. [2024-11-16 15:47:16,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 15:47:16,076 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (25), 1 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 1 states have call successors, (25) Word has length 152 [2024-11-16 15:47:16,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:47:16,078 INFO L225 Difference]: With dead ends: 156 [2024-11-16 15:47:16,078 INFO L226 Difference]: Without dead ends: 99 [2024-11-16 15:47:16,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-16 15:47:16,080 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 114 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 15:47:16,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 342 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 15:47:16,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-16 15:47:16,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 69. [2024-11-16 15:47:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-16 15:47:16,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 99 transitions. [2024-11-16 15:47:16,099 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 99 transitions. Word has length 152 [2024-11-16 15:47:16,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:47:16,100 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 99 transitions. [2024-11-16 15:47:16,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (25), 1 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-16 15:47:16,100 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 99 transitions. [2024-11-16 15:47:16,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-16 15:47:16,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:47:16,102 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:47:16,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 15:47:16,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:47:16,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:47:16,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1350239352, now seen corresponding path program 1 times [2024-11-16 15:47:16,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:47:16,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155596997] [2024-11-16 15:47:16,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:47:16,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:47:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 15:47:16,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1874086997] [2024-11-16 15:47:16,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:47:16,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:47:16,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:47:16,210 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-16 15:47:16,211 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-16 15:47:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:47:16,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 15:47:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:47:16,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 15:47:16,391 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 15:47:16,392 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 15:47:16,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 15:47:16,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:47:16,597 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-16 15:47:16,669 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 15:47:16,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:47:16 BoogieIcfgContainer [2024-11-16 15:47:16,674 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 15:47:16,675 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 15:47:16,675 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 15:47:16,675 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 15:47:16,676 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:47:13" (3/4) ... [2024-11-16 15:47:16,677 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 15:47:16,678 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 15:47:16,679 INFO L158 Benchmark]: Toolchain (without parser) took 3986.65ms. Allocated memory was 142.6MB in the beginning and 249.6MB in the end (delta: 107.0MB). Free memory was 68.3MB in the beginning and 110.8MB in the end (delta: -42.5MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. [2024-11-16 15:47:16,679 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 142.6MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:47:16,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.87ms. Allocated memory is still 142.6MB. Free memory was 68.1MB in the beginning and 53.8MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 15:47:16,679 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.18ms. Allocated memory is still 142.6MB. Free memory was 53.8MB in the beginning and 51.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 15:47:16,680 INFO L158 Benchmark]: Boogie Preprocessor took 32.15ms. Allocated memory is still 142.6MB. Free memory was 51.6MB in the beginning and 49.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 15:47:16,680 INFO L158 Benchmark]: IcfgBuilder took 381.90ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 49.1MB in the beginning and 165.4MB in the end (delta: -116.4MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-11-16 15:47:16,680 INFO L158 Benchmark]: TraceAbstraction took 3289.96ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 165.4MB in the beginning and 110.8MB in the end (delta: 54.6MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2024-11-16 15:47:16,680 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 249.6MB. Free memory is still 110.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:47:16,682 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.38ms. Allocated memory is still 142.6MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.87ms. Allocated memory is still 142.6MB. Free memory was 68.1MB in the beginning and 53.8MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.18ms. Allocated memory is still 142.6MB. Free memory was 53.8MB in the beginning and 51.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.15ms. Allocated memory is still 142.6MB. Free memory was 51.6MB in the beginning and 49.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 381.90ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 49.1MB in the beginning and 165.4MB in the end (delta: -116.4MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3289.96ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 165.4MB in the beginning and 110.8MB in the end (delta: 54.6MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 249.6MB. Free memory is still 110.8MB. 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 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 0; [L23] unsigned long int var_1_2 = 16; [L24] unsigned long int var_1_3 = 64; [L25] unsigned long int var_1_4 = 25; [L26] signed long int var_1_5 = 1; [L27] signed long int var_1_6 = 999; [L28] signed long int var_1_7 = 1; [L29] signed long int var_1_8 = 9; [L30] signed long int var_1_9 = 1; [L31] unsigned long int var_1_10 = 16; [L32] unsigned long int var_1_11 = 1277342739; [L33] unsigned long int var_1_12 = 1394088949; [L34] unsigned long int var_1_13 = 0; [L35] unsigned char var_1_14 = 0; [L36] unsigned char var_1_17 = 0; [L37] unsigned char var_1_18 = 0; [L38] unsigned char var_1_19 = 0; VAL [isInitial=0, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=16, var_1_3=64, var_1_4=25, var_1_5=1, var_1_6=999, var_1_7=1, var_1_8=9, var_1_9=1] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] FCALL updateLastVariables() [L111] CALL updateVariables() [L62] var_1_2 = __VERIFIER_nondet_ulong() [L63] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_3=64, var_1_4=25, var_1_5=1, var_1_6=999, var_1_7=1, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_3=64, var_1_4=25, var_1_5=1, var_1_6=999, var_1_7=1, var_1_8=9, var_1_9=1] [L63] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_3=64, var_1_4=25, var_1_5=1, var_1_6=999, var_1_7=1, var_1_8=9, var_1_9=1] [L64] CALL assume_abort_if_not(var_1_2 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=64, var_1_4=25, var_1_5=1, var_1_6=999, var_1_7=1, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=64, var_1_4=25, var_1_5=1, var_1_6=999, var_1_7=1, var_1_8=9, var_1_9=1] [L64] RET assume_abort_if_not(var_1_2 <= 4294967294) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=64, var_1_4=25, var_1_5=1, var_1_6=999, var_1_7=1, var_1_8=9, var_1_9=1] [L65] var_1_3 = __VERIFIER_nondet_ulong() [L66] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_4=25, var_1_5=1, var_1_6=999, var_1_7=1, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_4=25, var_1_5=1, var_1_6=999, var_1_7=1, var_1_8=9, var_1_9=1] [L66] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_4=25, var_1_5=1, var_1_6=999, var_1_7=1, var_1_8=9, var_1_9=1] [L67] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=1, var_1_6=999, var_1_7=1, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=1, var_1_6=999, var_1_7=1, var_1_8=9, var_1_9=1] [L67] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=1, var_1_6=999, var_1_7=1, var_1_8=9, var_1_9=1] [L68] var_1_5 = __VERIFIER_nondet_long() [L69] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=999, var_1_7=1, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=999, var_1_7=1, var_1_8=9, var_1_9=1] [L69] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=999, var_1_7=1, var_1_8=9, var_1_9=1] [L70] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=999, var_1_7=1, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=999, var_1_7=1, var_1_8=9, var_1_9=1] [L70] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=999, var_1_7=1, var_1_8=9, var_1_9=1] [L71] var_1_6 = __VERIFIER_nondet_long() [L72] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=9, var_1_9=1] [L72] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=9, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=9, var_1_9=1] [L73] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=9, var_1_9=1] [L74] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=9, var_1_9=1] [L74] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=9, var_1_9=1] [L75] var_1_7 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=9, var_1_9=1] [L76] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=9, var_1_9=1] [L77] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=9, var_1_9=1] [L77] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=9, var_1_9=1] [L78] var_1_8 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L79] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L80] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L80] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L81] var_1_9 = __VERIFIER_nondet_long() [L82] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L82] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L83] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L83] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L84] var_1_11 = __VERIFIER_nondet_ulong() [L85] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L85] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L86] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L86] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L87] var_1_12 = __VERIFIER_nondet_ulong() [L88] CALL assume_abort_if_not(var_1_12 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L88] RET assume_abort_if_not(var_1_12 >= 1073741824) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L89] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L89] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L90] var_1_13 = __VERIFIER_nondet_ulong() [L91] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L91] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L92] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=2147483647, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=2147483647, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L92] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=2147483647, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L93] var_1_17 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=2147483647, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=2147483647, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L94] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=2147483647, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L95] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=2147483647, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=2147483647, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L95] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=2147483647, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L96] var_1_19 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=2147483647, var_1_14=0, var_1_17=1, var_1_18=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=2147483647, var_1_14=0, var_1_17=1, var_1_18=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L97] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=2147483647, var_1_14=0, var_1_17=1, var_1_18=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L98] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=2147483647, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=2147483647, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L98] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=2147483647, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L111] RET updateVariables() [L112] CALL step() [L42] var_1_1 = ((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=2147483647, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L43] COND TRUE (var_1_5 / var_1_6) <= (var_1_7 + (var_1_8 - var_1_9)) [L44] var_1_4 = ((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=2147483647, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L46] var_1_10 = ((((var_1_2) > (((var_1_11 + var_1_12) - var_1_13))) ? (var_1_2) : (((var_1_11 + var_1_12) - var_1_13)))) [L47] unsigned char stepLocal_0 = (- var_1_5) != 1.9f; VAL [isInitial=1, stepLocal_0=0, var_1_10=0, var_1_11=1073741823, var_1_12=1073741824, var_1_13=2147483647, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L48] COND FALSE !(stepLocal_0 || ((var_1_4 * var_1_13) < var_1_3)) [L51] var_1_18 = var_1_19 VAL [isInitial=1, var_1_10=0, var_1_11=1073741823, var_1_12=1073741824, var_1_13=2147483647, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L53] COND FALSE !(\read(var_1_18)) VAL [isInitial=1, var_1_10=0, var_1_11=1073741823, var_1_12=1073741824, var_1_13=2147483647, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L112] RET step() [L113] CALL, EXPR property() [L103-L104] return ((((var_1_1 == ((unsigned long int) ((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) && (((var_1_5 / var_1_6) <= (var_1_7 + (var_1_8 - var_1_9))) ? (var_1_4 == ((unsigned long int) ((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) : 1)) && (var_1_10 == ((unsigned long int) ((((var_1_2) > (((var_1_11 + var_1_12) - var_1_13))) ? (var_1_2) : (((var_1_11 + var_1_12) - var_1_13))))))) && (var_1_18 ? ((! ((var_1_5 / var_1_6) < (var_1_8 - var_1_9))) ? (var_1_18 ? (var_1_14 == ((unsigned char) (! var_1_17))) : 1) : 1) : 1)) && ((((- var_1_5) != 1.9f) || ((var_1_4 * var_1_13) < var_1_3)) ? (var_1_18 == ((unsigned char) (! var_1_19))) : (var_1_18 == ((unsigned char) var_1_19))) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=1073741823, var_1_12=1073741824, var_1_13=2147483647, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=1073741823, var_1_12=1073741824, var_1_13=2147483647, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=1073741823, var_1_12=1073741824, var_1_13=2147483647, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 3, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 137 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114 mSDsluCounter, 431 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 275 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 366 IncrementalHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 156 mSDtfsCounter, 366 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=2, InterpolantAutomatonStates: 15, 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, 30 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 608 NumberOfCodeBlocks, 608 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 302 ConstructedInterpolants, 0 QuantifiedInterpolants, 530 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2400/2400 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-16 15:47:16,699 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-23.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 ef2666a9bef02f23b38929b9c2ae2fc4af8bff60078da153e2fdf62ec0e0c687 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:47:18,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:47:18,533 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 15:47:18,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:47:18,539 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:47:18,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:47:18,561 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:47:18,561 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:47:18,562 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:47:18,564 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:47:18,565 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:47:18,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:47:18,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:47:18,565 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:47:18,565 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:47:18,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:47:18,566 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:47:18,566 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:47:18,566 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:47:18,566 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:47:18,566 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:47:18,567 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:47:18,568 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:47:18,568 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 15:47:18,568 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 15:47:18,568 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:47:18,568 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 15:47:18,568 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:47:18,569 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:47:18,569 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:47:18,569 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:47:18,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:47:18,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:47:18,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:47:18,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:47:18,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:47:18,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:47:18,570 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:47:18,570 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 15:47:18,570 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 15:47:18,570 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:47:18,571 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:47:18,571 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:47:18,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:47:18,572 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 -> ef2666a9bef02f23b38929b9c2ae2fc4af8bff60078da153e2fdf62ec0e0c687 [2024-11-16 15:47:18,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:47:18,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:47:18,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:47:18,833 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:47:18,836 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:47:18,837 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-23.i [2024-11-16 15:47:20,082 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:47:20,228 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:47:20,231 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-23.i [2024-11-16 15:47:20,237 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/017488d1f/a89d554bdaaf493eb16baea02e0614ac/FLAG804c82763 [2024-11-16 15:47:20,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/017488d1f/a89d554bdaaf493eb16baea02e0614ac [2024-11-16 15:47:20,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:47:20,641 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:47:20,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:47:20,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:47:20,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:47:20,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:47:20" (1/1) ... [2024-11-16 15:47:20,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7307415d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:20, skipping insertion in model container [2024-11-16 15:47:20,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:47:20" (1/1) ... [2024-11-16 15:47:20,667 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:47:20,817 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-23.i[916,929] [2024-11-16 15:47:20,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:47:20,875 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:47:20,886 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-23.i[916,929] [2024-11-16 15:47:20,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:47:20,929 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:47:20,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:20 WrapperNode [2024-11-16 15:47:20,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:47:20,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:47:20,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:47:20,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:47:20,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:20" (1/1) ... [2024-11-16 15:47:20,946 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:20" (1/1) ... [2024-11-16 15:47:20,969 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2024-11-16 15:47:20,972 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:47:20,973 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:47:20,973 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:47:20,973 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:47:20,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:20" (1/1) ... [2024-11-16 15:47:20,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:20" (1/1) ... [2024-11-16 15:47:20,987 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:20" (1/1) ... [2024-11-16 15:47:21,003 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-16 15:47:21,007 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:20" (1/1) ... [2024-11-16 15:47:21,007 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:20" (1/1) ... [2024-11-16 15:47:21,016 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:20" (1/1) ... [2024-11-16 15:47:21,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:20" (1/1) ... [2024-11-16 15:47:21,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:20" (1/1) ... [2024-11-16 15:47:21,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:20" (1/1) ... [2024-11-16 15:47:21,023 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:47:21,027 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:47:21,027 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:47:21,027 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:47:21,028 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:20" (1/1) ... [2024-11-16 15:47:21,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:47:21,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:47:21,062 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-16 15:47:21,065 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-16 15:47:21,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:47:21,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 15:47:21,098 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:47:21,098 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:47:21,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:47:21,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:47:21,165 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:47:21,167 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:47:21,654 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-16 15:47:21,655 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:47:21,666 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:47:21,667 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:47:21,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:47:21 BoogieIcfgContainer [2024-11-16 15:47:21,668 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:47:21,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:47:21,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:47:21,673 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:47:21,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:47:20" (1/3) ... [2024-11-16 15:47:21,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36abc4ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:47:21, skipping insertion in model container [2024-11-16 15:47:21,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:20" (2/3) ... [2024-11-16 15:47:21,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36abc4ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:47:21, skipping insertion in model container [2024-11-16 15:47:21,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:47:21" (3/3) ... [2024-11-16 15:47:21,678 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-23.i [2024-11-16 15:47:21,692 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:47:21,692 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:47:21,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:47:21,760 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;@500adc3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:47:21,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:47:21,763 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 38 states have internal predecessors, (47), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-16 15:47:21,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-16 15:47:21,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:47:21,775 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:47:21,776 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:47:21,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:47:21,779 INFO L85 PathProgramCache]: Analyzing trace with hash -933050954, now seen corresponding path program 1 times [2024-11-16 15:47:21,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:47:21,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126819300] [2024-11-16 15:47:21,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:47:21,791 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-16 15:47:21,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:47:21,794 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-16 15:47:21,795 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-16 15:47:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:21,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 15:47:22,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:47:22,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2024-11-16 15:47:22,048 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:47:22,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:47:22,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126819300] [2024-11-16 15:47:22,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [126819300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:47:22,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:47:22,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:47:22,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737070047] [2024-11-16 15:47:22,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:47:22,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:47:22,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:47:22,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:47:22,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:47:22,077 INFO L87 Difference]: Start difference. First operand has 65 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 38 states have internal predecessors, (47), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-16 15:47:22,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:47:22,106 INFO L93 Difference]: Finished difference Result 122 states and 212 transitions. [2024-11-16 15:47:22,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:47:22,108 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 152 [2024-11-16 15:47:22,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:47:22,115 INFO L225 Difference]: With dead ends: 122 [2024-11-16 15:47:22,116 INFO L226 Difference]: Without dead ends: 60 [2024-11-16 15:47:22,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 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-16 15:47:22,123 INFO L432 NwaCegarLoop]: 89 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, 89 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-16 15:47:22,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:47:22,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-16 15:47:22,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-16 15:47:22,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-16 15:47:22,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2024-11-16 15:47:22,177 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 152 [2024-11-16 15:47:22,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:47:22,177 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2024-11-16 15:47:22,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-16 15:47:22,178 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2024-11-16 15:47:22,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-16 15:47:22,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:47:22,184 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:47:22,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 15:47:22,384 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-16 15:47:22,385 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:47:22,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:47:22,386 INFO L85 PathProgramCache]: Analyzing trace with hash 462735671, now seen corresponding path program 1 times [2024-11-16 15:47:22,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:47:22,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932113835] [2024-11-16 15:47:22,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:47:22,389 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-16 15:47:22,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:47:22,391 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-16 15:47:22,393 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-16 15:47:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:22,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 15:47:22,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:47:22,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-16 15:47:22,705 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:47:22,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:47:22,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932113835] [2024-11-16 15:47:22,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932113835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:47:22,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:47:22,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 15:47:22,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019019535] [2024-11-16 15:47:22,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:47:22,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 15:47:22,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:47:22,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 15:47:22,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 15:47:22,709 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (25), 1 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-16 15:47:23,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:47:23,638 INFO L93 Difference]: Finished difference Result 190 states and 275 transitions. [2024-11-16 15:47:23,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 15:47:23,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (25), 1 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 1 states have call successors, (25) Word has length 152 [2024-11-16 15:47:23,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:47:23,641 INFO L225 Difference]: With dead ends: 190 [2024-11-16 15:47:23,641 INFO L226 Difference]: Without dead ends: 133 [2024-11-16 15:47:23,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-11-16 15:47:23,643 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 106 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 15:47:23,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 275 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 15:47:23,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-16 15:47:23,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 67. [2024-11-16 15:47:23,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-16 15:47:23,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2024-11-16 15:47:23,667 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 152 [2024-11-16 15:47:23,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:47:23,668 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2024-11-16 15:47:23,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (25), 1 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-16 15:47:23,668 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2024-11-16 15:47:23,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-16 15:47:23,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:47:23,671 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:47:23,678 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-16 15:47:23,871 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-16 15:47:23,872 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:47:23,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:47:23,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1350239352, now seen corresponding path program 1 times [2024-11-16 15:47:23,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:47:23,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016865666] [2024-11-16 15:47:23,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:47:23,873 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-16 15:47:23,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:47:23,876 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-16 15:47:23,876 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-16 15:47:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:23,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 15:47:24,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:47:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 318 proven. 9 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2024-11-16 15:47:25,721 INFO L311 TraceCheckSpWp]: Computing backward predicates...