./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.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 26d624a9f364a3ec6745ec9e53f7f0150e248a4fcfa20eb8b3a2dbc29bb66a03 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:36:43,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:36:43,892 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:36:43,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:36:43,899 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:36:43,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:36:43,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:36:43,932 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:36:43,932 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:36:43,934 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:36:43,934 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:36:43,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:36:43,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:36:43,937 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:36:43,938 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:36:43,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:36:43,938 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:36:43,939 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:36:43,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:36:43,939 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:36:43,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:36:43,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:36:43,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:36:43,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:36:43,944 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:36:43,944 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:36:43,944 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:36:43,945 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:36:43,945 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:36:43,945 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:36:43,945 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:36:43,945 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:36:43,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:36:43,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:36:43,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:36:43,946 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:36:43,946 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:36:43,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:36:43,947 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:36:43,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:36:43,950 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:36:43,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:36:43,951 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 -> 26d624a9f364a3ec6745ec9e53f7f0150e248a4fcfa20eb8b3a2dbc29bb66a03 [2024-11-10 03:36:44,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:36:44,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:36:44,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:36:44,283 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:36:44,284 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:36:44,285 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i [2024-11-10 03:36:45,775 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:36:46,005 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:36:46,005 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i [2024-11-10 03:36:46,021 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98dfaab7a/c14982a93eb14bd2b4dddebf6d6cc57a/FLAGbe3fbd032 [2024-11-10 03:36:46,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98dfaab7a/c14982a93eb14bd2b4dddebf6d6cc57a [2024-11-10 03:36:46,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:36:46,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:36:46,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:36:46,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:36:46,052 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:36:46,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:36:46" (1/1) ... [2024-11-10 03:36:46,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eae8e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:46, skipping insertion in model container [2024-11-10 03:36:46,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:36:46" (1/1) ... [2024-11-10 03:36:46,087 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:36:46,282 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_codestructure_steplocals_file-77.i[917,930] [2024-11-10 03:36:46,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:36:46,380 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:36:46,393 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_codestructure_steplocals_file-77.i[917,930] [2024-11-10 03:36:46,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:36:46,459 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:36:46,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:46 WrapperNode [2024-11-10 03:36:46,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:36:46,461 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:36:46,462 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:36:46,462 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:36:46,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:46" (1/1) ... [2024-11-10 03:36:46,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:46" (1/1) ... [2024-11-10 03:36:46,535 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 145 [2024-11-10 03:36:46,539 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:36:46,540 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:36:46,540 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:36:46,540 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:36:46,552 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:46" (1/1) ... [2024-11-10 03:36:46,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:46" (1/1) ... [2024-11-10 03:36:46,556 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:46" (1/1) ... [2024-11-10 03:36:46,584 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:36:46,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:46" (1/1) ... [2024-11-10 03:36:46,585 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:46" (1/1) ... [2024-11-10 03:36:46,592 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:46" (1/1) ... [2024-11-10 03:36:46,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:46" (1/1) ... [2024-11-10 03:36:46,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:46" (1/1) ... [2024-11-10 03:36:46,597 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:46" (1/1) ... [2024-11-10 03:36:46,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:36:46,602 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:36:46,605 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:36:46,606 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:36:46,607 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:46" (1/1) ... [2024-11-10 03:36:46,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:36:46,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:36:46,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:36:46,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:36:46,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:36:46,711 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:36:46,712 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:36:46,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:36:46,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:36:46,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:36:46,837 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:36:46,840 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:36:47,278 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-10 03:36:47,278 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:36:47,301 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:36:47,304 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:36:47,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:36:47 BoogieIcfgContainer [2024-11-10 03:36:47,305 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:36:47,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:36:47,307 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:36:47,310 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:36:47,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:36:46" (1/3) ... [2024-11-10 03:36:47,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d522509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:36:47, skipping insertion in model container [2024-11-10 03:36:47,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:46" (2/3) ... [2024-11-10 03:36:47,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d522509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:36:47, skipping insertion in model container [2024-11-10 03:36:47,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:36:47" (3/3) ... [2024-11-10 03:36:47,313 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-77.i [2024-11-10 03:36:47,328 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:36:47,328 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:36:47,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:36:47,393 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;@6ca20d52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:36:47,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:36:47,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 46 states have internal predecessors, (60), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 03:36:47,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 03:36:47,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:36:47,416 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:36:47,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:36:47,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:36:47,422 INFO L85 PathProgramCache]: Analyzing trace with hash -576327340, now seen corresponding path program 1 times [2024-11-10 03:36:47,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:36:47,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903778552] [2024-11-10 03:36:47,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:36:47,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:36:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:47,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:36:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:47,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 03:36:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:47,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 03:36:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:47,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 03:36:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:47,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 03:36:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:47,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 03:36:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:47,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 03:36:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:47,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 03:36:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:47,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:36:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:47,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 03:36:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:47,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 03:36:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:47,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 03:36:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:47,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 03:36:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:47,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 03:36:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:47,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:36:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:47,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 03:36:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:47,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:36:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:47,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 03:36:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:47,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 03:36:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:47,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 03:36:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:47,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 03:36:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:47,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 03:36:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:47,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 03:36:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:47,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 03:36:47,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:36:47,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903778552] [2024-11-10 03:36:47,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903778552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:36:47,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:36:47,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:36:47,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497944893] [2024-11-10 03:36:47,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:36:47,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:36:47,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:36:47,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:36:47,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:36:47,948 INFO L87 Difference]: Start difference. First operand has 71 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 46 states have internal predecessors, (60), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 03:36:47,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:36:47,986 INFO L93 Difference]: Finished difference Result 134 states and 228 transitions. [2024-11-10 03:36:47,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:36:47,989 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 148 [2024-11-10 03:36:47,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:36:47,998 INFO L225 Difference]: With dead ends: 134 [2024-11-10 03:36:47,998 INFO L226 Difference]: Without dead ends: 66 [2024-11-10 03:36:48,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:36:48,008 INFO L432 NwaCegarLoop]: 98 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, 98 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:36:48,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:36:48,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-10 03:36:48,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-10 03:36:48,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 03:36:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2024-11-10 03:36:48,060 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 148 [2024-11-10 03:36:48,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:36:48,061 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2024-11-10 03:36:48,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 03:36:48,061 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2024-11-10 03:36:48,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 03:36:48,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:36:48,065 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:36:48,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:36:48,065 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:36:48,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:36:48,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1749942159, now seen corresponding path program 1 times [2024-11-10 03:36:48,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:36:48,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031599865] [2024-11-10 03:36:48,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:36:48,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:36:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:48,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:36:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:48,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 03:36:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:48,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 03:36:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:48,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 03:36:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:48,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 03:36:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:48,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 03:36:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:48,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 03:36:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:48,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 03:36:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:48,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:36:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:48,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 03:36:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:48,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 03:36:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:48,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 03:36:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:48,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 03:36:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:48,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 03:36:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:48,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:36:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:48,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 03:36:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:48,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:36:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:48,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 03:36:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:48,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 03:36:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:48,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 03:36:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:48,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 03:36:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:48,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 03:36:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:48,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 03:36:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:48,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 03:36:48,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:36:48,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031599865] [2024-11-10 03:36:48,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031599865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:36:48,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:36:48,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:36:48,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578051618] [2024-11-10 03:36:48,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:36:48,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:36:48,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:36:48,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:36:48,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:36:48,788 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 03:36:49,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:36:49,019 INFO L93 Difference]: Finished difference Result 193 states and 289 transitions. [2024-11-10 03:36:49,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:36:49,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 148 [2024-11-10 03:36:49,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:36:49,023 INFO L225 Difference]: With dead ends: 193 [2024-11-10 03:36:49,023 INFO L226 Difference]: Without dead ends: 130 [2024-11-10 03:36:49,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 03:36:49,025 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 80 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:36:49,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 315 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:36:49,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-10 03:36:49,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2024-11-10 03:36:49,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 1.2727272727272727) internal successors, (98), 77 states have internal predecessors, (98), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-10 03:36:49,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 190 transitions. [2024-11-10 03:36:49,070 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 190 transitions. Word has length 148 [2024-11-10 03:36:49,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:36:49,071 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 190 transitions. [2024-11-10 03:36:49,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 03:36:49,072 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 190 transitions. [2024-11-10 03:36:49,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 03:36:49,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:36:49,080 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:36:49,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:36:49,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:36:49,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:36:49,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1721313008, now seen corresponding path program 1 times [2024-11-10 03:36:49,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:36:49,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530501459] [2024-11-10 03:36:49,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:36:49,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:36:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 03:36:49,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1262626871] [2024-11-10 03:36:49,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:36:49,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:36:49,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:36:49,237 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 03:36:49,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 03:36:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:36:49,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:36:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:36:49,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:36:49,632 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:36:49,633 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:36:49,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 03:36:49,835 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-10 03:36:49,839 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 03:36:49,959 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:36:49,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:36:49 BoogieIcfgContainer [2024-11-10 03:36:49,962 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:36:49,963 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:36:49,963 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:36:49,963 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:36:49,964 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:36:47" (3/4) ... [2024-11-10 03:36:49,967 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:36:49,968 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:36:49,969 INFO L158 Benchmark]: Toolchain (without parser) took 3924.36ms. Allocated memory was 159.4MB in the beginning and 195.0MB in the end (delta: 35.7MB). Free memory was 119.7MB in the beginning and 147.5MB in the end (delta: -27.8MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2024-11-10 03:36:49,969 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 107.0MB. Free memory was 79.0MB in the beginning and 78.8MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:36:49,970 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.33ms. Allocated memory is still 159.4MB. Free memory was 119.7MB in the beginning and 104.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 03:36:49,971 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.85ms. Allocated memory is still 159.4MB. Free memory was 104.1MB in the beginning and 100.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:36:49,972 INFO L158 Benchmark]: Boogie Preprocessor took 61.63ms. Allocated memory is still 159.4MB. Free memory was 100.9MB in the beginning and 96.2MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:36:49,972 INFO L158 Benchmark]: IcfgBuilder took 702.82ms. Allocated memory is still 159.4MB. Free memory was 96.2MB in the beginning and 115.0MB in the end (delta: -18.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 03:36:49,972 INFO L158 Benchmark]: TraceAbstraction took 2655.30ms. Allocated memory was 159.4MB in the beginning and 195.0MB in the end (delta: 35.7MB). Free memory was 114.4MB in the beginning and 148.6MB in the end (delta: -34.2MB). Peak memory consumption was 79.5MB. Max. memory is 16.1GB. [2024-11-10 03:36:49,973 INFO L158 Benchmark]: Witness Printer took 5.32ms. Allocated memory is still 195.0MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:36:49,976 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.21ms. Allocated memory is still 107.0MB. Free memory was 79.0MB in the beginning and 78.8MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 414.33ms. Allocated memory is still 159.4MB. Free memory was 119.7MB in the beginning and 104.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.85ms. Allocated memory is still 159.4MB. Free memory was 104.1MB in the beginning and 100.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.63ms. Allocated memory is still 159.4MB. Free memory was 100.9MB in the beginning and 96.2MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 702.82ms. Allocated memory is still 159.4MB. Free memory was 96.2MB in the beginning and 115.0MB in the end (delta: -18.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2655.30ms. Allocated memory was 159.4MB in the beginning and 195.0MB in the end (delta: 35.7MB). Free memory was 114.4MB in the beginning and 148.6MB in the end (delta: -34.2MB). Peak memory consumption was 79.5MB. Max. memory is 16.1GB. * Witness Printer took 5.32ms. Allocated memory is still 195.0MB. Free memory is still 147.5MB. 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 131. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 2; [L23] float var_1_2 = 255.5; [L24] float var_1_3 = 99.8; [L25] signed char var_1_4 = -25; [L26] signed long int var_1_5 = -16; [L27] float var_1_6 = 255.25; [L28] unsigned short int var_1_7 = 16; [L29] signed char var_1_8 = -10; [L30] signed char var_1_9 = -8; [L31] unsigned short int var_1_10 = 8; [L32] unsigned short int var_1_11 = 10000; [L33] unsigned short int var_1_12 = 5; [L34] signed short int var_1_13 = 200; [L35] unsigned char var_1_14 = 0; [L36] unsigned char var_1_15 = 0; [L37] unsigned short int var_1_16 = 35895; [L38] unsigned short int var_1_17 = 18336; [L39] unsigned char var_1_18 = 0; [L40] signed long int var_1_19 = -50; VAL [isInitial=0, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_2=511/2, var_1_3=499/5, var_1_4=-25, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] FCALL updateLastVariables() [L139] CALL updateVariables() [L91] var_1_2 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_3=499/5, var_1_4=-25, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_3=499/5, var_1_4=-25, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L92] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_3=499/5, var_1_4=-25, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L93] var_1_3 = __VERIFIER_nondet_float() [L94] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-25, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-25, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L94] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-25, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L95] var_1_4 = __VERIFIER_nondet_char() [L96] CALL assume_abort_if_not(var_1_4 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L96] RET assume_abort_if_not(var_1_4 >= -127) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L97] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L97] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L98] var_1_5 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L99] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L100] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L100] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L101] var_1_6 = __VERIFIER_nondet_float() [L102] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=16, var_1_8=-10, var_1_9=-8] [L102] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=16, var_1_8=-10, var_1_9=-8] [L103] var_1_7 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_8=-10, var_1_9=-8] [L104] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_8=-10, var_1_9=-8] [L105] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-8] [L105] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-8] [L106] var_1_9 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L107] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L108] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L108] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L109] var_1_11 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_11 >= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L110] RET assume_abort_if_not(var_1_11 >= 8191) VAL [isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L111] CALL assume_abort_if_not(var_1_11 <= 16384) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L111] RET assume_abort_if_not(var_1_11 <= 16384) VAL [isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L112] var_1_12 = __VERIFIER_nondet_ushort() [L113] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=-122881, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=-122881, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L113] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=-122881, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L114] CALL assume_abort_if_not(var_1_12 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L114] RET assume_abort_if_not(var_1_12 <= 16383) VAL [isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L115] var_1_14 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L116] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L117] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L117] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L118] var_1_16 = __VERIFIER_nondet_ushort() [L119] CALL assume_abort_if_not(var_1_16 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L119] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L120] CALL assume_abort_if_not(var_1_16 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L120] RET assume_abort_if_not(var_1_16 <= 65535) VAL [isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L121] var_1_17 = __VERIFIER_nondet_ushort() [L122] CALL assume_abort_if_not(var_1_17 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L122] RET assume_abort_if_not(var_1_17 >= 16383) VAL [isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L123] CALL assume_abort_if_not(var_1_17 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L123] RET assume_abort_if_not(var_1_17 <= 32767) VAL [isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L124] var_1_18 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L125] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L126] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L126] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L139] RET updateVariables() [L140] CALL step() [L44] signed long int stepLocal_0 = (((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)); VAL [isInitial=1, stepLocal_0=127, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L45] COND FALSE !(stepLocal_0 <= var_1_5) [L52] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L54] COND FALSE !((- var_1_7) < (var_1_5 * var_1_4)) VAL [isInitial=1, var_1_10=8, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L57] var_1_10 = (50 + ((var_1_11 + 10000) - var_1_12)) VAL [isInitial=1, var_1_10=1858, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L58] COND FALSE !((var_1_6 * var_1_2) <= var_1_3) VAL [isInitial=1, var_1_10=1858, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L65] signed long int stepLocal_1 = var_1_16 - (var_1_17 - 256); VAL [isInitial=1, stepLocal_1=16640, var_1_10=1858, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L66] COND FALSE !(var_1_3 != var_1_6) [L73] var_1_15 = var_1_18 VAL [isInitial=1, stepLocal_1=16640, var_1_10=1858, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L75] signed long int stepLocal_4 = - var_1_5; [L76] signed long int stepLocal_3 = var_1_7 + (128 + var_1_10); [L77] signed long int stepLocal_2 = ((((var_1_5) < (var_1_17)) ? (var_1_5) : (var_1_17))) / var_1_11; VAL [isInitial=1, stepLocal_1=16640, stepLocal_2=-1, stepLocal_3=1986, stepLocal_4=8191, var_1_10=1858, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L78] COND TRUE var_1_10 < stepLocal_4 VAL [isInitial=1, stepLocal_1=16640, stepLocal_2=-1, stepLocal_3=1986, var_1_10=1858, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L79] COND FALSE !(stepLocal_3 <= var_1_8) VAL [isInitial=1, stepLocal_1=16640, stepLocal_2=-1, var_1_10=1858, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L140] RET step() [L141] CALL, EXPR property() [L131-L132] return ((((((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) <= var_1_5) ? (((- var_1_3) > ((((var_1_2) > (var_1_6)) ? (var_1_2) : (var_1_6)))) ? (var_1_1 == ((unsigned short int) var_1_7)) : (var_1_1 == ((unsigned short int) var_1_7))) : (var_1_1 == ((unsigned short int) var_1_7))) && (((- var_1_7) < (var_1_5 * var_1_4)) ? (var_1_8 == ((signed char) var_1_9)) : 1)) && (var_1_10 == ((unsigned short int) (50 + ((var_1_11 + 10000) - var_1_12))))) && (((var_1_6 * var_1_2) <= var_1_3) ? (var_1_14 ? (var_1_13 == ((signed short int) (-10 + var_1_12))) : (var_1_13 == ((signed short int) var_1_4))) : 1)) && ((var_1_3 != var_1_6) ? ((var_1_1 >= (var_1_16 - (var_1_17 - 256))) ? (var_1_15 == ((unsigned char) var_1_18)) : (var_1_15 == ((unsigned char) var_1_18))) : (var_1_15 == ((unsigned char) var_1_18)))) && ((var_1_10 < (- var_1_5)) ? (((var_1_7 + (128 + var_1_10)) <= var_1_8) ? (var_1_19 == ((signed long int) var_1_4)) : 1) : ((var_1_10 < (((((var_1_5) < (var_1_17)) ? (var_1_5) : (var_1_17))) / var_1_11)) ? (var_1_19 == ((signed long int) ((((var_1_7) > (var_1_9)) ? (var_1_7) : (var_1_9))))) : (var_1_19 == ((signed long int) var_1_16)))) ; VAL [\result=0, isInitial=1, var_1_10=1858, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1858, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] [L19] reach_error() VAL [isInitial=1, var_1_10=1858, var_1_11=-122881, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_4=127, var_1_5=-8191, var_1_7=0, var_1_8=-10, var_1_9=-9] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 80 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 413 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 219 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 73 IncrementalHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 194 mSDtfsCounter, 73 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=2, InterpolantAutomatonStates: 6, 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, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 592 NumberOfCodeBlocks, 592 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 294 ConstructedInterpolants, 0 QuantifiedInterpolants, 552 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2024/2024 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 03:36:50,018 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_codestructure_steplocals_file-77.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 26d624a9f364a3ec6745ec9e53f7f0150e248a4fcfa20eb8b3a2dbc29bb66a03 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:36:52,270 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:36:52,361 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 03:36:52,368 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:36:52,370 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:36:52,401 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:36:52,402 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:36:52,403 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:36:52,403 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:36:52,407 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:36:52,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:36:52,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:36:52,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:36:52,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:36:52,409 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:36:52,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:36:52,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:36:52,410 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:36:52,410 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:36:52,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:36:52,410 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:36:52,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:36:52,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:36:52,412 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:36:52,414 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:36:52,414 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:36:52,414 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:36:52,414 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:36:52,418 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:36:52,418 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:36:52,419 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:36:52,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:36:52,420 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:36:52,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:36:52,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:36:52,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:36:52,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:36:52,421 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:36:52,421 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:36:52,422 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:36:52,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:36:52,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:36:52,422 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:36:52,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:36:52,423 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 -> 26d624a9f364a3ec6745ec9e53f7f0150e248a4fcfa20eb8b3a2dbc29bb66a03 [2024-11-10 03:36:52,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:36:52,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:36:52,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:36:52,767 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:36:52,767 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:36:52,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i [2024-11-10 03:36:54,397 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:36:54,631 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:36:54,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i [2024-11-10 03:36:54,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7e77142f/042876c119ad4ff5891fcb7305947cf1/FLAG761d1800d [2024-11-10 03:36:54,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7e77142f/042876c119ad4ff5891fcb7305947cf1 [2024-11-10 03:36:54,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:36:54,988 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:36:54,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:36:54,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:36:54,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:36:54,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:36:54" (1/1) ... [2024-11-10 03:36:54,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12d11365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:54, skipping insertion in model container [2024-11-10 03:36:54,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:36:54" (1/1) ... [2024-11-10 03:36:55,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:36:55,239 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_codestructure_steplocals_file-77.i[917,930] [2024-11-10 03:36:55,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:36:55,345 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:36:55,359 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_codestructure_steplocals_file-77.i[917,930] [2024-11-10 03:36:55,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:36:55,422 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:36:55,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:55 WrapperNode [2024-11-10 03:36:55,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:36:55,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:36:55,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:36:55,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:36:55,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:55" (1/1) ... [2024-11-10 03:36:55,447 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:55" (1/1) ... [2024-11-10 03:36:55,485 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2024-11-10 03:36:55,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:36:55,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:36:55,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:36:55,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:36:55,504 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:55" (1/1) ... [2024-11-10 03:36:55,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:55" (1/1) ... [2024-11-10 03:36:55,507 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:55" (1/1) ... [2024-11-10 03:36:55,526 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:36:55,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:55" (1/1) ... [2024-11-10 03:36:55,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:55" (1/1) ... [2024-11-10 03:36:55,540 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:55" (1/1) ... [2024-11-10 03:36:55,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:55" (1/1) ... [2024-11-10 03:36:55,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:55" (1/1) ... [2024-11-10 03:36:55,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:55" (1/1) ... [2024-11-10 03:36:55,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:36:55,560 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:36:55,560 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:36:55,560 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:36:55,561 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:55" (1/1) ... [2024-11-10 03:36:55,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:36:55,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:36:55,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:36:55,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:36:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:36:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:36:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:36:55,665 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:36:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:36:55,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:36:55,740 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:36:55,742 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:36:56,548 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-10 03:36:56,548 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:36:56,565 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:36:56,566 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:36:56,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:36:56 BoogieIcfgContainer [2024-11-10 03:36:56,567 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:36:56,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:36:56,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:36:56,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:36:56,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:36:54" (1/3) ... [2024-11-10 03:36:56,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fef10a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:36:56, skipping insertion in model container [2024-11-10 03:36:56,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:36:55" (2/3) ... [2024-11-10 03:36:56,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fef10a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:36:56, skipping insertion in model container [2024-11-10 03:36:56,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:36:56" (3/3) ... [2024-11-10 03:36:56,575 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-77.i [2024-11-10 03:36:56,595 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:36:56,595 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:36:56,669 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:36:56,676 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;@2364ecc7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:36:56,676 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:36:56,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 46 states have internal predecessors, (60), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 03:36:56,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 03:36:56,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:36:56,699 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:36:56,700 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:36:56,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:36:56,704 INFO L85 PathProgramCache]: Analyzing trace with hash -576327340, now seen corresponding path program 1 times [2024-11-10 03:36:56,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:36:56,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1869155257] [2024-11-10 03:36:56,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:36:56,717 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:36:56,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:36:56,721 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:36:56,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 03:36:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:57,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 03:36:57,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:36:57,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-11-10 03:36:57,081 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:36:57,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:36:57,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1869155257] [2024-11-10 03:36:57,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1869155257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:36:57,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:36:57,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:36:57,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668681222] [2024-11-10 03:36:57,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:36:57,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:36:57,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:36:57,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:36:57,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:36:57,124 INFO L87 Difference]: Start difference. First operand has 71 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 46 states have internal predecessors, (60), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 03:36:57,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:36:57,167 INFO L93 Difference]: Finished difference Result 134 states and 228 transitions. [2024-11-10 03:36:57,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:36:57,169 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 148 [2024-11-10 03:36:57,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:36:57,177 INFO L225 Difference]: With dead ends: 134 [2024-11-10 03:36:57,177 INFO L226 Difference]: Without dead ends: 66 [2024-11-10 03:36:57,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:36:57,184 INFO L432 NwaCegarLoop]: 98 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, 98 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:36:57,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:36:57,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-10 03:36:57,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-10 03:36:57,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 03:36:57,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2024-11-10 03:36:57,224 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 148 [2024-11-10 03:36:57,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:36:57,224 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2024-11-10 03:36:57,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 03:36:57,225 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2024-11-10 03:36:57,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 03:36:57,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:36:57,228 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:36:57,237 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-10 03:36:57,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:36:57,429 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:36:57,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:36:57,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1749942159, now seen corresponding path program 1 times [2024-11-10 03:36:57,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:36:57,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121644092] [2024-11-10 03:36:57,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:36:57,432 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:36:57,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:36:57,434 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:36:57,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 03:36:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:57,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 03:36:57,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:36:58,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 03:36:58,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:36:58,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:36:58,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121644092] [2024-11-10 03:36:58,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121644092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:36:58,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:36:58,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:36:58,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986002919] [2024-11-10 03:36:58,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:36:58,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:36:58,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:36:58,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:36:58,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:36:58,394 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 03:36:59,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:36:59,357 INFO L93 Difference]: Finished difference Result 193 states and 289 transitions. [2024-11-10 03:36:59,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:36:59,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 148 [2024-11-10 03:36:59,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:36:59,377 INFO L225 Difference]: With dead ends: 193 [2024-11-10 03:36:59,377 INFO L226 Difference]: Without dead ends: 130 [2024-11-10 03:36:59,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:36:59,379 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 20 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 03:36:59,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 232 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 03:36:59,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-10 03:36:59,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2024-11-10 03:36:59,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 1.2727272727272727) internal successors, (98), 77 states have internal predecessors, (98), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-10 03:36:59,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 190 transitions. [2024-11-10 03:36:59,419 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 190 transitions. Word has length 148 [2024-11-10 03:36:59,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:36:59,420 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 190 transitions. [2024-11-10 03:36:59,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 03:36:59,421 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 190 transitions. [2024-11-10 03:36:59,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 03:36:59,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:36:59,424 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:36:59,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 03:36:59,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:36:59,629 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:36:59,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:36:59,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1721313008, now seen corresponding path program 1 times [2024-11-10 03:36:59,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:36:59,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299215468] [2024-11-10 03:36:59,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:36:59,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:36:59,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:36:59,635 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:36:59,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 03:36:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:36:59,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 03:36:59,967 INFO L278 TraceCheckSpWp]: Computing forward predicates...