./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-wip.fs.cvc5-61a6796-m [2024-10-14 07:45:20,835 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:45:20,924 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 07:45:20,932 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:45:20,933 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:45:20,966 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:45:20,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:45:20,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:45:20,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:45:20,968 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:45:20,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:45:20,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:45:20,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:45:20,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:45:20,971 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:45:20,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:45:20,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:45:20,972 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:45:20,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 07:45:20,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:45:20,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:45:20,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:45:20,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:45:20,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:45:20,978 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:45:20,978 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:45:20,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:45:20,978 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:45:20,979 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:45:20,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:45:20,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:45:20,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:45:20,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:45:20,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:45:20,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:45:20,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:45:20,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 07:45:20,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 07:45:20,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:45:20,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:45:20,982 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:45:20,983 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:45:20,983 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-10-14 07:45:21,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:45:21,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:45:21,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:45:21,278 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:45:21,279 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:45:21,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i [2024-10-14 07:45:22,721 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:45:22,918 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:45:22,919 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i [2024-10-14 07:45:22,931 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca28d6cb2/add4367f78ef44ca95efcd2065ed6e6a/FLAGb8d6dd66e [2024-10-14 07:45:23,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca28d6cb2/add4367f78ef44ca95efcd2065ed6e6a [2024-10-14 07:45:23,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:45:23,285 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:45:23,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:45:23,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:45:23,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:45:23,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:45:23" (1/1) ... [2024-10-14 07:45:23,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b12e8eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:23, skipping insertion in model container [2024-10-14 07:45:23,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:45:23" (1/1) ... [2024-10-14 07:45:23,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:45:23,487 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i[917,930] [2024-10-14 07:45:23,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:45:23,585 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:45:23,597 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i[917,930] [2024-10-14 07:45:23,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:45:23,656 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:45:23,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:23 WrapperNode [2024-10-14 07:45:23,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:45:23,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:45:23,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:45:23,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:45:23,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:23" (1/1) ... [2024-10-14 07:45:23,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:23" (1/1) ... [2024-10-14 07:45:23,718 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2024-10-14 07:45:23,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:45:23,723 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:45:23,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:45:23,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:45:23,735 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:23" (1/1) ... [2024-10-14 07:45:23,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:23" (1/1) ... [2024-10-14 07:45:23,740 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:23" (1/1) ... [2024-10-14 07:45:23,761 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 07:45:23,762 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:23" (1/1) ... [2024-10-14 07:45:23,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:23" (1/1) ... [2024-10-14 07:45:23,774 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:23" (1/1) ... [2024-10-14 07:45:23,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:23" (1/1) ... [2024-10-14 07:45:23,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:23" (1/1) ... [2024-10-14 07:45:23,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:23" (1/1) ... [2024-10-14 07:45:23,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:45:23,791 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:45:23,791 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:45:23,792 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:45:23,792 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:23" (1/1) ... [2024-10-14 07:45:23,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:45:23,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:45:23,832 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-10-14 07:45:23,839 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-10-14 07:45:23,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:45:23,886 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:45:23,887 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:45:23,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 07:45:23,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:45:23,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:45:23,979 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:45:23,981 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:45:24,332 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-14 07:45:24,333 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:45:24,388 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:45:24,388 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:45:24,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:45:24 BoogieIcfgContainer [2024-10-14 07:45:24,389 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:45:24,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:45:24,391 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:45:24,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:45:24,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:45:23" (1/3) ... [2024-10-14 07:45:24,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df94562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:45:24, skipping insertion in model container [2024-10-14 07:45:24,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:23" (2/3) ... [2024-10-14 07:45:24,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df94562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:45:24, skipping insertion in model container [2024-10-14 07:45:24,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:45:24" (3/3) ... [2024-10-14 07:45:24,397 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-77.i [2024-10-14 07:45:24,414 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:45:24,414 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:45:24,472 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:45:24,479 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;@25312916, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:45:24,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:45:24,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 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-10-14 07:45:24,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 07:45:24,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:45:24,499 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] [2024-10-14 07:45:24,500 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:45:24,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:45:24,505 INFO L85 PathProgramCache]: Analyzing trace with hash -731401140, now seen corresponding path program 1 times [2024-10-14 07:45:24,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:45:24,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759536816] [2024-10-14 07:45:24,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:45:24,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:45:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:24,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:45:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:24,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 07:45:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:24,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 07:45:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:24,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 07:45:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:24,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 07:45:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:24,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 07:45:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:24,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 07:45:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:24,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 07:45:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:24,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 07:45:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:24,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 07:45:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:24,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:45:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:24,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 07:45:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:24,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 07:45:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:24,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 07:45:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:24,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 07:45:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:24,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 07:45:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:24,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 07:45:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:24,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 07:45:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:24,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 07:45:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:24,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 07:45:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:24,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 07:45:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:24,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 07:45:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:24,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 07:45:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:24,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-14 07:45:24,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:45:24,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759536816] [2024-10-14 07:45:24,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759536816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:45:24,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:45:24,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:45:24,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550236731] [2024-10-14 07:45:24,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:45:25,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:45:25,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:45:25,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:45:25,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:45:25,029 INFO L87 Difference]: Start difference. First operand has 62 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-10-14 07:45:25,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:45:25,073 INFO L93 Difference]: Finished difference Result 121 states and 215 transitions. [2024-10-14 07:45:25,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:45:25,076 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (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 142 [2024-10-14 07:45:25,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:45:25,088 INFO L225 Difference]: With dead ends: 121 [2024-10-14 07:45:25,088 INFO L226 Difference]: Without dead ends: 60 [2024-10-14 07:45:25,092 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-10-14 07:45:25,097 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:45:25,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:45:25,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-14 07:45:25,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-14 07:45:25,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 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-10-14 07:45:25,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 92 transitions. [2024-10-14 07:45:25,142 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 92 transitions. Word has length 142 [2024-10-14 07:45:25,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:45:25,146 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 92 transitions. [2024-10-14 07:45:25,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (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-10-14 07:45:25,146 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 92 transitions. [2024-10-14 07:45:25,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 07:45:25,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:45:25,152 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] [2024-10-14 07:45:25,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 07:45:25,152 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:45:25,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:45:25,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1451628806, now seen corresponding path program 1 times [2024-10-14 07:45:25,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:45:25,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583573246] [2024-10-14 07:45:25,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:45:25,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:45:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:25,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:45:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:25,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 07:45:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:25,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 07:45:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:25,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 07:45:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:25,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 07:45:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:25,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 07:45:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:25,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 07:45:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:25,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 07:45:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:25,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 07:45:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:25,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 07:45:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:25,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:45:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:25,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 07:45:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:25,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 07:45:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:25,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 07:45:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:25,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 07:45:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:25,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 07:45:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:25,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 07:45:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:25,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 07:45:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:25,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 07:45:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:25,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 07:45:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:25,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 07:45:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:25,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 07:45:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:25,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 07:45:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:25,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-14 07:45:25,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:45:25,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583573246] [2024-10-14 07:45:25,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583573246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:45:25,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:45:25,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 07:45:25,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857428829] [2024-10-14 07:45:25,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:45:25,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:45:25,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:45:25,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:45:25,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:45:25,788 INFO L87 Difference]: Start difference. First operand 60 states and 92 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-10-14 07:45:26,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:45:26,129 INFO L93 Difference]: Finished difference Result 156 states and 232 transitions. [2024-10-14 07:45:26,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:45:26,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 142 [2024-10-14 07:45:26,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:45:26,134 INFO L225 Difference]: With dead ends: 156 [2024-10-14 07:45:26,134 INFO L226 Difference]: Without dead ends: 97 [2024-10-14 07:45:26,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:45:26,136 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 120 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 07:45:26,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 185 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 07:45:26,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-14 07:45:26,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2024-10-14 07:45:26,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 59 states have (on average 1.305084745762712) internal successors, (77), 60 states have internal predecessors, (77), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 07:45:26,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2024-10-14 07:45:26,164 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 142 [2024-10-14 07:45:26,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:45:26,165 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2024-10-14 07:45:26,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-10-14 07:45:26,165 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2024-10-14 07:45:26,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 07:45:26,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:45:26,167 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] [2024-10-14 07:45:26,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 07:45:26,168 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:45:26,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:45:26,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1451688388, now seen corresponding path program 1 times [2024-10-14 07:45:26,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:45:26,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703843918] [2024-10-14 07:45:26,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:45:26,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:45:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 07:45:26,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1097903070] [2024-10-14 07:45:26,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:45:26,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:45:26,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:45:26,263 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-10-14 07:45:26,267 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-10-14 07:45:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:45:26,460 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 07:45:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:45:26,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 07:45:26,580 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 07:45:26,581 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 07:45:26,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 07:45:26,783 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-10-14 07:45:26,786 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-14 07:45:26,889 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 07:45:26,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:45:26 BoogieIcfgContainer [2024-10-14 07:45:26,893 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 07:45:26,893 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 07:45:26,893 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 07:45:26,893 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 07:45:26,894 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:45:24" (3/4) ... [2024-10-14 07:45:26,896 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 07:45:26,897 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 07:45:26,898 INFO L158 Benchmark]: Toolchain (without parser) took 3612.67ms. Allocated memory was 151.0MB in the beginning and 188.7MB in the end (delta: 37.7MB). Free memory was 99.2MB in the beginning and 133.2MB in the end (delta: -34.0MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2024-10-14 07:45:26,898 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 111.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:45:26,899 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.65ms. Allocated memory is still 151.0MB. Free memory was 98.8MB in the beginning and 84.2MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 07:45:26,899 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.87ms. Allocated memory is still 151.0MB. Free memory was 84.2MB in the beginning and 80.7MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 07:45:26,899 INFO L158 Benchmark]: Boogie Preprocessor took 67.26ms. Allocated memory is still 151.0MB. Free memory was 80.7MB in the beginning and 76.1MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 07:45:26,900 INFO L158 Benchmark]: RCFGBuilder took 597.75ms. Allocated memory is still 151.0MB. Free memory was 76.1MB in the beginning and 109.3MB in the end (delta: -33.2MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-10-14 07:45:26,900 INFO L158 Benchmark]: TraceAbstraction took 2501.75ms. Allocated memory was 151.0MB in the beginning and 188.7MB in the end (delta: 37.7MB). Free memory was 108.0MB in the beginning and 133.2MB in the end (delta: -25.2MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2024-10-14 07:45:26,901 INFO L158 Benchmark]: Witness Printer took 4.03ms. Allocated memory is still 188.7MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:45:26,903 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 111.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.65ms. Allocated memory is still 151.0MB. Free memory was 98.8MB in the beginning and 84.2MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.87ms. Allocated memory is still 151.0MB. Free memory was 84.2MB in the beginning and 80.7MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.26ms. Allocated memory is still 151.0MB. Free memory was 80.7MB in the beginning and 76.1MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 597.75ms. Allocated memory is still 151.0MB. Free memory was 76.1MB in the beginning and 109.3MB in the end (delta: -33.2MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2501.75ms. Allocated memory was 151.0MB in the beginning and 188.7MB in the end (delta: 37.7MB). Free memory was 108.0MB in the beginning and 133.2MB in the end (delta: -25.2MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * Witness Printer took 4.03ms. Allocated memory is still 188.7MB. Free memory is still 133.2MB. 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; [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=2, 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=2, 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=2, 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=2, 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=2, 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=2, 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=2, 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=2, 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=2, 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=2, 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=2, 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=2, 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=2, 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=2, 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=2, 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=2, 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=2, 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=2, 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=2, var_1_5=-8191, var_1_7=16383, 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=2, var_1_5=-8191, var_1_7=16383, 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=2, var_1_5=-8191, var_1_7=16383, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [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=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L110] RET assume_abort_if_not(var_1_11 >= 8191) VAL [isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L111] CALL assume_abort_if_not(var_1_11 <= 16384) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L111] RET assume_abort_if_not(var_1_11 <= 16384) VAL [isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [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=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L113] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L114] CALL assume_abort_if_not(var_1_12 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L114] RET assume_abort_if_not(var_1_12 <= 16383) VAL [isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [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=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L116] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L117] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L117] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [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=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L119] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L120] CALL assume_abort_if_not(var_1_16 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L120] RET assume_abort_if_not(var_1_16 <= 65535) VAL [isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [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=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L122] RET assume_abort_if_not(var_1_17 >= 16383) VAL [isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L123] CALL assume_abort_if_not(var_1_17 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L123] RET assume_abort_if_not(var_1_17 <= 32767) VAL [isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [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=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L125] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L126] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L126] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [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=2, var_1_10=8, var_1_11=73727, 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=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [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=73727, 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=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L54] COND TRUE (- var_1_7) < (var_1_5 * var_1_4) [L55] var_1_8 = var_1_9 VAL [isInitial=1, var_1_10=8, var_1_11=73727, 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=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-127, var_1_9=-127] [L57] var_1_10 = (50 + ((var_1_11 + 10000) - var_1_12)) VAL [isInitial=1, var_1_10=1858, var_1_11=73727, 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=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-127, var_1_9=-127] [L58] COND FALSE !((var_1_6 * var_1_2) <= var_1_3) VAL [isInitial=1, var_1_10=1858, var_1_11=73727, 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=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-127, var_1_9=-127] [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=73727, 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=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-127, var_1_9=-127] [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=73727, 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=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-127, var_1_9=-127] [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=18369, stepLocal_4=8191, var_1_10=1858, var_1_11=73727, 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=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-127, var_1_9=-127] [L78] COND TRUE var_1_10 < stepLocal_4 VAL [isInitial=1, stepLocal_1=16640, stepLocal_2=-1, stepLocal_3=18369, var_1_10=1858, var_1_11=73727, 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=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-127, var_1_9=-127] [L79] COND FALSE !(stepLocal_3 <= var_1_8) VAL [isInitial=1, stepLocal_1=16640, stepLocal_2=-1, var_1_10=1858, var_1_11=73727, 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=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-127, var_1_9=-127] [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)))) ; [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1858, var_1_11=73727, 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=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-127, var_1_9=-127] [L19] reach_error() VAL [isInitial=1, var_1_10=1858, var_1_11=73727, 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=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-127, var_1_9=-127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 120 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 120 mSDsluCounter, 274 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 106 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 105 IncrementalHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 168 mSDtfsCounter, 105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 568 NumberOfCodeBlocks, 568 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 570 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-10-14 07:45:26,933 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/current/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 /storage/repos/ultimate/releaseScripts/default/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-wip.fs.cvc5-61a6796-m [2024-10-14 07:45:29,160 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:45:29,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 07:45:29,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:45:29,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:45:29,295 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:45:29,295 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:45:29,295 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:45:29,296 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:45:29,296 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:45:29,296 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:45:29,297 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:45:29,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:45:29,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:45:29,302 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:45:29,302 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:45:29,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:45:29,302 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:45:29,303 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:45:29,303 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:45:29,303 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:45:29,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:45:29,305 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:45:29,305 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 07:45:29,305 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 07:45:29,306 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:45:29,306 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 07:45:29,306 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:45:29,307 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:45:29,307 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:45:29,307 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:45:29,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:45:29,308 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:45:29,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:45:29,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:45:29,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:45:29,310 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:45:29,310 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:45:29,310 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 07:45:29,311 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 07:45:29,311 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:45:29,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:45:29,311 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:45:29,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:45:29,312 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 07:45:29,312 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-10-14 07:45:29,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:45:29,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:45:29,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:45:29,673 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:45:29,674 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:45:29,676 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i [2024-10-14 07:45:31,274 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:45:31,478 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:45:31,478 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i [2024-10-14 07:45:31,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a505bffa/19b3f00f82cc408da7050bc63ea94d1d/FLAG5ecd7e6e6 [2024-10-14 07:45:31,845 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a505bffa/19b3f00f82cc408da7050bc63ea94d1d [2024-10-14 07:45:31,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:45:31,848 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:45:31,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:45:31,849 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:45:31,855 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:45:31,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:45:31" (1/1) ... [2024-10-14 07:45:31,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41650158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:31, skipping insertion in model container [2024-10-14 07:45:31,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:45:31" (1/1) ... [2024-10-14 07:45:31,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:45:32,060 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i[917,930] [2024-10-14 07:45:32,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:45:32,158 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:45:32,177 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i[917,930] [2024-10-14 07:45:32,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:45:32,237 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:45:32,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:32 WrapperNode [2024-10-14 07:45:32,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:45:32,239 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:45:32,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:45:32,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:45:32,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:32" (1/1) ... [2024-10-14 07:45:32,262 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:32" (1/1) ... [2024-10-14 07:45:32,300 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2024-10-14 07:45:32,303 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:45:32,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:45:32,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:45:32,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:45:32,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:32" (1/1) ... [2024-10-14 07:45:32,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:32" (1/1) ... [2024-10-14 07:45:32,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:32" (1/1) ... [2024-10-14 07:45:32,337 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 07:45:32,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:32" (1/1) ... [2024-10-14 07:45:32,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:32" (1/1) ... [2024-10-14 07:45:32,357 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:32" (1/1) ... [2024-10-14 07:45:32,363 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:32" (1/1) ... [2024-10-14 07:45:32,365 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:32" (1/1) ... [2024-10-14 07:45:32,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:32" (1/1) ... [2024-10-14 07:45:32,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:45:32,378 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:45:32,379 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:45:32,379 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:45:32,380 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:32" (1/1) ... [2024-10-14 07:45:32,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:45:32,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:45:32,427 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-10-14 07:45:32,435 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-10-14 07:45:32,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:45:32,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 07:45:32,476 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:45:32,477 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:45:32,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:45:32,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:45:32,570 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:45:32,572 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:45:33,411 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-14 07:45:33,411 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:45:33,465 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:45:33,466 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:45:33,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:45:33 BoogieIcfgContainer [2024-10-14 07:45:33,466 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:45:33,479 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:45:33,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:45:33,484 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:45:33,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:45:31" (1/3) ... [2024-10-14 07:45:33,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70174e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:45:33, skipping insertion in model container [2024-10-14 07:45:33,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:45:32" (2/3) ... [2024-10-14 07:45:33,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70174e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:45:33, skipping insertion in model container [2024-10-14 07:45:33,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:45:33" (3/3) ... [2024-10-14 07:45:33,490 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-77.i [2024-10-14 07:45:33,507 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:45:33,508 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:45:33,584 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:45:33,591 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;@6847c5e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:45:33,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:45:33,598 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 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-10-14 07:45:33,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 07:45:33,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:45:33,614 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] [2024-10-14 07:45:33,615 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:45:33,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:45:33,620 INFO L85 PathProgramCache]: Analyzing trace with hash -731401140, now seen corresponding path program 1 times [2024-10-14 07:45:33,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:45:33,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074391256] [2024-10-14 07:45:33,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:45:33,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-10-14 07:45:33,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:45:33,636 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-10-14 07:45:33,637 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-10-14 07:45:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:33,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 07:45:33,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:45:34,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 512 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-10-14 07:45:34,021 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:45:34,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:45:34,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074391256] [2024-10-14 07:45:34,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074391256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:45:34,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:45:34,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:45:34,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727559348] [2024-10-14 07:45:34,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:45:34,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:45:34,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:45:34,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:45:34,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:45:34,058 INFO L87 Difference]: Start difference. First operand has 62 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 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 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-10-14 07:45:34,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:45:34,572 INFO L93 Difference]: Finished difference Result 121 states and 215 transitions. [2024-10-14 07:45:34,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:45:34,588 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (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 142 [2024-10-14 07:45:34,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:45:34,596 INFO L225 Difference]: With dead ends: 121 [2024-10-14 07:45:34,596 INFO L226 Difference]: Without dead ends: 60 [2024-10-14 07:45:34,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:45:34,603 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 07:45:34,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 07:45:34,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-14 07:45:34,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-14 07:45:34,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 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-10-14 07:45:34,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 92 transitions. [2024-10-14 07:45:34,650 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 92 transitions. Word has length 142 [2024-10-14 07:45:34,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:45:34,652 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 92 transitions. [2024-10-14 07:45:34,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (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-10-14 07:45:34,653 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 92 transitions. [2024-10-14 07:45:34,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 07:45:34,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:45:34,665 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] [2024-10-14 07:45:34,677 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-10-14 07:45:34,865 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-10-14 07:45:34,866 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:45:34,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:45:34,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1451628806, now seen corresponding path program 1 times [2024-10-14 07:45:34,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:45:34,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380768197] [2024-10-14 07:45:34,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:45:34,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:45:34,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:45:34,870 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-10-14 07:45:34,872 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-10-14 07:45:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:35,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 07:45:35,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:45:36,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 590 proven. 78 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2024-10-14 07:45:36,236 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:45:36,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-14 07:45:36,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:45:36,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380768197] [2024-10-14 07:45:36,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [380768197] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 07:45:36,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 07:45:36,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2024-10-14 07:45:36,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752922220] [2024-10-14 07:45:36,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:45:36,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 07:45:36,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:45:36,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 07:45:36,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-14 07:45:36,473 INFO L87 Difference]: Start difference. First operand 60 states and 92 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-10-14 07:45:36,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:45:36,693 INFO L93 Difference]: Finished difference Result 120 states and 184 transitions. [2024-10-14 07:45:36,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 07:45:36,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 142 [2024-10-14 07:45:36,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:45:36,704 INFO L225 Difference]: With dead ends: 120 [2024-10-14 07:45:36,704 INFO L226 Difference]: Without dead ends: 61 [2024-10-14 07:45:36,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-14 07:45:36,708 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 3 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:45:36,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 168 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:45:36,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-14 07:45:36,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2024-10-14 07:45:36,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 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-10-14 07:45:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 91 transitions. [2024-10-14 07:45:36,727 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 91 transitions. Word has length 142 [2024-10-14 07:45:36,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:45:36,728 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 91 transitions. [2024-10-14 07:45:36,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-10-14 07:45:36,729 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 91 transitions. [2024-10-14 07:45:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 07:45:36,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:45:36,733 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] [2024-10-14 07:45:36,745 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-10-14 07:45:36,933 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-10-14 07:45:36,934 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:45:36,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:45:36,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1451688388, now seen corresponding path program 1 times [2024-10-14 07:45:36,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:45:36,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282105462] [2024-10-14 07:45:36,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:45:36,936 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:45:36,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:45:36,939 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-10-14 07:45:36,940 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-10-14 07:45:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:45:37,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 07:45:37,207 INFO L278 TraceCheckSpWp]: Computing forward predicates...