./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_fillercode_fillercodesize_ps-cn-10_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-74.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 9589d6d7240517079fa5770c7c63d7e78c3599002412f725197366bc44ac8d40 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:09:18,823 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:09:18,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 08:09:18,900 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:09:18,901 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:09:18,942 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:09:18,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:09:18,942 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:09:18,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:09:18,944 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:09:18,945 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:09:18,945 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:09:18,945 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:09:18,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:09:18,946 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:09:18,946 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:09:18,947 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:09:18,947 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:09:18,950 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 08:09:18,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:09:18,951 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:09:18,951 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:09:18,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:09:18,951 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:09:18,952 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:09:18,952 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:09:18,952 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:09:18,952 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:09:18,952 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:09:18,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:09:18,953 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:09:18,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:09:18,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:09:18,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:09:18,954 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:09:18,954 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:09:18,954 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 08:09:18,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 08:09:18,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:09:18,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:09:18,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:09:18,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:09:18,969 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-clean/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-clean/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 -> 9589d6d7240517079fa5770c7c63d7e78c3599002412f725197366bc44ac8d40 [2024-10-11 08:09:19,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:09:19,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:09:19,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:09:19,246 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:09:19,247 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:09:19,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-74.i [2024-10-11 08:09:20,686 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:09:20,916 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:09:20,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-74.i [2024-10-11 08:09:20,931 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e23a51f2d/be96d5b6cd674f35b74c4f3b57c5db77/FLAG0ae129379 [2024-10-11 08:09:21,262 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e23a51f2d/be96d5b6cd674f35b74c4f3b57c5db77 [2024-10-11 08:09:21,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:09:21,269 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:09:21,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:09:21,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:09:21,276 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:09:21,277 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:09:21" (1/1) ... [2024-10-11 08:09:21,278 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@577b81c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:21, skipping insertion in model container [2024-10-11 08:09:21,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:09:21" (1/1) ... [2024-10-11 08:09:21,308 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:09:21,478 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_fillercode_fillercodesize_ps-cn-10_file-74.i[915,928] [2024-10-11 08:09:21,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:09:21,560 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:09:21,571 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_fillercode_fillercodesize_ps-cn-10_file-74.i[915,928] [2024-10-11 08:09:21,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:09:21,628 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:09:21,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:21 WrapperNode [2024-10-11 08:09:21,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:09:21,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:09:21,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:09:21,631 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:09:21,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:21" (1/1) ... [2024-10-11 08:09:21,646 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:21" (1/1) ... [2024-10-11 08:09:21,688 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 232 [2024-10-11 08:09:21,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:09:21,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:09:21,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:09:21,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:09:21,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:21" (1/1) ... [2024-10-11 08:09:21,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:21" (1/1) ... [2024-10-11 08:09:21,711 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:21" (1/1) ... [2024-10-11 08:09:21,730 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-11 08:09:21,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:21" (1/1) ... [2024-10-11 08:09:21,731 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:21" (1/1) ... [2024-10-11 08:09:21,743 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:21" (1/1) ... [2024-10-11 08:09:21,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:21" (1/1) ... [2024-10-11 08:09:21,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:21" (1/1) ... [2024-10-11 08:09:21,754 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:21" (1/1) ... [2024-10-11 08:09:21,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:09:21,763 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:09:21,763 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:09:21,763 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:09:21,764 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:21" (1/1) ... [2024-10-11 08:09:21,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:09:21,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:09:21,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:09:21,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:09:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:09:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:09:21,855 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:09:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 08:09:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:09:21,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:09:21,962 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:09:21,963 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:09:22,352 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-11 08:09:22,353 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:09:22,408 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:09:22,409 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:09:22,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:09:22 BoogieIcfgContainer [2024-10-11 08:09:22,409 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:09:22,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:09:22,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:09:22,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:09:22,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:09:21" (1/3) ... [2024-10-11 08:09:22,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320b03d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:09:22, skipping insertion in model container [2024-10-11 08:09:22,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:21" (2/3) ... [2024-10-11 08:09:22,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320b03d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:09:22, skipping insertion in model container [2024-10-11 08:09:22,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:09:22" (3/3) ... [2024-10-11 08:09:22,419 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-74.i [2024-10-11 08:09:22,435 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:09:22,436 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:09:22,493 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:09:22,500 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;@2d0d7669, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:09:22,500 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:09:22,504 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 58 states have internal predecessors, (79), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 08:09:22,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-11 08:09:22,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:09:22,527 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:09:22,527 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:09:22,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:09:22,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1789358683, now seen corresponding path program 1 times [2024-10-11 08:09:22,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:09:22,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146922797] [2024-10-11 08:09:22,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:22,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:09:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:22,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:09:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:22,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:09:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:22,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:09:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:22,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:09:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:22,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:09:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:22,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:09:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:22,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:09:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:22,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:09:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:22,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:09:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:22,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:09:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:22,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:09:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:22,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:09:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:22,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:09:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:22,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:09:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:22,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:09:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:22,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:09:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:09:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:09:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:09:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:09:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:09:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 08:09:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 08:09:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 08:09:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 08:09:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 08:09:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 08:09:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 08:09:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 08:09:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 08:09:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 08:09:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 08:09:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 08:09:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 08:09:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 08:09:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 08:09:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 08:09:23,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:09:23,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146922797] [2024-10-11 08:09:23,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146922797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:09:23,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:09:23,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:09:23,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383058445] [2024-10-11 08:09:23,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:09:23,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:09:23,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:09:23,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:09:23,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:09:23,147 INFO L87 Difference]: Start difference. First operand has 96 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 58 states have internal predecessors, (79), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 08:09:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:09:23,194 INFO L93 Difference]: Finished difference Result 188 states and 334 transitions. [2024-10-11 08:09:23,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:09:23,198 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) Word has length 220 [2024-10-11 08:09:23,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:09:23,209 INFO L225 Difference]: With dead ends: 188 [2024-10-11 08:09:23,210 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 08:09:23,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 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-11 08:09:23,222 INFO L432 NwaCegarLoop]: 140 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, 140 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-11 08:09:23,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:09:23,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 08:09:23,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 08:09:23,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 55 states have (on average 1.290909090909091) internal successors, (71), 55 states have internal predecessors, (71), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 08:09:23,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 143 transitions. [2024-10-11 08:09:23,285 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 143 transitions. Word has length 220 [2024-10-11 08:09:23,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:09:23,285 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 143 transitions. [2024-10-11 08:09:23,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 08:09:23,286 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 143 transitions. [2024-10-11 08:09:23,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-11 08:09:23,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:09:23,296 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:09:23,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 08:09:23,298 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:09:23,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:09:23,299 INFO L85 PathProgramCache]: Analyzing trace with hash 701909903, now seen corresponding path program 1 times [2024-10-11 08:09:23,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:09:23,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139230255] [2024-10-11 08:09:23,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:23,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:09:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:09:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:09:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:09:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:09:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:09:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:09:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:09:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:09:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:09:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:09:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:09:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:09:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:09:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:09:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:09:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:09:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:09:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:09:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:09:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:09:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:09:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 08:09:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 08:09:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 08:09:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 08:09:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 08:09:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 08:09:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 08:09:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 08:09:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 08:09:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 08:09:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 08:09:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 08:09:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 08:09:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 08:09:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 08:09:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:23,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 08:09:23,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:09:23,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139230255] [2024-10-11 08:09:23,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139230255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:09:23,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:09:23,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:09:23,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187852385] [2024-10-11 08:09:23,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:09:23,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:09:23,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:09:23,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:09:23,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:09:23,744 INFO L87 Difference]: Start difference. First operand 93 states and 143 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 08:09:23,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:09:23,844 INFO L93 Difference]: Finished difference Result 217 states and 329 transitions. [2024-10-11 08:09:23,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:09:23,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 220 [2024-10-11 08:09:23,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:09:23,851 INFO L225 Difference]: With dead ends: 217 [2024-10-11 08:09:23,853 INFO L226 Difference]: Without dead ends: 125 [2024-10-11 08:09:23,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:09:23,857 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 42 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:09:23,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 270 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:09:23,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-11 08:09:23,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2024-10-11 08:09:23,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 75 states have (on average 1.28) internal successors, (96), 76 states have internal predecessors, (96), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 08:09:23,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 184 transitions. [2024-10-11 08:09:23,896 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 184 transitions. Word has length 220 [2024-10-11 08:09:23,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:09:23,897 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 184 transitions. [2024-10-11 08:09:23,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 08:09:23,897 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 184 transitions. [2024-10-11 08:09:23,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-11 08:09:23,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:09:23,901 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:09:23,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 08:09:23,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:09:23,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:09:23,902 INFO L85 PathProgramCache]: Analyzing trace with hash -107436723, now seen corresponding path program 1 times [2024-10-11 08:09:23,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:09:23,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746543446] [2024-10-11 08:09:23,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:23,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:09:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:09:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:09:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:09:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:09:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:09:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:09:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:09:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:09:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:09:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:09:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:09:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:09:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:09:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:09:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:09:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:09:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:09:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:09:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:09:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:09:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:09:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 08:09:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 08:09:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 08:09:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 08:09:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 08:09:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 08:09:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 08:09:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 08:09:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 08:09:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 08:09:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 08:09:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 08:09:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 08:09:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 08:09:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 08:09:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:24,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 08:09:24,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:09:24,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746543446] [2024-10-11 08:09:24,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746543446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:09:24,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:09:24,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 08:09:24,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265362570] [2024-10-11 08:09:24,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:09:24,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:09:24,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:09:24,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:09:24,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:09:24,936 INFO L87 Difference]: Start difference. First operand 122 states and 184 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 08:09:25,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:09:25,413 INFO L93 Difference]: Finished difference Result 354 states and 532 transitions. [2024-10-11 08:09:25,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:09:25,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 220 [2024-10-11 08:09:25,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:09:25,424 INFO L225 Difference]: With dead ends: 354 [2024-10-11 08:09:25,424 INFO L226 Difference]: Without dead ends: 233 [2024-10-11 08:09:25,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 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-11 08:09:25,428 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 86 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 08:09:25,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 457 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 08:09:25,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-11 08:09:25,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 192. [2024-10-11 08:09:25,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 107 states have (on average 1.2149532710280373) internal successors, (130), 108 states have internal predecessors, (130), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 08:09:25,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 290 transitions. [2024-10-11 08:09:25,490 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 290 transitions. Word has length 220 [2024-10-11 08:09:25,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:09:25,492 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 290 transitions. [2024-10-11 08:09:25,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 08:09:25,493 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 290 transitions. [2024-10-11 08:09:25,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-11 08:09:25,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:09:25,498 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:09:25,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 08:09:25,498 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:09:25,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:09:25,499 INFO L85 PathProgramCache]: Analyzing trace with hash 574633785, now seen corresponding path program 1 times [2024-10-11 08:09:25,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:09:25,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219618614] [2024-10-11 08:09:25,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:25,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:09:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:25,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:09:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:25,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:09:25,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:25,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:09:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:25,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:09:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:09:26,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:09:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:09:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:09:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:09:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:09:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:09:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:09:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:09:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:09:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:09:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:09:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:09:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:09:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:09:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:09:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:09:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 08:09:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 08:09:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 08:09:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 08:09:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 08:09:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 08:09:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 08:09:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 08:09:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 08:09:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 08:09:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 08:09:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 08:09:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 08:09:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 08:09:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 08:09:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:26,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 08:09:26,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:09:26,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219618614] [2024-10-11 08:09:26,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219618614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:09:26,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:09:26,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 08:09:26,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020407116] [2024-10-11 08:09:26,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:09:26,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:09:26,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:09:26,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:09:26,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:09:26,242 INFO L87 Difference]: Start difference. First operand 192 states and 290 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 08:09:26,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:09:26,600 INFO L93 Difference]: Finished difference Result 354 states and 531 transitions. [2024-10-11 08:09:26,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:09:26,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 221 [2024-10-11 08:09:26,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:09:26,608 INFO L225 Difference]: With dead ends: 354 [2024-10-11 08:09:26,608 INFO L226 Difference]: Without dead ends: 233 [2024-10-11 08:09:26,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 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-11 08:09:26,611 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 84 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 08:09:26,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 458 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 08:09:26,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-11 08:09:26,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 193. [2024-10-11 08:09:26,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 108 states have (on average 1.212962962962963) internal successors, (131), 109 states have internal predecessors, (131), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 08:09:26,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 291 transitions. [2024-10-11 08:09:26,666 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 291 transitions. Word has length 221 [2024-10-11 08:09:26,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:09:26,666 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 291 transitions. [2024-10-11 08:09:26,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 08:09:26,667 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 291 transitions. [2024-10-11 08:09:26,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-11 08:09:26,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:09:26,669 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:09:26,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 08:09:26,669 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:09:26,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:09:26,670 INFO L85 PathProgramCache]: Analyzing trace with hash -705229893, now seen corresponding path program 1 times [2024-10-11 08:09:26,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:09:26,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50840985] [2024-10-11 08:09:26,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:26,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:09:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:09:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:09:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:09:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:09:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:09:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:09:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:09:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:09:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:09:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:09:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:09:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:09:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:09:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:09:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:09:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:09:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:09:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:09:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:09:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:09:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:09:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 08:09:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 08:09:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 08:09:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 08:09:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 08:09:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 08:09:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 08:09:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 08:09:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 08:09:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 08:09:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 08:09:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 08:09:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 08:09:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 08:09:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 08:09:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:27,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 08:09:27,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:09:27,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50840985] [2024-10-11 08:09:27,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50840985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:09:27,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:09:27,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:09:27,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144176201] [2024-10-11 08:09:27,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:09:27,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:09:27,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:09:27,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:09:27,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:09:27,316 INFO L87 Difference]: Start difference. First operand 193 states and 291 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 08:09:27,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:09:27,420 INFO L93 Difference]: Finished difference Result 321 states and 485 transitions. [2024-10-11 08:09:27,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:09:27,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 221 [2024-10-11 08:09:27,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:09:27,424 INFO L225 Difference]: With dead ends: 321 [2024-10-11 08:09:27,424 INFO L226 Difference]: Without dead ends: 200 [2024-10-11 08:09:27,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:09:27,428 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 132 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:09:27,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 597 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:09:27,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-11 08:09:27,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 193. [2024-10-11 08:09:27,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 109 states have internal predecessors, (129), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 08:09:27,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 289 transitions. [2024-10-11 08:09:27,483 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 289 transitions. Word has length 221 [2024-10-11 08:09:27,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:09:27,484 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 289 transitions. [2024-10-11 08:09:27,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 08:09:27,485 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 289 transitions. [2024-10-11 08:09:27,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-11 08:09:27,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:09:27,487 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:09:27,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 08:09:27,487 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:09:27,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:09:27,488 INFO L85 PathProgramCache]: Analyzing trace with hash 289531338, now seen corresponding path program 1 times [2024-10-11 08:09:27,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:09:27,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267021956] [2024-10-11 08:09:27,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:27,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:09:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:09:27,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [77209643] [2024-10-11 08:09:27,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:27,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:09:27,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:09:27,580 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:09:27,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 08:09:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:09:27,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 08:09:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:09:27,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 08:09:27,951 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 08:09:27,952 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 08:09:27,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 08:09:28,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:09:28,158 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 08:09:28,326 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 08:09:28,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:09:28 BoogieIcfgContainer [2024-10-11 08:09:28,329 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 08:09:28,330 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 08:09:28,330 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 08:09:28,330 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 08:09:28,330 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:09:22" (3/4) ... [2024-10-11 08:09:28,332 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 08:09:28,333 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 08:09:28,334 INFO L158 Benchmark]: Toolchain (without parser) took 7065.20ms. Allocated memory was 176.2MB in the beginning and 237.0MB in the end (delta: 60.8MB). Free memory was 130.3MB in the beginning and 189.4MB in the end (delta: -59.1MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. [2024-10-11 08:09:28,334 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory is still 145.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:09:28,335 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.71ms. Allocated memory is still 176.2MB. Free memory was 129.5MB in the beginning and 113.5MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 08:09:28,335 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.72ms. Allocated memory is still 176.2MB. Free memory was 113.5MB in the beginning and 110.0MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 08:09:28,335 INFO L158 Benchmark]: Boogie Preprocessor took 69.47ms. Allocated memory is still 176.2MB. Free memory was 110.0MB in the beginning and 106.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 08:09:28,336 INFO L158 Benchmark]: RCFGBuilder took 646.40ms. Allocated memory is still 176.2MB. Free memory was 106.4MB in the beginning and 76.5MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-11 08:09:28,336 INFO L158 Benchmark]: TraceAbstraction took 5916.86ms. Allocated memory was 176.2MB in the beginning and 237.0MB in the end (delta: 60.8MB). Free memory was 75.7MB in the beginning and 189.4MB in the end (delta: -113.7MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. [2024-10-11 08:09:28,336 INFO L158 Benchmark]: Witness Printer took 3.65ms. Allocated memory is still 237.0MB. Free memory is still 189.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:09:28,338 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.19ms. Allocated memory is still 176.2MB. Free memory is still 145.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.71ms. Allocated memory is still 176.2MB. Free memory was 129.5MB in the beginning and 113.5MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.72ms. Allocated memory is still 176.2MB. Free memory was 113.5MB in the beginning and 110.0MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.47ms. Allocated memory is still 176.2MB. Free memory was 110.0MB in the beginning and 106.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 646.40ms. Allocated memory is still 176.2MB. Free memory was 106.4MB in the beginning and 76.5MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5916.86ms. Allocated memory was 176.2MB in the beginning and 237.0MB in the end (delta: 60.8MB). Free memory was 75.7MB in the beginning and 189.4MB in the end (delta: -113.7MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. * Witness Printer took 3.65ms. Allocated memory is still 237.0MB. Free memory is still 189.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 180, overapproximation of someBinaryDOUBLEComparisonOperation at line 180, overapproximation of someBinaryArithmeticFLOAToperation at line 109. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 64; [L23] unsigned char var_1_4 = 0; [L24] unsigned long int var_1_5 = 3914692693; [L25] unsigned long int var_1_7 = 1; [L26] unsigned char var_1_8 = 0; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 0; [L29] unsigned char var_1_11 = 50; [L30] signed long int var_1_12 = 25; [L31] signed long int var_1_13 = 1; [L32] float var_1_15 = 4.75; [L33] unsigned char var_1_16 = 100; [L34] float var_1_17 = 50.1; [L35] float var_1_18 = 100.9; [L36] float var_1_19 = 8.5; [L37] float var_1_20 = 10.625; [L38] float var_1_21 = 0.0; [L39] float var_1_22 = 7.8; [L40] float var_1_23 = 8.25; [L41] double var_1_24 = 5.5; [L42] signed char var_1_25 = -16; [L43] unsigned char var_1_26 = 1; [L44] unsigned long int var_1_27 = 1; [L45] unsigned long int var_1_28 = 4; [L46] signed char var_1_29 = 5; [L47] unsigned short int var_1_30 = 128; [L48] unsigned short int var_1_31 = 16; [L49] unsigned char var_1_32 = 8; [L50] unsigned char var_1_33 = 0; [L51] unsigned short int var_1_34 = 256; [L52] signed short int var_1_35 = -256; [L53] unsigned char var_1_36 = 0; [L54] unsigned char var_1_37 = 0; [L55] unsigned long int last_1_var_1_1 = 64; [L56] unsigned char last_1_var_1_11 = 50; [L184] isInitial = 1 [L185] FCALL initially() [L186] COND TRUE 1 [L187] CALL updateLastVariables() [L176] last_1_var_1_1 = var_1_1 [L177] last_1_var_1_11 = var_1_11 [L187] RET updateLastVariables() [L188] CALL updateVariables() [L117] var_1_4 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L118] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L119] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L119] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L120] var_1_5 = __VERIFIER_nondet_ulong() [L121] CALL assume_abort_if_not(var_1_5 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L121] RET assume_abort_if_not(var_1_5 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L122] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L122] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L123] var_1_7 = __VERIFIER_nondet_ulong() [L124] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L124] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L125] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L125] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L126] var_1_9 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L127] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L128] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L128] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L129] var_1_10 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L130] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L131] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L131] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L132] var_1_12 = __VERIFIER_nondet_long() [L133] CALL assume_abort_if_not(var_1_12 >= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L133] RET assume_abort_if_not(var_1_12 >= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L134] CALL assume_abort_if_not(var_1_12 <= 29) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L134] RET assume_abort_if_not(var_1_12 <= 29) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L135] var_1_13 = __VERIFIER_nondet_long() [L136] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L136] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L137] CALL assume_abort_if_not(var_1_13 <= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L137] RET assume_abort_if_not(var_1_13 <= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L138] var_1_16 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L139] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L140] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L140] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L141] var_1_17 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L142] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L143] var_1_19 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L144] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L145] var_1_20 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L146] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L147] var_1_21 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L148] RET assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L149] var_1_22 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L150] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L151] var_1_23 = __VERIFIER_nondet_float() [L152] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L152] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L153] var_1_26 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L154] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L155] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L155] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L156] var_1_27 = __VERIFIER_nondet_ulong() [L157] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L157] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L158] CALL assume_abort_if_not(var_1_27 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L158] RET assume_abort_if_not(var_1_27 <= 4294967295) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_28=4, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L159] var_1_28 = __VERIFIER_nondet_ulong() [L160] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L160] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L161] CALL assume_abort_if_not(var_1_28 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L161] RET assume_abort_if_not(var_1_28 <= 4294967295) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=5, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L162] var_1_29 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_29 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L163] RET assume_abort_if_not(var_1_29 >= -127) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L164] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L164] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=128, var_1_31=16, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L165] var_1_31 = __VERIFIER_nondet_ushort() [L166] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=128, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=128, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L166] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=128, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L167] CALL assume_abort_if_not(var_1_31 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=128, var_1_31=0, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=128, var_1_31=0, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L167] RET assume_abort_if_not(var_1_31 <= 65534) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=128, var_1_31=0, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L168] var_1_33 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=128, var_1_31=0, var_1_32=8, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=128, var_1_31=0, var_1_32=8, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L169] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=128, var_1_31=0, var_1_32=8, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L170] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=128, var_1_31=0, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=128, var_1_31=0, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L170] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=128, var_1_31=0, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=0, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L171] var_1_37 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_37 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=128, var_1_31=0, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=1, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=128, var_1_31=0, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=1, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L172] RET assume_abort_if_not(var_1_37 >= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=128, var_1_31=0, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=1, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L173] CALL assume_abort_if_not(var_1_37 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=128, var_1_31=0, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=1, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=128, var_1_31=0, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=1, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L173] RET assume_abort_if_not(var_1_37 <= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=128, var_1_31=0, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=1, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L188] RET updateVariables() [L189] CALL step() [L60] COND FALSE !(\read(var_1_26)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=128, var_1_31=0, var_1_32=8, var_1_33=0, var_1_34=256, var_1_35=-256, var_1_36=0, var_1_37=1, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L65] var_1_30 = var_1_31 [L66] var_1_32 = var_1_33 [L67] var_1_34 = var_1_31 [L68] var_1_35 = var_1_25 [L69] var_1_36 = var_1_37 [L70] signed long int stepLocal_1 = last_1_var_1_11; [L71] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, stepLocal_1=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-16, var_1_36=1, var_1_37=1, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L72] COND TRUE stepLocal_1 < last_1_var_1_1 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-16, var_1_36=1, var_1_37=1, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L73] COND FALSE !(last_1_var_1_1 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-16, var_1_36=1, var_1_37=1, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L77] unsigned long int stepLocal_3 = var_1_7; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-16, var_1_36=1, var_1_37=1, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L78] EXPR 5u << (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-16, var_1_36=1, var_1_37=1, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L78] unsigned long int stepLocal_2 = 5u << (var_1_12 - var_1_13); [L79] COND FALSE !(! ((var_1_5 > var_1_7) || var_1_8)) [L90] var_1_11 = var_1_12 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-16, var_1_36=1, var_1_37=1, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L92] COND FALSE !(! (var_1_11 >= var_1_11)) [L99] var_1_1 = var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-16, var_1_36=1, var_1_37=1, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L101] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-16, var_1_36=1, var_1_37=1, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L106] COND FALSE !(\read(var_1_10)) [L109] var_1_18 = (((var_1_21 - var_1_22) - var_1_23) + var_1_20) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-16, var_1_36=1, var_1_37=1, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L111] unsigned long int stepLocal_4 = ~ var_1_1; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, stepLocal_4=4294967281, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-16, var_1_36=1, var_1_37=1, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L112] COND FALSE !(stepLocal_4 <= (var_1_12 - var_1_11)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-16, var_1_36=1, var_1_37=1, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L189] RET step() [L190] CALL, EXPR property() [L180] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-16, var_1_36=1, var_1_37=1, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L180] EXPR (! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-16, var_1_36=1, var_1_37=1, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L180] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-16, var_1_36=1, var_1_37=1, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L180-L181] return ((((((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)))) && (var_1_10 ? ((var_1_1 > (var_1_11 / (var_1_12 + var_1_16))) ? (var_1_15 == ((float) var_1_17)) : 1) : 1)) && (var_1_10 ? (var_1_18 == ((float) (var_1_19 + var_1_20))) : (var_1_18 == ((float) (((var_1_21 - var_1_22) - var_1_23) + var_1_20))))) && (((~ var_1_1) <= (var_1_12 - var_1_11)) ? (var_1_24 == ((double) var_1_22)) : 1) ; [L190] RET, EXPR property() [L190] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-16, var_1_36=1, var_1_37=1, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_29=-127, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-16, var_1_36=1, var_1_37=1, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 6, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 344 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 344 mSDsluCounter, 1922 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1129 mSDsCounter, 220 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 277 IncrementalHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 220 mSolverCounterUnsat, 793 mSDtfsCounter, 277 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 424 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=193occurred in iteration=4, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 91 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1548 NumberOfCodeBlocks, 1548 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1097 ConstructedInterpolants, 0 QuantifiedInterpolants, 2812 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 12600/12600 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-11 08:09:28,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-74.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 9589d6d7240517079fa5770c7c63d7e78c3599002412f725197366bc44ac8d40 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:09:30,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:09:30,668 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 08:09:30,674 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:09:30,675 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:09:30,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:09:30,706 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:09:30,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:09:30,707 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:09:30,711 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:09:30,711 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:09:30,711 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:09:30,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:09:30,712 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:09:30,713 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:09:30,713 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:09:30,714 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:09:30,715 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:09:30,715 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:09:30,715 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:09:30,715 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:09:30,716 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:09:30,716 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:09:30,716 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 08:09:30,717 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 08:09:30,718 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:09:30,718 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 08:09:30,718 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:09:30,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:09:30,719 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:09:30,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:09:30,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:09:30,720 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:09:30,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:09:30,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:09:30,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:09:30,722 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:09:30,722 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:09:30,722 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 08:09:30,723 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 08:09:30,723 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:09:30,723 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:09:30,723 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:09:30,724 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:09:30,724 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 08:09:30,724 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-clean/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-clean/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 -> 9589d6d7240517079fa5770c7c63d7e78c3599002412f725197366bc44ac8d40 [2024-10-11 08:09:31,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:09:31,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:09:31,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:09:31,125 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:09:31,125 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:09:31,128 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-74.i [2024-10-11 08:09:32,738 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:09:32,974 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:09:32,977 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-74.i [2024-10-11 08:09:32,987 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e4f2b3f64/77535ba304604dd0856385af81c1addf/FLAGb9285d65c [2024-10-11 08:09:33,000 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e4f2b3f64/77535ba304604dd0856385af81c1addf [2024-10-11 08:09:33,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:09:33,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:09:33,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:09:33,006 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:09:33,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:09:33,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:09:33" (1/1) ... [2024-10-11 08:09:33,013 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@156effa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:33, skipping insertion in model container [2024-10-11 08:09:33,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:09:33" (1/1) ... [2024-10-11 08:09:33,045 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:09:33,231 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_fillercode_fillercodesize_ps-cn-10_file-74.i[915,928] [2024-10-11 08:09:33,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:09:33,325 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:09:33,339 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_fillercode_fillercodesize_ps-cn-10_file-74.i[915,928] [2024-10-11 08:09:33,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:09:33,407 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:09:33,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:33 WrapperNode [2024-10-11 08:09:33,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:09:33,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:09:33,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:09:33,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:09:33,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:33" (1/1) ... [2024-10-11 08:09:33,432 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:33" (1/1) ... [2024-10-11 08:09:33,473 INFO L138 Inliner]: procedures = 27, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2024-10-11 08:09:33,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:09:33,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:09:33,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:09:33,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:09:33,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:33" (1/1) ... [2024-10-11 08:09:33,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:33" (1/1) ... [2024-10-11 08:09:33,494 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:33" (1/1) ... [2024-10-11 08:09:33,509 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-11 08:09:33,513 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:33" (1/1) ... [2024-10-11 08:09:33,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:33" (1/1) ... [2024-10-11 08:09:33,533 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:33" (1/1) ... [2024-10-11 08:09:33,537 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:33" (1/1) ... [2024-10-11 08:09:33,543 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:33" (1/1) ... [2024-10-11 08:09:33,548 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:33" (1/1) ... [2024-10-11 08:09:33,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:09:33,557 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:09:33,557 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:09:33,557 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:09:33,558 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:33" (1/1) ... [2024-10-11 08:09:33,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:09:33,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:09:33,596 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:09:33,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:09:33,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:09:33,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 08:09:33,660 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:09:33,660 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:09:33,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:09:33,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:09:33,761 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:09:33,763 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:09:37,176 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 08:09:37,176 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:09:37,272 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:09:37,273 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:09:37,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:09:37 BoogieIcfgContainer [2024-10-11 08:09:37,273 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:09:37,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:09:37,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:09:37,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:09:37,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:09:33" (1/3) ... [2024-10-11 08:09:37,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e094fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:09:37, skipping insertion in model container [2024-10-11 08:09:37,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:33" (2/3) ... [2024-10-11 08:09:37,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e094fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:09:37, skipping insertion in model container [2024-10-11 08:09:37,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:09:37" (3/3) ... [2024-10-11 08:09:37,286 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-74.i [2024-10-11 08:09:37,303 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:09:37,303 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:09:37,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:09:37,388 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;@18a9f078, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:09:37,389 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:09:37,394 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 48 states have internal predecessors, (65), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 08:09:37,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-11 08:09:37,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:09:37,411 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:09:37,412 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:09:37,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:09:37,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1984465036, now seen corresponding path program 1 times [2024-10-11 08:09:37,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:09:37,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588450721] [2024-10-11 08:09:37,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:37,437 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-11 08:09:37,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:09:37,440 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 08:09:37,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:09:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:37,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 08:09:37,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:09:37,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1174 proven. 0 refuted. 0 times theorem prover too weak. 1346 trivial. 0 not checked. [2024-10-11 08:09:37,945 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:09:37,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:09:37,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [588450721] [2024-10-11 08:09:37,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [588450721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:09:37,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:09:37,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:09:37,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418868911] [2024-10-11 08:09:37,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:09:37,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:09:37,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:09:37,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:09:37,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:09:37,979 INFO L87 Difference]: Start difference. First operand has 86 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 48 states have internal predecessors, (65), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 08:09:39,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:09:39,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:09:39,232 INFO L93 Difference]: Finished difference Result 168 states and 306 transitions. [2024-10-11 08:09:39,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:09:39,256 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 216 [2024-10-11 08:09:39,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:09:39,264 INFO L225 Difference]: With dead ends: 168 [2024-10-11 08:09:39,264 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 08:09:39,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 215 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-11 08:09:39,271 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:09:39,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 08:09:39,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 08:09:39,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-11 08:09:39,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 08:09:39,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 129 transitions. [2024-10-11 08:09:39,321 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 129 transitions. Word has length 216 [2024-10-11 08:09:39,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:09:39,321 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 129 transitions. [2024-10-11 08:09:39,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 08:09:39,322 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 129 transitions. [2024-10-11 08:09:39,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-11 08:09:39,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:09:39,329 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:09:39,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:09:39,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 08:09:39,531 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:09:39,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:09:39,532 INFO L85 PathProgramCache]: Analyzing trace with hash 2090605504, now seen corresponding path program 1 times [2024-10-11 08:09:39,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:09:39,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676332317] [2024-10-11 08:09:39,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:39,533 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-11 08:09:39,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:09:39,536 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 08:09:39,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:09:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:39,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 08:09:39,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:09:42,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 08:09:42,435 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:09:42,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:09:42,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676332317] [2024-10-11 08:09:42,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [676332317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:09:42,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:09:42,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:09:42,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668100426] [2024-10-11 08:09:42,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:09:42,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:09:42,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:09:42,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:09:42,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:09:42,444 INFO L87 Difference]: Start difference. First operand 83 states and 129 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 08:09:45,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:09:47,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:09:47,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:09:47,978 INFO L93 Difference]: Finished difference Result 248 states and 386 transitions. [2024-10-11 08:09:48,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:09:48,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 216 [2024-10-11 08:09:48,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:09:48,013 INFO L225 Difference]: With dead ends: 248 [2024-10-11 08:09:48,014 INFO L226 Difference]: Without dead ends: 166 [2024-10-11 08:09:48,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 212 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-11 08:09:48,020 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 65 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-10-11 08:09:48,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 407 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-10-11 08:09:48,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-11 08:09:48,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2024-10-11 08:09:48,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 74 states have (on average 1.1891891891891893) internal successors, (88), 74 states have internal predecessors, (88), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 08:09:48,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 232 transitions. [2024-10-11 08:09:48,076 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 232 transitions. Word has length 216 [2024-10-11 08:09:48,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:09:48,078 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 232 transitions. [2024-10-11 08:09:48,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 08:09:48,080 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 232 transitions. [2024-10-11 08:09:48,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-11 08:09:48,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:09:48,086 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:09:48,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 08:09:48,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 08:09:48,287 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:09:48,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:09:48,288 INFO L85 PathProgramCache]: Analyzing trace with hash -508636732, now seen corresponding path program 1 times [2024-10-11 08:09:48,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:09:48,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323224724] [2024-10-11 08:09:48,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:48,289 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-11 08:09:48,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:09:48,292 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 08:09:48,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:09:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:48,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 08:09:48,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:09:50,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 08:09:50,654 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:09:50,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:09:50,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323224724] [2024-10-11 08:09:50,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323224724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:09:50,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:09:50,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:09:50,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997764489] [2024-10-11 08:09:50,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:09:50,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:09:50,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:09:50,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:09:50,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:09:50,659 INFO L87 Difference]: Start difference. First operand 149 states and 232 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 08:09:52,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:09:53,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:09:53,274 INFO L93 Difference]: Finished difference Result 248 states and 385 transitions. [2024-10-11 08:09:53,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:09:53,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 217 [2024-10-11 08:09:53,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:09:53,299 INFO L225 Difference]: With dead ends: 248 [2024-10-11 08:09:53,299 INFO L226 Difference]: Without dead ends: 166 [2024-10-11 08:09:53,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 213 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-11 08:09:53,302 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 63 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 08:09:53,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 408 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 08:09:53,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-11 08:09:53,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 150. [2024-10-11 08:09:53,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 75 states have (on average 1.1866666666666668) internal successors, (89), 75 states have internal predecessors, (89), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 08:09:53,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 233 transitions. [2024-10-11 08:09:53,343 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 233 transitions. Word has length 217 [2024-10-11 08:09:53,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:09:53,344 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 233 transitions. [2024-10-11 08:09:53,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 08:09:53,345 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 233 transitions. [2024-10-11 08:09:53,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-11 08:09:53,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:09:53,348 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:09:53,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 08:09:53,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 08:09:53,549 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:09:53,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:09:53,550 INFO L85 PathProgramCache]: Analyzing trace with hash 192427846, now seen corresponding path program 1 times [2024-10-11 08:09:53,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:09:53,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31729660] [2024-10-11 08:09:53,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:53,551 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-11 08:09:53,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:09:53,554 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 08:09:53,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (5)] Waiting until timeout for monitored process [2024-10-11 08:09:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:53,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 08:09:53,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:09:54,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 989 proven. 78 refuted. 0 times theorem prover too weak. 1453 trivial. 0 not checked. [2024-10-11 08:09:54,343 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:09:54,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 27 proven. 78 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2024-10-11 08:09:54,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:09:54,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31729660] [2024-10-11 08:09:54,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31729660] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:09:54,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 08:09:54,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-11 08:09:54,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452875413] [2024-10-11 08:09:54,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 08:09:54,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 08:09:54,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:09:54,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 08:09:54,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:09:54,910 INFO L87 Difference]: Start difference. First operand 150 states and 233 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-10-11 08:09:58,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:09:58,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:09:58,220 INFO L93 Difference]: Finished difference Result 247 states and 373 transitions. [2024-10-11 08:09:58,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 08:09:58,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 217 [2024-10-11 08:09:58,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:09:58,223 INFO L225 Difference]: With dead ends: 247 [2024-10-11 08:09:58,224 INFO L226 Difference]: Without dead ends: 165 [2024-10-11 08:09:58,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 426 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 08:09:58,226 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 34 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:09:58,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 169 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 08:09:58,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-11 08:09:58,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2024-10-11 08:09:58,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 80 states have (on average 1.1375) internal successors, (91), 80 states have internal predecessors, (91), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 08:09:58,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 235 transitions. [2024-10-11 08:09:58,262 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 235 transitions. Word has length 217 [2024-10-11 08:09:58,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:09:58,263 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 235 transitions. [2024-10-11 08:09:58,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-10-11 08:09:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 235 transitions. [2024-10-11 08:09:58,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-11 08:09:58,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:09:58,267 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:09:58,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (5)] Forceful destruction successful, exit code 0 [2024-10-11 08:09:58,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-11 08:09:58,468 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:09:58,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:09:58,469 INFO L85 PathProgramCache]: Analyzing trace with hash 249686148, now seen corresponding path program 1 times [2024-10-11 08:09:58,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:09:58,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374639662] [2024-10-11 08:09:58,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:58,470 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-11 08:09:58,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:09:58,472 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-11 08:09:58,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (6)] Waiting until timeout for monitored process [2024-10-11 08:09:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:58,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 08:09:58,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:10:00,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1082 proven. 144 refuted. 0 times theorem prover too weak. 1294 trivial. 0 not checked. [2024-10-11 08:10:00,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:10:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 30 proven. 75 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2024-10-11 08:10:01,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:10:01,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374639662] [2024-10-11 08:10:01,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [374639662] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:10:01,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 08:10:01,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-10-11 08:10:01,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471489853] [2024-10-11 08:10:01,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 08:10:01,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 08:10:01,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:10:01,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 08:10:01,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-11 08:10:01,565 INFO L87 Difference]: Start difference. First operand 157 states and 235 transitions. Second operand has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 16 states have internal predecessors, (79), 4 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) [2024-10-11 08:10:04,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:10:06,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:10:07,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:10:07,586 INFO L93 Difference]: Finished difference Result 304 states and 429 transitions. [2024-10-11 08:10:07,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 08:10:07,587 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 16 states have internal predecessors, (79), 4 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) Word has length 217 [2024-10-11 08:10:07,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:10:07,590 INFO L225 Difference]: With dead ends: 304 [2024-10-11 08:10:07,590 INFO L226 Difference]: Without dead ends: 219 [2024-10-11 08:10:07,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2024-10-11 08:10:07,592 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 104 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-11 08:10:07,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 385 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-10-11 08:10:07,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-11 08:10:07,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 197. [2024-10-11 08:10:07,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 107 states have (on average 1.1121495327102804) internal successors, (119), 108 states have internal predecessors, (119), 80 states have call successors, (80), 9 states have call predecessors, (80), 9 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 08:10:07,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 279 transitions. [2024-10-11 08:10:07,616 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 279 transitions. Word has length 217 [2024-10-11 08:10:07,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:10:07,617 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 279 transitions. [2024-10-11 08:10:07,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 16 states have internal predecessors, (79), 4 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) [2024-10-11 08:10:07,617 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 279 transitions. [2024-10-11 08:10:07,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-11 08:10:07,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:10:07,620 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:10:07,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (6)] Ended with exit code 0 [2024-10-11 08:10:07,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-11 08:10:07,825 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:10:07,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:10:07,825 INFO L85 PathProgramCache]: Analyzing trace with hash 249745730, now seen corresponding path program 1 times [2024-10-11 08:10:07,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:10:07,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306263738] [2024-10-11 08:10:07,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:10:07,826 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-11 08:10:07,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:10:07,828 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-11 08:10:07,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (7)] Waiting until timeout for monitored process [2024-10-11 08:10:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:10:08,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 08:10:08,271 INFO L278 TraceCheckSpWp]: Computing forward predicates...